/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-McrStrategy.epf -i ../../../trunk/examples/svcomp/pthread-ext/45_monabsex1_vs.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b981219 [2020-04-18 07:47:58,257 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-04-18 07:47:58,259 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-04-18 07:47:58,274 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-04-18 07:47:58,274 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-04-18 07:47:58,275 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-04-18 07:47:58,276 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-04-18 07:47:58,278 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-04-18 07:47:58,280 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-04-18 07:47:58,281 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-04-18 07:47:58,281 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-04-18 07:47:58,283 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-04-18 07:47:58,283 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-04-18 07:47:58,284 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-04-18 07:47:58,285 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-04-18 07:47:58,286 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-04-18 07:47:58,287 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-04-18 07:47:58,288 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-04-18 07:47:58,289 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-04-18 07:47:58,291 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-04-18 07:47:58,293 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-04-18 07:47:58,294 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-04-18 07:47:58,295 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-04-18 07:47:58,296 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-04-18 07:47:58,298 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-04-18 07:47:58,298 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-04-18 07:47:58,299 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-04-18 07:47:58,299 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-04-18 07:47:58,300 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-04-18 07:47:58,301 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-04-18 07:47:58,301 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-04-18 07:47:58,302 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-04-18 07:47:58,302 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-04-18 07:47:58,303 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-04-18 07:47:58,304 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-04-18 07:47:58,304 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-04-18 07:47:58,305 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-04-18 07:47:58,305 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-04-18 07:47:58,306 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-04-18 07:47:58,306 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-04-18 07:47:58,307 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-04-18 07:47:58,308 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-McrStrategy.epf [2020-04-18 07:47:58,323 INFO L113 SettingsManager]: Loading preferences was successful [2020-04-18 07:47:58,323 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-04-18 07:47:58,325 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-04-18 07:47:58,325 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-04-18 07:47:58,325 INFO L138 SettingsManager]: * Use SBE=true [2020-04-18 07:47:58,325 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-04-18 07:47:58,325 INFO L138 SettingsManager]: * sizeof long=4 [2020-04-18 07:47:58,326 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-04-18 07:47:58,326 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-04-18 07:47:58,326 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-04-18 07:47:58,326 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-04-18 07:47:58,326 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-04-18 07:47:58,327 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-04-18 07:47:58,327 INFO L138 SettingsManager]: * sizeof long double=12 [2020-04-18 07:47:58,327 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-04-18 07:47:58,327 INFO L138 SettingsManager]: * Use constant arrays=true [2020-04-18 07:47:58,327 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-04-18 07:47:58,328 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-04-18 07:47:58,328 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-04-18 07:47:58,328 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-04-18 07:47:58,328 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-04-18 07:47:58,328 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-04-18 07:47:58,329 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-04-18 07:47:58,329 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-04-18 07:47:58,329 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-04-18 07:47:58,329 INFO L138 SettingsManager]: * Trace refinement strategy=MCR [2020-04-18 07:47:58,329 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-04-18 07:47:58,330 INFO L138 SettingsManager]: * Trace refinement strategy used in MCR=CAMEL [2020-04-18 07:47:58,330 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-04-18 07:47:58,330 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-04-18 07:47:58,623 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-04-18 07:47:58,643 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-04-18 07:47:58,646 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-04-18 07:47:58,648 INFO L271 PluginConnector]: Initializing CDTParser... [2020-04-18 07:47:58,648 INFO L275 PluginConnector]: CDTParser initialized [2020-04-18 07:47:58,650 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/45_monabsex1_vs.i [2020-04-18 07:47:58,728 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80160a4d1/3c467137f1344f37af08bcb4d12536ce/FLAG553a6ff16 [2020-04-18 07:47:59,328 INFO L306 CDTParser]: Found 1 translation units. [2020-04-18 07:47:59,328 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/45_monabsex1_vs.i [2020-04-18 07:47:59,343 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80160a4d1/3c467137f1344f37af08bcb4d12536ce/FLAG553a6ff16 [2020-04-18 07:47:59,583 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80160a4d1/3c467137f1344f37af08bcb4d12536ce [2020-04-18 07:47:59,591 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-04-18 07:47:59,608 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-04-18 07:47:59,609 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-04-18 07:47:59,610 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-04-18 07:47:59,616 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-04-18 07:47:59,617 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 07:47:59" (1/1) ... [2020-04-18 07:47:59,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1819b4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 07:47:59, skipping insertion in model container [2020-04-18 07:47:59,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 07:47:59" (1/1) ... [2020-04-18 07:47:59,628 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-04-18 07:47:59,666 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-04-18 07:48:00,131 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-04-18 07:48:00,142 INFO L203 MainTranslator]: Completed pre-run [2020-04-18 07:48:00,181 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-04-18 07:48:00,253 INFO L208 MainTranslator]: Completed translation [2020-04-18 07:48:00,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 07:48:00 WrapperNode [2020-04-18 07:48:00,254 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-04-18 07:48:00,255 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-04-18 07:48:00,255 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-04-18 07:48:00,255 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-04-18 07:48:00,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 07:48:00" (1/1) ... [2020-04-18 07:48:00,283 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 07:48:00" (1/1) ... [2020-04-18 07:48:00,305 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-04-18 07:48:00,306 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-04-18 07:48:00,306 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-04-18 07:48:00,306 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-04-18 07:48:00,316 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 07:48:00" (1/1) ... [2020-04-18 07:48:00,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 07:48:00" (1/1) ... [2020-04-18 07:48:00,319 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 07:48:00" (1/1) ... [2020-04-18 07:48:00,320 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 07:48:00" (1/1) ... [2020-04-18 07:48:00,325 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 07:48:00" (1/1) ... [2020-04-18 07:48:00,330 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 07:48:00" (1/1) ... [2020-04-18 07:48:00,331 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 07:48:00" (1/1) ... [2020-04-18 07:48:00,336 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-04-18 07:48:00,337 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-04-18 07:48:00,337 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-04-18 07:48:00,337 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-04-18 07:48:00,343 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 07:48:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-04-18 07:48:00,400 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2020-04-18 07:48:00,401 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2020-04-18 07:48:00,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-04-18 07:48:00,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-04-18 07:48:00,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-04-18 07:48:00,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-04-18 07:48:00,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-04-18 07:48:00,403 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-04-18 07:48:00,736 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-04-18 07:48:00,736 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-04-18 07:48:00,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 07:48:00 BoogieIcfgContainer [2020-04-18 07:48:00,740 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-04-18 07:48:00,742 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-04-18 07:48:00,742 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-04-18 07:48:00,756 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-04-18 07:48:00,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.04 07:47:59" (1/3) ... [2020-04-18 07:48:00,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43902974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 07:48:00, skipping insertion in model container [2020-04-18 07:48:00,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 07:48:00" (2/3) ... [2020-04-18 07:48:00,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43902974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 07:48:00, skipping insertion in model container [2020-04-18 07:48:00,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 07:48:00" (3/3) ... [2020-04-18 07:48:00,765 INFO L109 eAbstractionObserver]: Analyzing ICFG 45_monabsex1_vs.i [2020-04-18 07:48:00,778 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-04-18 07:48:00,778 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-04-18 07:48:00,786 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-04-18 07:48:00,787 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-04-18 07:48:00,813 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:00,814 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:00,814 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:00,814 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:00,815 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:00,815 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:00,815 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:00,815 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:00,816 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:00,816 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:00,816 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:00,817 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:00,817 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:00,817 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:00,821 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:00,822 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:00,822 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:00,822 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:00,822 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:00,823 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:00,840 INFO L251 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-04-18 07:48:00,857 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 07:48:00,858 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 07:48:00,858 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 07:48:00,858 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 07:48:00,858 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 07:48:00,858 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 07:48:00,859 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 07:48:00,859 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 07:48:00,872 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 33 transitions, 71 flow [2020-04-18 07:48:00,874 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 34 places, 33 transitions, 71 flow [2020-04-18 07:48:00,903 INFO L129 PetriNetUnfolder]: 3/41 cut-off events. [2020-04-18 07:48:00,904 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-04-18 07:48:00,909 INFO L80 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 41 events. 3/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 21. Up to 4 conditions per place. [2020-04-18 07:48:00,910 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 34 places, 33 transitions, 71 flow [2020-04-18 07:48:00,924 INFO L129 PetriNetUnfolder]: 3/41 cut-off events. [2020-04-18 07:48:00,924 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-04-18 07:48:00,925 INFO L80 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 41 events. 3/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 21. Up to 4 conditions per place. [2020-04-18 07:48:00,927 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 240 [2020-04-18 07:48:00,928 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-04-18 07:48:01,564 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2020-04-18 07:48:01,648 INFO L206 etLargeBlockEncoding]: Checked pairs total: 167 [2020-04-18 07:48:01,648 INFO L214 etLargeBlockEncoding]: Total number of compositions: 30 [2020-04-18 07:48:01,656 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 11 places, 8 transitions, 21 flow [2020-04-18 07:48:01,667 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 19 states. [2020-04-18 07:48:01,670 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-04-18 07:48:01,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-04-18 07:48:01,678 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:01,680 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-04-18 07:48:01,681 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 07:48:01,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:01,689 INFO L82 PathProgramCache]: Analyzing trace with hash 4687883, now seen corresponding path program 1 times [2020-04-18 07:48:01,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:01,697 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1658544682] [2020-04-18 07:48:01,718 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:01,731 INFO L259 McrAutomatonBuilder]: Finished intersection with 5 states and 4 transitions. [2020-04-18 07:48:01,733 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2020-04-18 07:48:01,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-04-18 07:48:01,734 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:01,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:01,737 INFO L82 PathProgramCache]: Analyzing trace with hash 4687883, now seen corresponding path program 2 times [2020-04-18 07:48:01,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:01,742 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273552090] [2020-04-18 07:48:01,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:01,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:01,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:48:01,900 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273552090] [2020-04-18 07:48:01,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:01,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-04-18 07:48:01,903 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:01,903 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:01,904 INFO L259 McrAutomatonBuilder]: Finished intersection with 5 states and 4 transitions. [2020-04-18 07:48:01,904 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:01,908 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:48:01,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-04-18 07:48:01,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-04-18 07:48:01,914 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 2 states. [2020-04-18 07:48:01,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:01,918 INFO L93 Difference]: Finished difference Result 5 states and 4 transitions. [2020-04-18 07:48:01,919 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 4 transitions. [2020-04-18 07:48:01,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:48:01,920 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1658544682] [2020-04-18 07:48:01,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:48:01,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [1] total 1 [2020-04-18 07:48:01,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1658544682] [2020-04-18 07:48:01,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-04-18 07:48:01,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:48:01,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-04-18 07:48:01,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-04-18 07:48:01,928 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2020-04-18 07:48:01,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:01,930 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2020-04-18 07:48:01,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-04-18 07:48:01,931 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 4 [2020-04-18 07:48:01,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:48:01,940 INFO L225 Difference]: With dead ends: 11 [2020-04-18 07:48:01,941 INFO L226 Difference]: Without dead ends: 11 [2020-04-18 07:48:01,942 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-04-18 07:48:01,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-04-18 07:48:01,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-04-18 07:48:01,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-04-18 07:48:01,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2020-04-18 07:48:01,978 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 4 [2020-04-18 07:48:01,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:48:01,979 INFO L479 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2020-04-18 07:48:01,979 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-04-18 07:48:01,979 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2020-04-18 07:48:01,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-04-18 07:48:01,979 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:01,980 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2020-04-18 07:48:01,980 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 07:48:01,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:01,981 INFO L82 PathProgramCache]: Analyzing trace with hash 210024220, now seen corresponding path program 1 times [2020-04-18 07:48:01,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:01,981 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [2023214532] [2020-04-18 07:48:01,982 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:01,982 INFO L259 McrAutomatonBuilder]: Finished intersection with 7 states and 6 transitions. [2020-04-18 07:48:01,983 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2020-04-18 07:48:01,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-04-18 07:48:01,983 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:01,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:01,984 INFO L82 PathProgramCache]: Analyzing trace with hash 210024220, now seen corresponding path program 2 times [2020-04-18 07:48:01,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:01,985 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092665339] [2020-04-18 07:48:01,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 07:48:02,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 07:48:02,053 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-04-18 07:48:02,054 INFO L174 FreeRefinementEngine]: Strategy MCR found a feasible trace [2020-04-18 07:48:02,054 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-04-18 07:48:02,056 WARN L363 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2020-04-18 07:48:02,056 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2020-04-18 07:48:02,065 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:02,065 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:02,065 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:02,066 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:02,066 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:02,067 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:02,067 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:02,067 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:02,068 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:02,068 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:02,068 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:02,075 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:02,075 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:02,075 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:02,076 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:02,076 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:02,076 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:02,076 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:02,077 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:02,077 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:02,077 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:02,077 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:02,077 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:02,078 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:02,078 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:02,079 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:02,079 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:02,081 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:02,082 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:02,082 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:02,082 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:02,082 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:02,082 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:02,083 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:02,085 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:02,085 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:02,085 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:02,086 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:02,086 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:02,086 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:02,090 INFO L251 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-04-18 07:48:02,091 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 07:48:02,091 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 07:48:02,091 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 07:48:02,092 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 07:48:02,092 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 07:48:02,092 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 07:48:02,092 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 07:48:02,092 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 07:48:02,096 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 46 transitions, 104 flow [2020-04-18 07:48:02,096 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 48 places, 46 transitions, 104 flow [2020-04-18 07:48:02,129 INFO L129 PetriNetUnfolder]: 5/63 cut-off events. [2020-04-18 07:48:02,129 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-04-18 07:48:02,131 INFO L80 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 63 events. 5/63 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 125 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 42. Up to 6 conditions per place. [2020-04-18 07:48:02,133 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 48 places, 46 transitions, 104 flow [2020-04-18 07:48:02,145 INFO L129 PetriNetUnfolder]: 5/63 cut-off events. [2020-04-18 07:48:02,146 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-04-18 07:48:02,146 INFO L80 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 63 events. 5/63 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 125 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 42. Up to 6 conditions per place. [2020-04-18 07:48:02,148 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 792 [2020-04-18 07:48:02,148 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-04-18 07:48:02,919 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1029 [2020-04-18 07:48:02,920 INFO L214 etLargeBlockEncoding]: Total number of compositions: 37 [2020-04-18 07:48:02,920 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 18 places, 13 transitions, 38 flow [2020-04-18 07:48:02,926 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 100 states. [2020-04-18 07:48:02,926 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states. [2020-04-18 07:48:02,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-04-18 07:48:02,927 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:02,927 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-04-18 07:48:02,927 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:48:02,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:02,928 INFO L82 PathProgramCache]: Analyzing trace with hash 240626158, now seen corresponding path program 1 times [2020-04-18 07:48:02,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:02,928 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [100454680] [2020-04-18 07:48:02,929 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:02,929 INFO L259 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-04-18 07:48:02,930 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2020-04-18 07:48:02,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-04-18 07:48:02,930 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:02,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:02,931 INFO L82 PathProgramCache]: Analyzing trace with hash 240626158, now seen corresponding path program 2 times [2020-04-18 07:48:02,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:02,931 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629353594] [2020-04-18 07:48:02,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:02,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:48:02,974 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629353594] [2020-04-18 07:48:02,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:02,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:48:02,975 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:02,975 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:02,976 INFO L259 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-04-18 07:48:02,976 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:02,981 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:48:02,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:02,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:02,982 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2020-04-18 07:48:02,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:02,986 INFO L93 Difference]: Finished difference Result 6 states and 5 transitions. [2020-04-18 07:48:02,986 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 5 transitions. [2020-04-18 07:48:02,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:48:02,987 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [100454680] [2020-04-18 07:48:02,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:48:02,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 07:48:02,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [100454680] [2020-04-18 07:48:02,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 07:48:02,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:48:02,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:02,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:02,989 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 3 states. [2020-04-18 07:48:03,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:03,019 INFO L93 Difference]: Finished difference Result 96 states and 197 transitions. [2020-04-18 07:48:03,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:48:03,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-04-18 07:48:03,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:48:03,024 INFO L225 Difference]: With dead ends: 96 [2020-04-18 07:48:03,024 INFO L226 Difference]: Without dead ends: 96 [2020-04-18 07:48:03,025 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:03,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-04-18 07:48:03,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 84. [2020-04-18 07:48:03,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-04-18 07:48:03,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 180 transitions. [2020-04-18 07:48:03,047 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 180 transitions. Word has length 5 [2020-04-18 07:48:03,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:48:03,047 INFO L479 AbstractCegarLoop]: Abstraction has 84 states and 180 transitions. [2020-04-18 07:48:03,048 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 07:48:03,048 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 180 transitions. [2020-04-18 07:48:03,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-04-18 07:48:03,049 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:03,049 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2020-04-18 07:48:03,050 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:48:03,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:03,050 INFO L82 PathProgramCache]: Analyzing trace with hash 109807895, now seen corresponding path program 1 times [2020-04-18 07:48:03,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:03,051 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [807069380] [2020-04-18 07:48:03,051 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:03,053 INFO L259 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-04-18 07:48:03,053 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-04-18 07:48:03,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-04-18 07:48:03,054 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:03,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:03,054 INFO L82 PathProgramCache]: Analyzing trace with hash 109807895, now seen corresponding path program 2 times [2020-04-18 07:48:03,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:03,055 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795501215] [2020-04-18 07:48:03,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:03,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 07:48:03,127 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795501215] [2020-04-18 07:48:03,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:03,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:48:03,127 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:03,128 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:03,129 INFO L259 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-04-18 07:48:03,129 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:03,132 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:48:03,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:03,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:03,133 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2020-04-18 07:48:03,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:03,145 INFO L93 Difference]: Finished difference Result 9 states and 8 transitions. [2020-04-18 07:48:03,145 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 8 transitions. [2020-04-18 07:48:03,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:48:03,145 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [807069380] [2020-04-18 07:48:03,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:48:03,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 07:48:03,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [807069380] [2020-04-18 07:48:03,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 07:48:03,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:48:03,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:03,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:03,147 INFO L87 Difference]: Start difference. First operand 84 states and 180 transitions. Second operand 3 states. [2020-04-18 07:48:03,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:03,173 INFO L93 Difference]: Finished difference Result 84 states and 164 transitions. [2020-04-18 07:48:03,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:48:03,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-04-18 07:48:03,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:48:03,176 INFO L225 Difference]: With dead ends: 84 [2020-04-18 07:48:03,176 INFO L226 Difference]: Without dead ends: 84 [2020-04-18 07:48:03,178 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:03,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-04-18 07:48:03,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 76. [2020-04-18 07:48:03,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-04-18 07:48:03,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 154 transitions. [2020-04-18 07:48:03,193 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 154 transitions. Word has length 8 [2020-04-18 07:48:03,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:48:03,194 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 154 transitions. [2020-04-18 07:48:03,194 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 07:48:03,194 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 154 transitions. [2020-04-18 07:48:03,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 07:48:03,194 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:03,195 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:48:03,195 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:48:03,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:03,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1655579211, now seen corresponding path program 1 times [2020-04-18 07:48:03,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:03,196 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1109445102] [2020-04-18 07:48:03,196 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:03,197 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 25 transitions. [2020-04-18 07:48:03,198 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-04-18 07:48:03,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 07:48:03,198 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:03,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:03,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1655579211, now seen corresponding path program 2 times [2020-04-18 07:48:03,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:03,199 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600452115] [2020-04-18 07:48:03,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:03,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:48:03,245 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600452115] [2020-04-18 07:48:03,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:03,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:48:03,246 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:03,247 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:03,248 INFO L259 McrAutomatonBuilder]: Finished intersection with 14 states and 16 transitions. [2020-04-18 07:48:03,249 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:03,257 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:48:03,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 07:48:03,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 07:48:03,257 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 4 states. [2020-04-18 07:48:03,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:03,274 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2020-04-18 07:48:03,274 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2020-04-18 07:48:03,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:48:03,275 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1109445102] [2020-04-18 07:48:03,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:48:03,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 07:48:03,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1109445102] [2020-04-18 07:48:03,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-04-18 07:48:03,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:48:03,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 07:48:03,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 07:48:03,277 INFO L87 Difference]: Start difference. First operand 76 states and 154 transitions. Second operand 4 states. [2020-04-18 07:48:03,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:03,296 INFO L93 Difference]: Finished difference Result 68 states and 136 transitions. [2020-04-18 07:48:03,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:48:03,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-04-18 07:48:03,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:48:03,298 INFO L225 Difference]: With dead ends: 68 [2020-04-18 07:48:03,298 INFO L226 Difference]: Without dead ends: 68 [2020-04-18 07:48:03,299 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 07:48:03,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-04-18 07:48:03,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2020-04-18 07:48:03,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-04-18 07:48:03,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 129 transitions. [2020-04-18 07:48:03,306 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 129 transitions. Word has length 9 [2020-04-18 07:48:03,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:48:03,306 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 129 transitions. [2020-04-18 07:48:03,307 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-04-18 07:48:03,307 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 129 transitions. [2020-04-18 07:48:03,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 07:48:03,308 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:03,308 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2020-04-18 07:48:03,308 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:48:03,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:03,308 INFO L82 PathProgramCache]: Analyzing trace with hash -891005170, now seen corresponding path program 1 times [2020-04-18 07:48:03,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:03,309 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1249272244] [2020-04-18 07:48:03,309 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:03,310 INFO L259 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-04-18 07:48:03,310 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2020-04-18 07:48:03,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 07:48:03,310 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:03,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:03,311 INFO L82 PathProgramCache]: Analyzing trace with hash -891005170, now seen corresponding path program 2 times [2020-04-18 07:48:03,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:03,311 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408251385] [2020-04-18 07:48:03,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 07:48:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 07:48:03,363 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-04-18 07:48:03,364 INFO L174 FreeRefinementEngine]: Strategy MCR found a feasible trace [2020-04-18 07:48:03,364 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-04-18 07:48:03,364 WARN L363 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2020-04-18 07:48:03,366 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2020-04-18 07:48:03,372 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,372 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,372 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,373 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,373 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,373 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,373 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,373 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,374 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,374 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,374 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,374 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,374 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,374 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,375 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,375 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,375 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,375 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,375 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,376 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,376 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,376 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,376 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,376 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,377 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,377 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,377 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,377 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,378 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,378 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,378 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,378 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,378 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,378 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,378 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,379 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,379 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,379 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,379 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,379 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,380 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,380 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,380 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,380 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,380 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,381 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,381 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,381 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,383 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,383 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,383 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,383 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,383 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,383 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,392 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,393 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,393 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,393 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,393 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,393 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:03,395 INFO L251 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-04-18 07:48:03,395 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 07:48:03,395 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 07:48:03,395 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 07:48:03,396 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 07:48:03,396 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 07:48:03,396 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 07:48:03,396 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 07:48:03,396 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 07:48:03,398 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 59 transitions, 139 flow [2020-04-18 07:48:03,398 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 62 places, 59 transitions, 139 flow [2020-04-18 07:48:03,413 INFO L129 PetriNetUnfolder]: 7/85 cut-off events. [2020-04-18 07:48:03,413 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-04-18 07:48:03,415 INFO L80 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 85 events. 7/85 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 205 event pairs, 0 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 67. Up to 8 conditions per place. [2020-04-18 07:48:03,419 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 62 places, 59 transitions, 139 flow [2020-04-18 07:48:03,432 INFO L129 PetriNetUnfolder]: 7/85 cut-off events. [2020-04-18 07:48:03,432 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-04-18 07:48:03,433 INFO L80 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 85 events. 7/85 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 205 event pairs, 0 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 67. Up to 8 conditions per place. [2020-04-18 07:48:03,436 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1656 [2020-04-18 07:48:03,436 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-04-18 07:48:04,177 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2190 [2020-04-18 07:48:04,177 INFO L214 etLargeBlockEncoding]: Total number of compositions: 48 [2020-04-18 07:48:04,178 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 24 places, 17 transitions, 55 flow [2020-04-18 07:48:04,194 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 404 states. [2020-04-18 07:48:04,194 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states. [2020-04-18 07:48:04,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-04-18 07:48:04,194 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:04,195 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-04-18 07:48:04,195 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:48:04,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:04,195 INFO L82 PathProgramCache]: Analyzing trace with hash 359632331, now seen corresponding path program 1 times [2020-04-18 07:48:04,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:04,196 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [598621335] [2020-04-18 07:48:04,196 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:04,197 INFO L259 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-04-18 07:48:04,197 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2020-04-18 07:48:04,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-04-18 07:48:04,197 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:04,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:04,198 INFO L82 PathProgramCache]: Analyzing trace with hash 359632331, now seen corresponding path program 2 times [2020-04-18 07:48:04,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:04,198 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837660822] [2020-04-18 07:48:04,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:04,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:48:04,222 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837660822] [2020-04-18 07:48:04,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:04,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:48:04,222 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:04,223 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:04,223 INFO L259 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-04-18 07:48:04,223 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:04,226 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:48:04,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:04,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:04,227 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2020-04-18 07:48:04,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:04,229 INFO L93 Difference]: Finished difference Result 6 states and 5 transitions. [2020-04-18 07:48:04,230 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 5 transitions. [2020-04-18 07:48:04,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:48:04,230 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [598621335] [2020-04-18 07:48:04,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:48:04,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 07:48:04,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [598621335] [2020-04-18 07:48:04,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 07:48:04,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:48:04,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:04,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:04,232 INFO L87 Difference]: Start difference. First operand 404 states. Second operand 3 states. [2020-04-18 07:48:04,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:04,275 INFO L93 Difference]: Finished difference Result 447 states and 1247 transitions. [2020-04-18 07:48:04,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:48:04,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-04-18 07:48:04,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:48:04,285 INFO L225 Difference]: With dead ends: 447 [2020-04-18 07:48:04,285 INFO L226 Difference]: Without dead ends: 447 [2020-04-18 07:48:04,286 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:04,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2020-04-18 07:48:04,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 378. [2020-04-18 07:48:04,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-04-18 07:48:04,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1099 transitions. [2020-04-18 07:48:04,355 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1099 transitions. Word has length 5 [2020-04-18 07:48:04,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:48:04,355 INFO L479 AbstractCegarLoop]: Abstraction has 378 states and 1099 transitions. [2020-04-18 07:48:04,356 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 07:48:04,356 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1099 transitions. [2020-04-18 07:48:04,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-04-18 07:48:04,356 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:04,356 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2020-04-18 07:48:04,357 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:48:04,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:04,357 INFO L82 PathProgramCache]: Analyzing trace with hash 2061810264, now seen corresponding path program 1 times [2020-04-18 07:48:04,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:04,358 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [930701129] [2020-04-18 07:48:04,358 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:04,359 INFO L259 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-04-18 07:48:04,359 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-04-18 07:48:04,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-04-18 07:48:04,360 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:04,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:04,361 INFO L82 PathProgramCache]: Analyzing trace with hash 2061810264, now seen corresponding path program 2 times [2020-04-18 07:48:04,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:04,361 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373181311] [2020-04-18 07:48:04,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:04,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 07:48:04,408 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373181311] [2020-04-18 07:48:04,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:04,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:48:04,409 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:04,410 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:04,410 INFO L259 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-04-18 07:48:04,411 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:04,414 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:48:04,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:04,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:04,415 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2020-04-18 07:48:04,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:04,419 INFO L93 Difference]: Finished difference Result 9 states and 8 transitions. [2020-04-18 07:48:04,419 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 8 transitions. [2020-04-18 07:48:04,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:48:04,420 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [930701129] [2020-04-18 07:48:04,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:48:04,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 07:48:04,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [930701129] [2020-04-18 07:48:04,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 07:48:04,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:48:04,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:04,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:04,421 INFO L87 Difference]: Start difference. First operand 378 states and 1099 transitions. Second operand 3 states. [2020-04-18 07:48:04,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:04,459 INFO L93 Difference]: Finished difference Result 486 states and 1356 transitions. [2020-04-18 07:48:04,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:48:04,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-04-18 07:48:04,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:48:04,467 INFO L225 Difference]: With dead ends: 486 [2020-04-18 07:48:04,467 INFO L226 Difference]: Without dead ends: 486 [2020-04-18 07:48:04,467 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:04,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2020-04-18 07:48:04,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 412. [2020-04-18 07:48:04,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2020-04-18 07:48:04,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1196 transitions. [2020-04-18 07:48:04,507 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 1196 transitions. Word has length 8 [2020-04-18 07:48:04,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:48:04,508 INFO L479 AbstractCegarLoop]: Abstraction has 412 states and 1196 transitions. [2020-04-18 07:48:04,508 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 07:48:04,508 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 1196 transitions. [2020-04-18 07:48:04,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 07:48:04,509 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:04,509 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:48:04,509 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:48:04,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:04,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1871610837, now seen corresponding path program 1 times [2020-04-18 07:48:04,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:04,510 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1502319757] [2020-04-18 07:48:04,510 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:04,511 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 25 transitions. [2020-04-18 07:48:04,511 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-04-18 07:48:04,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 07:48:04,512 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:04,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:04,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1803820437, now seen corresponding path program 2 times [2020-04-18 07:48:04,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:04,513 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853676678] [2020-04-18 07:48:04,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:04,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:48:04,533 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853676678] [2020-04-18 07:48:04,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:04,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:48:04,534 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:04,535 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:04,536 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 24 transitions. [2020-04-18 07:48:04,536 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:04,540 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:48:04,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:04,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:04,541 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2020-04-18 07:48:04,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:04,546 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2020-04-18 07:48:04,546 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2020-04-18 07:48:04,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 07:48:04,547 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:48:04,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:04,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1871610837, now seen corresponding path program 3 times [2020-04-18 07:48:04,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:04,548 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828148317] [2020-04-18 07:48:04,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:04,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:48:04,574 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828148317] [2020-04-18 07:48:04,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:04,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:48:04,575 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:04,575 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:04,577 INFO L259 McrAutomatonBuilder]: Finished intersection with 14 states and 16 transitions. [2020-04-18 07:48:04,577 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:04,582 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:48:04,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 07:48:04,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 07:48:04,582 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand 4 states. [2020-04-18 07:48:04,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:04,594 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2020-04-18 07:48:04,594 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2020-04-18 07:48:04,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:48:04,595 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1502319757] [2020-04-18 07:48:04,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:48:04,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 07:48:04,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1502319757] [2020-04-18 07:48:04,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-04-18 07:48:04,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:48:04,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 07:48:04,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 07:48:04,596 INFO L87 Difference]: Start difference. First operand 412 states and 1196 transitions. Second operand 4 states. [2020-04-18 07:48:04,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:04,620 INFO L93 Difference]: Finished difference Result 338 states and 962 transitions. [2020-04-18 07:48:04,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:48:04,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-04-18 07:48:04,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:48:04,624 INFO L225 Difference]: With dead ends: 338 [2020-04-18 07:48:04,624 INFO L226 Difference]: Without dead ends: 338 [2020-04-18 07:48:04,625 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 07:48:04,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2020-04-18 07:48:04,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 283. [2020-04-18 07:48:04,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2020-04-18 07:48:04,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 793 transitions. [2020-04-18 07:48:04,637 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 793 transitions. Word has length 9 [2020-04-18 07:48:04,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:48:04,637 INFO L479 AbstractCegarLoop]: Abstraction has 283 states and 793 transitions. [2020-04-18 07:48:04,637 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-04-18 07:48:04,638 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 793 transitions. [2020-04-18 07:48:04,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 07:48:04,638 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:04,638 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:48:04,639 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:48:04,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:04,639 INFO L82 PathProgramCache]: Analyzing trace with hash -508390409, now seen corresponding path program 1 times [2020-04-18 07:48:04,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:04,639 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [670873021] [2020-04-18 07:48:04,640 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:04,640 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 19 transitions. [2020-04-18 07:48:04,641 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2020-04-18 07:48:04,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 07:48:04,641 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:04,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:04,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1871610825, now seen corresponding path program 2 times [2020-04-18 07:48:04,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:04,642 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542189067] [2020-04-18 07:48:04,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:04,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:04,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 07:48:04,662 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542189067] [2020-04-18 07:48:04,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:04,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:48:04,663 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:04,664 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:04,665 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 18 transitions. [2020-04-18 07:48:04,665 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:04,688 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 07:48:04,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 07:48:04,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 07:48:04,689 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 5 states. [2020-04-18 07:48:04,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:04,703 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2020-04-18 07:48:04,703 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2020-04-18 07:48:04,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 07:48:04,703 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:48:04,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:04,704 INFO L82 PathProgramCache]: Analyzing trace with hash -508390409, now seen corresponding path program 3 times [2020-04-18 07:48:04,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:04,705 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865694857] [2020-04-18 07:48:04,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:04,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 07:48:04,734 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865694857] [2020-04-18 07:48:04,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:04,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:48:04,734 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:04,735 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:04,736 INFO L259 McrAutomatonBuilder]: Finished intersection with 14 states and 16 transitions. [2020-04-18 07:48:04,736 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:04,746 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:48:04,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 07:48:04,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-04-18 07:48:04,747 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 4 states. [2020-04-18 07:48:04,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:04,758 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2020-04-18 07:48:04,758 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2020-04-18 07:48:04,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:48:04,759 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [670873021] [2020-04-18 07:48:04,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:48:04,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 07:48:04,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [670873021] [2020-04-18 07:48:04,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-18 07:48:04,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:48:04,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 07:48:04,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 07:48:04,761 INFO L87 Difference]: Start difference. First operand 283 states and 793 transitions. Second operand 6 states. [2020-04-18 07:48:04,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:04,813 INFO L93 Difference]: Finished difference Result 233 states and 641 transitions. [2020-04-18 07:48:04,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:48:04,814 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-04-18 07:48:04,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:48:04,816 INFO L225 Difference]: With dead ends: 233 [2020-04-18 07:48:04,816 INFO L226 Difference]: Without dead ends: 233 [2020-04-18 07:48:04,816 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 07:48:04,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2020-04-18 07:48:04,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 183. [2020-04-18 07:48:04,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-04-18 07:48:04,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 489 transitions. [2020-04-18 07:48:04,825 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 489 transitions. Word has length 9 [2020-04-18 07:48:04,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:48:04,826 INFO L479 AbstractCegarLoop]: Abstraction has 183 states and 489 transitions. [2020-04-18 07:48:04,826 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-18 07:48:04,826 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 489 transitions. [2020-04-18 07:48:04,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-04-18 07:48:04,827 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:04,827 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2020-04-18 07:48:04,827 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:48:04,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:04,828 INFO L82 PathProgramCache]: Analyzing trace with hash 960774069, now seen corresponding path program 1 times [2020-04-18 07:48:04,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:04,828 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [53921235] [2020-04-18 07:48:04,829 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:04,829 INFO L259 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-04-18 07:48:04,829 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2020-04-18 07:48:04,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-04-18 07:48:04,830 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:04,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:04,830 INFO L82 PathProgramCache]: Analyzing trace with hash 960774069, now seen corresponding path program 2 times [2020-04-18 07:48:04,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:04,831 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969814140] [2020-04-18 07:48:04,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:04,850 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-04-18 07:48:04,851 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969814140] [2020-04-18 07:48:04,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:04,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:48:04,852 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:04,852 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:04,853 INFO L259 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-04-18 07:48:04,854 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:04,857 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:48:04,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:04,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:04,858 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 3 states. [2020-04-18 07:48:04,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:04,890 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2020-04-18 07:48:04,891 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2020-04-18 07:48:04,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:48:04,891 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [53921235] [2020-04-18 07:48:04,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:48:04,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 07:48:04,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [53921235] [2020-04-18 07:48:04,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 07:48:04,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:48:04,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:04,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:04,893 INFO L87 Difference]: Start difference. First operand 183 states and 489 transitions. Second operand 3 states. [2020-04-18 07:48:04,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:04,927 INFO L93 Difference]: Finished difference Result 243 states and 634 transitions. [2020-04-18 07:48:04,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:48:04,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-04-18 07:48:04,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:48:04,930 INFO L225 Difference]: With dead ends: 243 [2020-04-18 07:48:04,930 INFO L226 Difference]: Without dead ends: 243 [2020-04-18 07:48:04,930 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:04,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2020-04-18 07:48:04,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 211. [2020-04-18 07:48:04,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-04-18 07:48:04,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 570 transitions. [2020-04-18 07:48:04,941 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 570 transitions. Word has length 11 [2020-04-18 07:48:04,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:48:04,943 INFO L479 AbstractCegarLoop]: Abstraction has 211 states and 570 transitions. [2020-04-18 07:48:04,943 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 07:48:04,943 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 570 transitions. [2020-04-18 07:48:04,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-04-18 07:48:04,944 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:04,944 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:48:04,944 INFO L427 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:48:04,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:04,945 INFO L82 PathProgramCache]: Analyzing trace with hash -280773966, now seen corresponding path program 1 times [2020-04-18 07:48:04,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:04,945 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [702534434] [2020-04-18 07:48:04,947 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:04,948 INFO L259 McrAutomatonBuilder]: Finished intersection with 21 states and 28 transitions. [2020-04-18 07:48:04,950 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-04-18 07:48:04,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-04-18 07:48:04,951 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:04,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:04,951 INFO L82 PathProgramCache]: Analyzing trace with hash 5848438, now seen corresponding path program 2 times [2020-04-18 07:48:04,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:04,958 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166476863] [2020-04-18 07:48:04,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:04,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:04,997 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-04-18 07:48:04,997 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166476863] [2020-04-18 07:48:04,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:04,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:48:04,998 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:04,999 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:05,001 INFO L259 McrAutomatonBuilder]: Finished intersection with 21 states and 27 transitions. [2020-04-18 07:48:05,002 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:05,030 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 07:48:05,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 07:48:05,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 07:48:05,031 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2020-04-18 07:48:05,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:05,047 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2020-04-18 07:48:05,047 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2020-04-18 07:48:05,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-04-18 07:48:05,048 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:48:05,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:05,048 INFO L82 PathProgramCache]: Analyzing trace with hash -280773966, now seen corresponding path program 3 times [2020-04-18 07:48:05,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:05,050 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101777948] [2020-04-18 07:48:05,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:05,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:05,106 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-04-18 07:48:05,106 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101777948] [2020-04-18 07:48:05,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:05,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:48:05,107 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:05,108 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:05,109 INFO L259 McrAutomatonBuilder]: Finished intersection with 20 states and 25 transitions. [2020-04-18 07:48:05,110 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:05,119 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:48:05,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 07:48:05,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-04-18 07:48:05,120 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand 4 states. [2020-04-18 07:48:05,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:05,132 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2020-04-18 07:48:05,132 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2020-04-18 07:48:05,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:48:05,133 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [702534434] [2020-04-18 07:48:05,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:48:05,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 07:48:05,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [702534434] [2020-04-18 07:48:05,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-18 07:48:05,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:48:05,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 07:48:05,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 07:48:05,135 INFO L87 Difference]: Start difference. First operand 211 states and 570 transitions. Second operand 6 states. [2020-04-18 07:48:05,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:05,168 INFO L93 Difference]: Finished difference Result 179 states and 474 transitions. [2020-04-18 07:48:05,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:48:05,168 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-04-18 07:48:05,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:48:05,170 INFO L225 Difference]: With dead ends: 179 [2020-04-18 07:48:05,170 INFO L226 Difference]: Without dead ends: 179 [2020-04-18 07:48:05,171 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 07:48:05,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2020-04-18 07:48:05,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 147. [2020-04-18 07:48:05,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-04-18 07:48:05,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 378 transitions. [2020-04-18 07:48:05,178 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 378 transitions. Word has length 12 [2020-04-18 07:48:05,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:48:05,178 INFO L479 AbstractCegarLoop]: Abstraction has 147 states and 378 transitions. [2020-04-18 07:48:05,178 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-18 07:48:05,178 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 378 transitions. [2020-04-18 07:48:05,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-04-18 07:48:05,179 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:05,179 INFO L425 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2020-04-18 07:48:05,179 INFO L427 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:48:05,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:05,180 INFO L82 PathProgramCache]: Analyzing trace with hash -280874677, now seen corresponding path program 1 times [2020-04-18 07:48:05,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:05,181 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1671997150] [2020-04-18 07:48:05,181 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:05,182 INFO L259 McrAutomatonBuilder]: Finished intersection with 13 states and 12 transitions. [2020-04-18 07:48:05,182 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2020-04-18 07:48:05,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-04-18 07:48:05,183 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:05,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:05,183 INFO L82 PathProgramCache]: Analyzing trace with hash -280874677, now seen corresponding path program 2 times [2020-04-18 07:48:05,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:05,183 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608924254] [2020-04-18 07:48:05,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 07:48:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 07:48:05,222 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-04-18 07:48:05,228 INFO L174 FreeRefinementEngine]: Strategy MCR found a feasible trace [2020-04-18 07:48:05,229 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-04-18 07:48:05,229 WARN L363 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2020-04-18 07:48:05,230 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2020-04-18 07:48:05,239 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,239 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,239 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,239 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,240 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,240 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,240 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,240 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,240 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,240 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,241 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,241 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,241 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,241 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,241 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,241 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,242 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,242 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,242 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,242 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,242 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,242 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,243 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,243 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,243 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,243 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,243 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,243 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,244 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,244 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,244 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,244 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,244 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,244 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,244 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,245 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,245 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,245 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,245 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,245 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,245 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,246 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,246 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,246 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,246 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,246 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,246 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,246 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,247 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,247 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,247 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,247 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,247 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,247 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,248 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,248 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,248 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,249 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,249 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,249 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,249 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,249 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,255 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,255 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,255 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,255 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,255 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,256 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,259 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,259 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,260 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,260 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,260 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,260 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,262 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,263 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,263 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,263 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,263 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,263 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:05,265 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-04-18 07:48:05,266 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 07:48:05,266 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 07:48:05,266 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 07:48:05,266 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 07:48:05,266 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 07:48:05,266 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 07:48:05,266 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 07:48:05,266 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 07:48:05,268 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 72 transitions, 176 flow [2020-04-18 07:48:05,268 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 76 places, 72 transitions, 176 flow [2020-04-18 07:48:05,285 INFO L129 PetriNetUnfolder]: 9/107 cut-off events. [2020-04-18 07:48:05,285 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-04-18 07:48:05,286 INFO L80 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 107 events. 9/107 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 289 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 93. Up to 10 conditions per place. [2020-04-18 07:48:05,291 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 76 places, 72 transitions, 176 flow [2020-04-18 07:48:05,311 INFO L129 PetriNetUnfolder]: 9/107 cut-off events. [2020-04-18 07:48:05,311 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-04-18 07:48:05,313 INFO L80 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 107 events. 9/107 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 289 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 93. Up to 10 conditions per place. [2020-04-18 07:48:05,316 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2832 [2020-04-18 07:48:05,316 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-04-18 07:48:06,235 INFO L206 etLargeBlockEncoding]: Checked pairs total: 4290 [2020-04-18 07:48:06,235 INFO L214 etLargeBlockEncoding]: Total number of compositions: 63 [2020-04-18 07:48:06,237 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 30 places, 23 transitions, 78 flow [2020-04-18 07:48:06,320 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1620 states. [2020-04-18 07:48:06,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states. [2020-04-18 07:48:06,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-04-18 07:48:06,321 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:06,321 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-04-18 07:48:06,321 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 07:48:06,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:06,321 INFO L82 PathProgramCache]: Analyzing trace with hash 500888133, now seen corresponding path program 1 times [2020-04-18 07:48:06,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:06,322 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1034763025] [2020-04-18 07:48:06,322 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:06,322 INFO L259 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-04-18 07:48:06,322 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2020-04-18 07:48:06,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-04-18 07:48:06,323 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:06,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:06,323 INFO L82 PathProgramCache]: Analyzing trace with hash 500888133, now seen corresponding path program 2 times [2020-04-18 07:48:06,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:06,326 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929299500] [2020-04-18 07:48:06,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:06,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:48:06,346 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929299500] [2020-04-18 07:48:06,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:06,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:48:06,347 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:06,347 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:06,348 INFO L259 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-04-18 07:48:06,348 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:06,351 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:48:06,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:06,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:06,351 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2020-04-18 07:48:06,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:06,355 INFO L93 Difference]: Finished difference Result 6 states and 5 transitions. [2020-04-18 07:48:06,356 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 5 transitions. [2020-04-18 07:48:06,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:48:06,356 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1034763025] [2020-04-18 07:48:06,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:48:06,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 07:48:06,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1034763025] [2020-04-18 07:48:06,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 07:48:06,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:48:06,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:06,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:06,358 INFO L87 Difference]: Start difference. First operand 1620 states. Second operand 3 states. [2020-04-18 07:48:06,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:06,410 INFO L93 Difference]: Finished difference Result 1878 states and 6626 transitions. [2020-04-18 07:48:06,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:48:06,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-04-18 07:48:06,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:48:06,428 INFO L225 Difference]: With dead ends: 1878 [2020-04-18 07:48:06,428 INFO L226 Difference]: Without dead ends: 1878 [2020-04-18 07:48:06,428 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:06,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2020-04-18 07:48:06,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1572. [2020-04-18 07:48:06,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2020-04-18 07:48:06,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 5747 transitions. [2020-04-18 07:48:06,529 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 5747 transitions. Word has length 5 [2020-04-18 07:48:06,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:48:06,529 INFO L479 AbstractCegarLoop]: Abstraction has 1572 states and 5747 transitions. [2020-04-18 07:48:06,530 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 07:48:06,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 5747 transitions. [2020-04-18 07:48:06,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-04-18 07:48:06,533 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:06,533 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2020-04-18 07:48:06,534 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 07:48:06,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:06,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1111452433, now seen corresponding path program 1 times [2020-04-18 07:48:06,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:06,534 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1604098894] [2020-04-18 07:48:06,535 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:06,535 INFO L259 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-04-18 07:48:06,536 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-04-18 07:48:06,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-04-18 07:48:06,536 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:06,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:06,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1111452433, now seen corresponding path program 2 times [2020-04-18 07:48:06,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:06,542 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388797170] [2020-04-18 07:48:06,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:06,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 07:48:06,567 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388797170] [2020-04-18 07:48:06,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:06,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:48:06,567 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:06,568 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:06,569 INFO L259 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-04-18 07:48:06,569 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:06,573 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:48:06,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:06,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:06,574 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2020-04-18 07:48:06,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:06,577 INFO L93 Difference]: Finished difference Result 9 states and 8 transitions. [2020-04-18 07:48:06,577 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 8 transitions. [2020-04-18 07:48:06,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:48:06,577 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1604098894] [2020-04-18 07:48:06,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:48:06,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 07:48:06,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1604098894] [2020-04-18 07:48:06,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 07:48:06,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:48:06,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:06,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:06,579 INFO L87 Difference]: Start difference. First operand 1572 states and 5747 transitions. Second operand 3 states. [2020-04-18 07:48:06,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:06,637 INFO L93 Difference]: Finished difference Result 2193 states and 7798 transitions. [2020-04-18 07:48:06,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:48:06,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-04-18 07:48:06,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:48:06,658 INFO L225 Difference]: With dead ends: 2193 [2020-04-18 07:48:06,658 INFO L226 Difference]: Without dead ends: 2193 [2020-04-18 07:48:06,659 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:06,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2193 states. [2020-04-18 07:48:06,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2193 to 1828. [2020-04-18 07:48:06,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1828 states. [2020-04-18 07:48:06,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1828 states and 6732 transitions. [2020-04-18 07:48:06,760 INFO L78 Accepts]: Start accepts. Automaton has 1828 states and 6732 transitions. Word has length 8 [2020-04-18 07:48:06,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:48:06,760 INFO L479 AbstractCegarLoop]: Abstraction has 1828 states and 6732 transitions. [2020-04-18 07:48:06,760 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 07:48:06,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1828 states and 6732 transitions. [2020-04-18 07:48:06,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 07:48:06,761 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:06,761 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:48:06,761 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 07:48:06,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:06,762 INFO L82 PathProgramCache]: Analyzing trace with hash -231363678, now seen corresponding path program 1 times [2020-04-18 07:48:06,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:06,762 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [282103720] [2020-04-18 07:48:06,762 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:06,763 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 25 transitions. [2020-04-18 07:48:06,764 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-04-18 07:48:06,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 07:48:06,764 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:06,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:06,764 INFO L82 PathProgramCache]: Analyzing trace with hash -231514368, now seen corresponding path program 2 times [2020-04-18 07:48:06,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:06,765 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950274850] [2020-04-18 07:48:06,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:06,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:48:06,787 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950274850] [2020-04-18 07:48:06,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:06,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:48:06,787 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:06,788 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:06,790 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 24 transitions. [2020-04-18 07:48:06,790 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:06,794 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 07:48:06,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:06,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:06,795 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2020-04-18 07:48:06,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:06,802 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2020-04-18 07:48:06,803 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2020-04-18 07:48:06,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 07:48:06,803 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:48:06,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:06,803 INFO L82 PathProgramCache]: Analyzing trace with hash -231363678, now seen corresponding path program 3 times [2020-04-18 07:48:06,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:06,804 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960214614] [2020-04-18 07:48:06,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:06,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:06,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:48:06,834 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960214614] [2020-04-18 07:48:06,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:06,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:48:06,835 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:06,835 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:06,838 INFO L259 McrAutomatonBuilder]: Finished intersection with 14 states and 16 transitions. [2020-04-18 07:48:06,838 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:06,843 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:48:06,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 07:48:06,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 07:48:06,844 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand 4 states. [2020-04-18 07:48:06,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:06,853 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2020-04-18 07:48:06,853 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2020-04-18 07:48:06,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:48:06,854 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [282103720] [2020-04-18 07:48:06,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:48:06,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 07:48:06,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [282103720] [2020-04-18 07:48:06,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-04-18 07:48:06,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:48:06,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 07:48:06,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 07:48:06,855 INFO L87 Difference]: Start difference. First operand 1828 states and 6732 transitions. Second operand 4 states. [2020-04-18 07:48:06,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:06,929 INFO L93 Difference]: Finished difference Result 1463 states and 5301 transitions. [2020-04-18 07:48:06,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:48:06,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-04-18 07:48:06,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:48:06,943 INFO L225 Difference]: With dead ends: 1463 [2020-04-18 07:48:06,943 INFO L226 Difference]: Without dead ends: 1463 [2020-04-18 07:48:06,944 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 07:48:06,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2020-04-18 07:48:06,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1177. [2020-04-18 07:48:06,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1177 states. [2020-04-18 07:48:07,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 4196 transitions. [2020-04-18 07:48:07,005 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 4196 transitions. Word has length 9 [2020-04-18 07:48:07,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:48:07,005 INFO L479 AbstractCegarLoop]: Abstraction has 1177 states and 4196 transitions. [2020-04-18 07:48:07,005 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-04-18 07:48:07,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 4196 transitions. [2020-04-18 07:48:07,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 07:48:07,006 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:07,006 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:48:07,006 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 07:48:07,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:07,007 INFO L82 PathProgramCache]: Analyzing trace with hash 95288963, now seen corresponding path program 1 times [2020-04-18 07:48:07,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:07,007 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1943686663] [2020-04-18 07:48:07,007 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:07,008 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 19 transitions. [2020-04-18 07:48:07,008 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2020-04-18 07:48:07,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 07:48:07,008 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:07,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:07,009 INFO L82 PathProgramCache]: Analyzing trace with hash -231363683, now seen corresponding path program 2 times [2020-04-18 07:48:07,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:07,009 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086194878] [2020-04-18 07:48:07,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:07,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:07,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 07:48:07,033 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086194878] [2020-04-18 07:48:07,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:07,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:48:07,035 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:07,035 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:07,036 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 18 transitions. [2020-04-18 07:48:07,036 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:07,063 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 07:48:07,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 07:48:07,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 07:48:07,064 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 5 states. [2020-04-18 07:48:07,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:07,082 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2020-04-18 07:48:07,082 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2020-04-18 07:48:07,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 07:48:07,083 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:48:07,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:07,084 INFO L82 PathProgramCache]: Analyzing trace with hash 95288963, now seen corresponding path program 3 times [2020-04-18 07:48:07,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:07,084 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400819114] [2020-04-18 07:48:07,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:07,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 07:48:07,117 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400819114] [2020-04-18 07:48:07,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:07,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:48:07,118 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:07,119 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:07,122 INFO L259 McrAutomatonBuilder]: Finished intersection with 14 states and 16 transitions. [2020-04-18 07:48:07,122 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:07,131 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:48:07,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 07:48:07,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-04-18 07:48:07,132 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 4 states. [2020-04-18 07:48:07,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:07,148 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2020-04-18 07:48:07,148 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2020-04-18 07:48:07,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:48:07,148 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1943686663] [2020-04-18 07:48:07,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:48:07,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 07:48:07,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1943686663] [2020-04-18 07:48:07,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-18 07:48:07,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:48:07,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 07:48:07,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 07:48:07,150 INFO L87 Difference]: Start difference. First operand 1177 states and 4196 transitions. Second operand 6 states. [2020-04-18 07:48:07,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:07,216 INFO L93 Difference]: Finished difference Result 950 states and 3337 transitions. [2020-04-18 07:48:07,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:48:07,217 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-04-18 07:48:07,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:48:07,228 INFO L225 Difference]: With dead ends: 950 [2020-04-18 07:48:07,229 INFO L226 Difference]: Without dead ends: 950 [2020-04-18 07:48:07,229 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 07:48:07,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2020-04-18 07:48:07,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 723. [2020-04-18 07:48:07,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2020-04-18 07:48:07,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 2478 transitions. [2020-04-18 07:48:07,275 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 2478 transitions. Word has length 9 [2020-04-18 07:48:07,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:48:07,276 INFO L479 AbstractCegarLoop]: Abstraction has 723 states and 2478 transitions. [2020-04-18 07:48:07,276 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-18 07:48:07,276 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 2478 transitions. [2020-04-18 07:48:07,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-04-18 07:48:07,277 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:07,277 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2020-04-18 07:48:07,278 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 07:48:07,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:07,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1255400151, now seen corresponding path program 1 times [2020-04-18 07:48:07,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:07,279 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [592970781] [2020-04-18 07:48:07,280 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:07,281 INFO L259 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-04-18 07:48:07,282 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2020-04-18 07:48:07,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-04-18 07:48:07,282 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:07,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:07,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1255400151, now seen corresponding path program 2 times [2020-04-18 07:48:07,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:07,283 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254036006] [2020-04-18 07:48:07,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:07,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:07,303 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-04-18 07:48:07,304 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254036006] [2020-04-18 07:48:07,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:07,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:48:07,304 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:07,307 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:07,308 INFO L259 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-04-18 07:48:07,308 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:07,313 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:48:07,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:07,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:07,314 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 3 states. [2020-04-18 07:48:07,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:07,317 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2020-04-18 07:48:07,317 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2020-04-18 07:48:07,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:48:07,317 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [592970781] [2020-04-18 07:48:07,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:48:07,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 07:48:07,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [592970781] [2020-04-18 07:48:07,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 07:48:07,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:48:07,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:07,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:07,319 INFO L87 Difference]: Start difference. First operand 723 states and 2478 transitions. Second operand 3 states. [2020-04-18 07:48:07,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:07,360 INFO L93 Difference]: Finished difference Result 1044 states and 3505 transitions. [2020-04-18 07:48:07,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:48:07,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-04-18 07:48:07,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:48:07,370 INFO L225 Difference]: With dead ends: 1044 [2020-04-18 07:48:07,370 INFO L226 Difference]: Without dead ends: 1044 [2020-04-18 07:48:07,372 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:07,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2020-04-18 07:48:07,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 880. [2020-04-18 07:48:07,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2020-04-18 07:48:07,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 3058 transitions. [2020-04-18 07:48:07,409 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 3058 transitions. Word has length 11 [2020-04-18 07:48:07,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:48:07,409 INFO L479 AbstractCegarLoop]: Abstraction has 880 states and 3058 transitions. [2020-04-18 07:48:07,409 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 07:48:07,409 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 3058 transitions. [2020-04-18 07:48:07,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-04-18 07:48:07,410 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:07,410 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:48:07,410 INFO L427 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 07:48:07,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:07,411 INFO L82 PathProgramCache]: Analyzing trace with hash 262700715, now seen corresponding path program 1 times [2020-04-18 07:48:07,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:07,411 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1554014040] [2020-04-18 07:48:07,412 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:07,412 INFO L259 McrAutomatonBuilder]: Finished intersection with 21 states and 28 transitions. [2020-04-18 07:48:07,413 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-04-18 07:48:07,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-04-18 07:48:07,413 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:07,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:07,415 INFO L82 PathProgramCache]: Analyzing trace with hash 745883339, now seen corresponding path program 2 times [2020-04-18 07:48:07,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:07,415 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194715624] [2020-04-18 07:48:07,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:07,436 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-04-18 07:48:07,437 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194715624] [2020-04-18 07:48:07,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:07,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:48:07,437 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:07,438 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:07,441 INFO L259 McrAutomatonBuilder]: Finished intersection with 21 states and 27 transitions. [2020-04-18 07:48:07,441 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:07,464 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 07:48:07,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 07:48:07,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 07:48:07,465 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2020-04-18 07:48:07,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:07,478 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2020-04-18 07:48:07,478 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2020-04-18 07:48:07,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-04-18 07:48:07,479 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:48:07,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:07,479 INFO L82 PathProgramCache]: Analyzing trace with hash 262700715, now seen corresponding path program 3 times [2020-04-18 07:48:07,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:07,480 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181044006] [2020-04-18 07:48:07,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:07,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:07,505 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-04-18 07:48:07,506 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181044006] [2020-04-18 07:48:07,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:07,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:48:07,506 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:07,507 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:07,509 INFO L259 McrAutomatonBuilder]: Finished intersection with 20 states and 25 transitions. [2020-04-18 07:48:07,509 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:07,515 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:48:07,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 07:48:07,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-04-18 07:48:07,515 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand 4 states. [2020-04-18 07:48:07,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:07,531 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2020-04-18 07:48:07,531 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2020-04-18 07:48:07,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:48:07,531 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1554014040] [2020-04-18 07:48:07,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:48:07,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 07:48:07,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1554014040] [2020-04-18 07:48:07,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-18 07:48:07,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:48:07,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 07:48:07,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 07:48:07,533 INFO L87 Difference]: Start difference. First operand 880 states and 3058 transitions. Second operand 6 states. [2020-04-18 07:48:07,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:07,572 INFO L93 Difference]: Finished difference Result 716 states and 2447 transitions. [2020-04-18 07:48:07,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:48:07,572 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-04-18 07:48:07,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:48:07,578 INFO L225 Difference]: With dead ends: 716 [2020-04-18 07:48:07,578 INFO L226 Difference]: Without dead ends: 716 [2020-04-18 07:48:07,579 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 07:48:07,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2020-04-18 07:48:07,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 552. [2020-04-18 07:48:07,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2020-04-18 07:48:07,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1836 transitions. [2020-04-18 07:48:07,602 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 1836 transitions. Word has length 12 [2020-04-18 07:48:07,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:48:07,602 INFO L479 AbstractCegarLoop]: Abstraction has 552 states and 1836 transitions. [2020-04-18 07:48:07,603 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-18 07:48:07,603 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1836 transitions. [2020-04-18 07:48:07,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 07:48:07,604 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:07,604 INFO L425 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:48:07,604 INFO L427 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 07:48:07,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:07,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1066051238, now seen corresponding path program 1 times [2020-04-18 07:48:07,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:07,605 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1448284904] [2020-04-18 07:48:07,605 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:07,606 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 14 transitions. [2020-04-18 07:48:07,606 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2020-04-18 07:48:07,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 07:48:07,607 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:07,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:07,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1066051238, now seen corresponding path program 2 times [2020-04-18 07:48:07,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:07,607 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722633670] [2020-04-18 07:48:07,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:07,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:07,622 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-04-18 07:48:07,623 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722633670] [2020-04-18 07:48:07,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:07,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:48:07,623 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:07,624 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:07,625 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 14 transitions. [2020-04-18 07:48:07,626 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:07,630 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:48:07,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:07,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:07,630 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2020-04-18 07:48:07,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:07,633 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2020-04-18 07:48:07,634 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2020-04-18 07:48:07,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:48:07,634 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1448284904] [2020-04-18 07:48:07,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:48:07,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 07:48:07,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1448284904] [2020-04-18 07:48:07,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 07:48:07,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:48:07,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:07,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:07,635 INFO L87 Difference]: Start difference. First operand 552 states and 1836 transitions. Second operand 3 states. [2020-04-18 07:48:07,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:07,668 INFO L93 Difference]: Finished difference Result 756 states and 2485 transitions. [2020-04-18 07:48:07,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:48:07,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-04-18 07:48:07,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:48:07,675 INFO L225 Difference]: With dead ends: 756 [2020-04-18 07:48:07,675 INFO L226 Difference]: Without dead ends: 756 [2020-04-18 07:48:07,676 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:07,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2020-04-18 07:48:07,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 652. [2020-04-18 07:48:07,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2020-04-18 07:48:07,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 2203 transitions. [2020-04-18 07:48:07,703 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 2203 transitions. Word has length 14 [2020-04-18 07:48:07,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:48:07,703 INFO L479 AbstractCegarLoop]: Abstraction has 652 states and 2203 transitions. [2020-04-18 07:48:07,703 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 07:48:07,703 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 2203 transitions. [2020-04-18 07:48:07,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 07:48:07,704 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:07,704 INFO L425 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2020-04-18 07:48:07,705 INFO L427 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 07:48:07,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:07,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1312017708, now seen corresponding path program 1 times [2020-04-18 07:48:07,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:07,705 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [368838291] [2020-04-18 07:48:07,706 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:07,707 INFO L259 McrAutomatonBuilder]: Finished intersection with 16 states and 15 transitions. [2020-04-18 07:48:07,707 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2020-04-18 07:48:07,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 07:48:07,707 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:07,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:07,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1312017708, now seen corresponding path program 2 times [2020-04-18 07:48:07,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:07,708 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769031677] [2020-04-18 07:48:07,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 07:48:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 07:48:07,724 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-04-18 07:48:07,725 INFO L174 FreeRefinementEngine]: Strategy MCR found a feasible trace [2020-04-18 07:48:07,725 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-04-18 07:48:07,725 WARN L363 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2020-04-18 07:48:07,725 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2020-04-18 07:48:07,733 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,733 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,733 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,733 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,734 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,734 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,734 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,734 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,734 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,734 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,734 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,735 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,735 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,735 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,735 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,735 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,735 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,736 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,736 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,736 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,736 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,736 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,736 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,736 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,737 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,737 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,737 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,737 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,737 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,737 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,737 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,738 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,738 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,738 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,738 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,738 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,738 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,739 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,739 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,739 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,739 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,739 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,739 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,740 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,740 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,740 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,740 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,740 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,740 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,740 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,741 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,741 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,741 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,741 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,741 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,741 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,742 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,742 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,742 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,742 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,742 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,742 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,743 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,743 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,743 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,743 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,743 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,743 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,743 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,744 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,744 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,744 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,744 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,744 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,744 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,745 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,746 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,746 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,746 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,747 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,747 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,747 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,748 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,748 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,748 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,749 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,749 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,749 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,750 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,750 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,751 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,751 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,751 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,751 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,752 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,753 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,753 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,753 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,753 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,753 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:07,754 INFO L251 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-04-18 07:48:07,755 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 07:48:07,755 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 07:48:07,755 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 07:48:07,755 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 07:48:07,755 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 07:48:07,755 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 07:48:07,756 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 07:48:07,756 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 07:48:07,757 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 85 transitions, 215 flow [2020-04-18 07:48:07,757 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 90 places, 85 transitions, 215 flow [2020-04-18 07:48:07,774 INFO L129 PetriNetUnfolder]: 11/129 cut-off events. [2020-04-18 07:48:07,775 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-04-18 07:48:07,776 INFO L80 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 129 events. 11/129 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 368 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 121. Up to 12 conditions per place. [2020-04-18 07:48:07,782 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 90 places, 85 transitions, 215 flow [2020-04-18 07:48:07,796 INFO L129 PetriNetUnfolder]: 11/129 cut-off events. [2020-04-18 07:48:07,796 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-04-18 07:48:07,797 INFO L80 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 129 events. 11/129 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 368 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 121. Up to 12 conditions per place. [2020-04-18 07:48:07,802 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 4320 [2020-04-18 07:48:07,802 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-04-18 07:48:09,040 INFO L206 etLargeBlockEncoding]: Checked pairs total: 6467 [2020-04-18 07:48:09,040 INFO L214 etLargeBlockEncoding]: Total number of compositions: 76 [2020-04-18 07:48:09,040 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 28 transitions, 101 flow [2020-04-18 07:48:09,606 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6484 states. [2020-04-18 07:48:09,606 INFO L276 IsEmpty]: Start isEmpty. Operand 6484 states. [2020-04-18 07:48:09,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-04-18 07:48:09,606 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:09,606 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-04-18 07:48:09,607 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:48:09,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:09,607 INFO L82 PathProgramCache]: Analyzing trace with hash 666270871, now seen corresponding path program 1 times [2020-04-18 07:48:09,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:09,608 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1270605735] [2020-04-18 07:48:09,608 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:09,608 INFO L259 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-04-18 07:48:09,608 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2020-04-18 07:48:09,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-04-18 07:48:09,609 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:09,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:09,609 INFO L82 PathProgramCache]: Analyzing trace with hash 666270871, now seen corresponding path program 2 times [2020-04-18 07:48:09,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:09,610 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375135588] [2020-04-18 07:48:09,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:09,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:48:09,627 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375135588] [2020-04-18 07:48:09,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:09,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:48:09,628 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:09,628 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:09,629 INFO L259 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-04-18 07:48:09,629 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:09,632 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:48:09,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:09,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:09,633 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2020-04-18 07:48:09,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:09,635 INFO L93 Difference]: Finished difference Result 6 states and 5 transitions. [2020-04-18 07:48:09,635 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 5 transitions. [2020-04-18 07:48:09,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:48:09,636 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1270605735] [2020-04-18 07:48:09,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:48:09,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 07:48:09,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1270605735] [2020-04-18 07:48:09,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 07:48:09,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:48:09,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:09,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:09,637 INFO L87 Difference]: Start difference. First operand 6484 states. Second operand 3 states. [2020-04-18 07:48:09,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:09,780 INFO L93 Difference]: Finished difference Result 7629 states and 32588 transitions. [2020-04-18 07:48:09,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:48:09,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-04-18 07:48:09,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:48:09,855 INFO L225 Difference]: With dead ends: 7629 [2020-04-18 07:48:09,855 INFO L226 Difference]: Without dead ends: 7629 [2020-04-18 07:48:09,855 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:10,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7629 states. [2020-04-18 07:48:10,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7629 to 6366. [2020-04-18 07:48:10,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6366 states. [2020-04-18 07:48:10,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6366 states to 6366 states and 28029 transitions. [2020-04-18 07:48:10,357 INFO L78 Accepts]: Start accepts. Automaton has 6366 states and 28029 transitions. Word has length 5 [2020-04-18 07:48:10,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:48:10,357 INFO L479 AbstractCegarLoop]: Abstraction has 6366 states and 28029 transitions. [2020-04-18 07:48:10,357 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 07:48:10,357 INFO L276 IsEmpty]: Start isEmpty. Operand 6366 states and 28029 transitions. [2020-04-18 07:48:10,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-04-18 07:48:10,358 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:10,358 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2020-04-18 07:48:10,358 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:48:10,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:10,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1690072825, now seen corresponding path program 1 times [2020-04-18 07:48:10,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:10,359 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [94811859] [2020-04-18 07:48:10,359 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:10,360 INFO L259 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-04-18 07:48:10,360 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-04-18 07:48:10,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-04-18 07:48:10,360 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:10,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:10,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1690072825, now seen corresponding path program 2 times [2020-04-18 07:48:10,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:10,361 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921689137] [2020-04-18 07:48:10,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:10,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:10,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 07:48:10,375 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921689137] [2020-04-18 07:48:10,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:10,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:48:10,375 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:10,376 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:10,376 INFO L259 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-04-18 07:48:10,376 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:10,379 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:48:10,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:10,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:10,380 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2020-04-18 07:48:10,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:10,382 INFO L93 Difference]: Finished difference Result 9 states and 8 transitions. [2020-04-18 07:48:10,383 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 8 transitions. [2020-04-18 07:48:10,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:48:10,383 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [94811859] [2020-04-18 07:48:10,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:48:10,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 07:48:10,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [94811859] [2020-04-18 07:48:10,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 07:48:10,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:48:10,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:10,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:10,385 INFO L87 Difference]: Start difference. First operand 6366 states and 28029 transitions. Second operand 3 states. [2020-04-18 07:48:10,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:10,495 INFO L93 Difference]: Finished difference Result 9120 states and 39254 transitions. [2020-04-18 07:48:10,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:48:10,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-04-18 07:48:10,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:48:10,546 INFO L225 Difference]: With dead ends: 9120 [2020-04-18 07:48:10,546 INFO L226 Difference]: Without dead ends: 9120 [2020-04-18 07:48:10,547 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:11,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9120 states. [2020-04-18 07:48:11,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9120 to 7564. [2020-04-18 07:48:11,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7564 states. [2020-04-18 07:48:11,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7564 states to 7564 states and 33556 transitions. [2020-04-18 07:48:11,565 INFO L78 Accepts]: Start accepts. Automaton has 7564 states and 33556 transitions. Word has length 8 [2020-04-18 07:48:11,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:48:11,566 INFO L479 AbstractCegarLoop]: Abstraction has 7564 states and 33556 transitions. [2020-04-18 07:48:11,566 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 07:48:11,566 INFO L276 IsEmpty]: Start isEmpty. Operand 7564 states and 33556 transitions. [2020-04-18 07:48:11,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 07:48:11,566 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:11,566 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:48:11,567 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:48:11,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:11,567 INFO L82 PathProgramCache]: Analyzing trace with hash 868276956, now seen corresponding path program 1 times [2020-04-18 07:48:11,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:11,567 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1560726988] [2020-04-18 07:48:11,568 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:11,568 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 25 transitions. [2020-04-18 07:48:11,568 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-04-18 07:48:11,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 07:48:11,569 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:11,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:11,569 INFO L82 PathProgramCache]: Analyzing trace with hash 962075826, now seen corresponding path program 2 times [2020-04-18 07:48:11,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:11,569 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788122678] [2020-04-18 07:48:11,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:11,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:11,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:48:11,587 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788122678] [2020-04-18 07:48:11,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:11,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:48:11,588 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:11,589 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:11,589 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 24 transitions. [2020-04-18 07:48:11,590 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:11,593 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:48:11,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:11,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:11,593 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2020-04-18 07:48:11,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:11,598 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2020-04-18 07:48:11,598 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2020-04-18 07:48:11,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 07:48:11,599 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:48:11,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:11,599 INFO L82 PathProgramCache]: Analyzing trace with hash 868276956, now seen corresponding path program 3 times [2020-04-18 07:48:11,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:11,600 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322918977] [2020-04-18 07:48:11,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:11,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:48:11,628 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322918977] [2020-04-18 07:48:11,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:11,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:48:11,628 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:11,629 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:11,629 INFO L259 McrAutomatonBuilder]: Finished intersection with 14 states and 16 transitions. [2020-04-18 07:48:11,630 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:11,634 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:48:11,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 07:48:11,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 07:48:11,634 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand 4 states. [2020-04-18 07:48:11,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:11,645 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2020-04-18 07:48:11,645 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2020-04-18 07:48:11,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:48:11,645 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1560726988] [2020-04-18 07:48:11,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:48:11,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 07:48:11,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1560726988] [2020-04-18 07:48:11,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-04-18 07:48:11,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:48:11,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 07:48:11,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 07:48:11,647 INFO L87 Difference]: Start difference. First operand 7564 states and 33556 transitions. Second operand 4 states. [2020-04-18 07:48:11,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:11,725 INFO L93 Difference]: Finished difference Result 6008 states and 26302 transitions. [2020-04-18 07:48:11,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:48:11,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-04-18 07:48:11,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:48:11,755 INFO L225 Difference]: With dead ends: 6008 [2020-04-18 07:48:11,755 INFO L226 Difference]: Without dead ends: 6008 [2020-04-18 07:48:11,755 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 07:48:11,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6008 states. [2020-04-18 07:48:12,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6008 to 4771. [2020-04-18 07:48:12,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4771 states. [2020-04-18 07:48:12,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4771 states to 4771 states and 20598 transitions. [2020-04-18 07:48:12,129 INFO L78 Accepts]: Start accepts. Automaton has 4771 states and 20598 transitions. Word has length 9 [2020-04-18 07:48:12,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:48:12,129 INFO L479 AbstractCegarLoop]: Abstraction has 4771 states and 20598 transitions. [2020-04-18 07:48:12,129 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-04-18 07:48:12,130 INFO L276 IsEmpty]: Start isEmpty. Operand 4771 states and 20598 transitions. [2020-04-18 07:48:12,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 07:48:12,130 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:12,130 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:48:12,130 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:48:12,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:12,131 INFO L82 PathProgramCache]: Analyzing trace with hash 852652394, now seen corresponding path program 1 times [2020-04-18 07:48:12,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:12,131 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [369649649] [2020-04-18 07:48:12,131 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:12,132 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 19 transitions. [2020-04-18 07:48:12,132 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2020-04-18 07:48:12,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 07:48:12,132 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:12,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:12,133 INFO L82 PathProgramCache]: Analyzing trace with hash 868276948, now seen corresponding path program 2 times [2020-04-18 07:48:12,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:12,133 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398223906] [2020-04-18 07:48:12,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:12,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:12,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 07:48:12,147 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398223906] [2020-04-18 07:48:12,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:12,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:48:12,148 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:12,148 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:12,149 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 18 transitions. [2020-04-18 07:48:12,149 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:12,171 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 07:48:12,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 07:48:12,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 07:48:12,172 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 5 states. [2020-04-18 07:48:12,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:12,183 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2020-04-18 07:48:12,183 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2020-04-18 07:48:12,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 07:48:12,183 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:48:12,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:12,184 INFO L82 PathProgramCache]: Analyzing trace with hash 852652394, now seen corresponding path program 3 times [2020-04-18 07:48:12,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:12,184 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233333867] [2020-04-18 07:48:12,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:12,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 07:48:12,202 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233333867] [2020-04-18 07:48:12,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:12,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:48:12,202 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:12,203 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:12,204 INFO L259 McrAutomatonBuilder]: Finished intersection with 14 states and 16 transitions. [2020-04-18 07:48:12,204 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:12,210 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:48:12,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 07:48:12,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-04-18 07:48:12,211 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 4 states. [2020-04-18 07:48:12,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:12,221 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2020-04-18 07:48:12,221 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2020-04-18 07:48:12,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:48:12,222 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [369649649] [2020-04-18 07:48:12,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:48:12,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 07:48:12,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [369649649] [2020-04-18 07:48:12,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-18 07:48:12,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:48:12,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 07:48:12,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 07:48:12,223 INFO L87 Difference]: Start difference. First operand 4771 states and 20598 transitions. Second operand 6 states. [2020-04-18 07:48:12,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:12,292 INFO L93 Difference]: Finished difference Result 3827 states and 16326 transitions. [2020-04-18 07:48:12,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:48:12,292 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-04-18 07:48:12,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:48:12,310 INFO L225 Difference]: With dead ends: 3827 [2020-04-18 07:48:12,311 INFO L226 Difference]: Without dead ends: 3827 [2020-04-18 07:48:12,312 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 07:48:12,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3827 states. [2020-04-18 07:48:12,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3827 to 2883. [2020-04-18 07:48:12,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2883 states. [2020-04-18 07:48:12,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2883 states to 2883 states and 12054 transitions. [2020-04-18 07:48:12,454 INFO L78 Accepts]: Start accepts. Automaton has 2883 states and 12054 transitions. Word has length 9 [2020-04-18 07:48:12,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:48:12,454 INFO L479 AbstractCegarLoop]: Abstraction has 2883 states and 12054 transitions. [2020-04-18 07:48:12,454 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-18 07:48:12,454 INFO L276 IsEmpty]: Start isEmpty. Operand 2883 states and 12054 transitions. [2020-04-18 07:48:12,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-04-18 07:48:12,455 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:12,455 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2020-04-18 07:48:12,455 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:48:12,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:12,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1095418705, now seen corresponding path program 1 times [2020-04-18 07:48:12,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:12,456 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [276139790] [2020-04-18 07:48:12,456 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:12,457 INFO L259 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-04-18 07:48:12,457 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2020-04-18 07:48:12,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-04-18 07:48:12,457 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:12,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:12,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1095418705, now seen corresponding path program 2 times [2020-04-18 07:48:12,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:12,458 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256454653] [2020-04-18 07:48:12,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:12,474 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-04-18 07:48:12,474 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256454653] [2020-04-18 07:48:12,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:12,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:48:12,475 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:12,476 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:12,477 INFO L259 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-04-18 07:48:12,477 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:12,480 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:48:12,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:12,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:12,481 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 3 states. [2020-04-18 07:48:12,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:12,483 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2020-04-18 07:48:12,483 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2020-04-18 07:48:12,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:48:12,483 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [276139790] [2020-04-18 07:48:12,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:48:12,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 07:48:12,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [276139790] [2020-04-18 07:48:12,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 07:48:12,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:48:12,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:12,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:12,485 INFO L87 Difference]: Start difference. First operand 2883 states and 12054 transitions. Second operand 3 states. [2020-04-18 07:48:12,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:12,531 INFO L93 Difference]: Finished difference Result 4275 states and 17545 transitions. [2020-04-18 07:48:12,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:48:12,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-04-18 07:48:12,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:48:12,551 INFO L225 Difference]: With dead ends: 4275 [2020-04-18 07:48:12,551 INFO L226 Difference]: Without dead ends: 4275 [2020-04-18 07:48:12,552 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:12,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4275 states. [2020-04-18 07:48:12,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4275 to 3574. [2020-04-18 07:48:12,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3574 states. [2020-04-18 07:48:12,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3574 states to 3574 states and 15125 transitions. [2020-04-18 07:48:12,701 INFO L78 Accepts]: Start accepts. Automaton has 3574 states and 15125 transitions. Word has length 11 [2020-04-18 07:48:12,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:48:12,701 INFO L479 AbstractCegarLoop]: Abstraction has 3574 states and 15125 transitions. [2020-04-18 07:48:12,702 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 07:48:12,702 INFO L276 IsEmpty]: Start isEmpty. Operand 3574 states and 15125 transitions. [2020-04-18 07:48:12,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-04-18 07:48:12,702 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:12,702 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:48:12,703 INFO L427 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:48:12,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:12,703 INFO L82 PathProgramCache]: Analyzing trace with hash 401760447, now seen corresponding path program 1 times [2020-04-18 07:48:12,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:12,703 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1176370927] [2020-04-18 07:48:12,704 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:12,704 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 22 transitions. [2020-04-18 07:48:12,704 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-04-18 07:48:12,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-04-18 07:48:12,705 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:12,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:12,705 INFO L82 PathProgramCache]: Analyzing trace with hash 789549611, now seen corresponding path program 2 times [2020-04-18 07:48:12,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:12,705 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95685078] [2020-04-18 07:48:12,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:12,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:12,726 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-04-18 07:48:12,726 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95685078] [2020-04-18 07:48:12,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:12,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:48:12,727 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:12,728 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:12,729 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 21 transitions. [2020-04-18 07:48:12,729 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:12,748 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 07:48:12,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 07:48:12,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 07:48:12,749 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 5 states. [2020-04-18 07:48:12,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:12,760 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2020-04-18 07:48:12,761 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-04-18 07:48:12,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-04-18 07:48:12,761 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:48:12,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:12,761 INFO L82 PathProgramCache]: Analyzing trace with hash 401760447, now seen corresponding path program 3 times [2020-04-18 07:48:12,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:12,762 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449098526] [2020-04-18 07:48:12,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:12,874 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-04-18 07:48:12,874 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449098526] [2020-04-18 07:48:12,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:12,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:48:12,874 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:12,875 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:12,877 INFO L259 McrAutomatonBuilder]: Finished intersection with 17 states and 19 transitions. [2020-04-18 07:48:12,877 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:12,888 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:48:12,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 07:48:12,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-04-18 07:48:12,889 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 4 states. [2020-04-18 07:48:12,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:12,902 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2020-04-18 07:48:12,902 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-04-18 07:48:12,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:48:12,902 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1176370927] [2020-04-18 07:48:12,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:48:12,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 07:48:12,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1176370927] [2020-04-18 07:48:12,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-18 07:48:12,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:48:12,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 07:48:12,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 07:48:12,904 INFO L87 Difference]: Start difference. First operand 3574 states and 15125 transitions. Second operand 6 states. [2020-04-18 07:48:12,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:12,974 INFO L93 Difference]: Finished difference Result 2873 states and 12004 transitions. [2020-04-18 07:48:12,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:48:12,975 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-04-18 07:48:12,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:48:12,993 INFO L225 Difference]: With dead ends: 2873 [2020-04-18 07:48:12,993 INFO L226 Difference]: Without dead ends: 2873 [2020-04-18 07:48:12,993 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 07:48:13,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2873 states. [2020-04-18 07:48:13,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2873 to 2172. [2020-04-18 07:48:13,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2172 states. [2020-04-18 07:48:13,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2172 states to 2172 states and 8883 transitions. [2020-04-18 07:48:13,108 INFO L78 Accepts]: Start accepts. Automaton has 2172 states and 8883 transitions. Word has length 12 [2020-04-18 07:48:13,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:48:13,109 INFO L479 AbstractCegarLoop]: Abstraction has 2172 states and 8883 transitions. [2020-04-18 07:48:13,109 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-18 07:48:13,109 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 8883 transitions. [2020-04-18 07:48:13,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 07:48:13,110 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:13,110 INFO L425 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:48:13,110 INFO L427 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:48:13,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:13,110 INFO L82 PathProgramCache]: Analyzing trace with hash -596519610, now seen corresponding path program 1 times [2020-04-18 07:48:13,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:13,111 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [820072583] [2020-04-18 07:48:13,112 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:13,112 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 14 transitions. [2020-04-18 07:48:13,113 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2020-04-18 07:48:13,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 07:48:13,113 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:13,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:13,113 INFO L82 PathProgramCache]: Analyzing trace with hash -596519610, now seen corresponding path program 2 times [2020-04-18 07:48:13,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:13,114 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850328787] [2020-04-18 07:48:13,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:13,131 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-04-18 07:48:13,132 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850328787] [2020-04-18 07:48:13,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:13,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:48:13,132 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:13,133 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:13,134 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 14 transitions. [2020-04-18 07:48:13,134 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:13,138 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:48:13,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:13,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:13,138 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2020-04-18 07:48:13,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:13,141 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2020-04-18 07:48:13,141 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2020-04-18 07:48:13,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:48:13,141 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [820072583] [2020-04-18 07:48:13,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:48:13,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 07:48:13,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [820072583] [2020-04-18 07:48:13,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 07:48:13,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:48:13,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:13,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:13,143 INFO L87 Difference]: Start difference. First operand 2172 states and 8883 transitions. Second operand 3 states. [2020-04-18 07:48:13,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:13,190 INFO L93 Difference]: Finished difference Result 3177 states and 12799 transitions. [2020-04-18 07:48:13,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:48:13,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-04-18 07:48:13,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:48:13,203 INFO L225 Difference]: With dead ends: 3177 [2020-04-18 07:48:13,203 INFO L226 Difference]: Without dead ends: 3177 [2020-04-18 07:48:13,204 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:13,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3177 states. [2020-04-18 07:48:13,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3177 to 2671. [2020-04-18 07:48:13,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2671 states. [2020-04-18 07:48:13,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2671 states to 2671 states and 11075 transitions. [2020-04-18 07:48:13,301 INFO L78 Accepts]: Start accepts. Automaton has 2671 states and 11075 transitions. Word has length 14 [2020-04-18 07:48:13,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:48:13,302 INFO L479 AbstractCegarLoop]: Abstraction has 2671 states and 11075 transitions. [2020-04-18 07:48:13,302 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 07:48:13,302 INFO L276 IsEmpty]: Start isEmpty. Operand 2671 states and 11075 transitions. [2020-04-18 07:48:13,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 07:48:13,303 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:13,303 INFO L425 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:48:13,303 INFO L427 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:48:13,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:13,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1312236012, now seen corresponding path program 1 times [2020-04-18 07:48:13,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:13,304 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1228398234] [2020-04-18 07:48:13,304 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:13,305 INFO L259 McrAutomatonBuilder]: Finished intersection with 24 states and 31 transitions. [2020-04-18 07:48:13,305 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-04-18 07:48:13,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 07:48:13,305 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:13,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:13,306 INFO L82 PathProgramCache]: Analyzing trace with hash 2092154442, now seen corresponding path program 2 times [2020-04-18 07:48:13,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:13,306 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217392649] [2020-04-18 07:48:13,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:13,321 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-04-18 07:48:13,322 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217392649] [2020-04-18 07:48:13,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:13,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:48:13,322 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:13,324 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:13,325 INFO L259 McrAutomatonBuilder]: Finished intersection with 24 states and 30 transitions. [2020-04-18 07:48:13,326 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:13,344 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 07:48:13,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 07:48:13,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 07:48:13,345 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-04-18 07:48:13,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:13,358 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2020-04-18 07:48:13,358 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2020-04-18 07:48:13,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 07:48:13,359 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:48:13,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:13,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1312236012, now seen corresponding path program 3 times [2020-04-18 07:48:13,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:13,359 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815276899] [2020-04-18 07:48:13,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:13,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:13,380 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-04-18 07:48:13,380 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815276899] [2020-04-18 07:48:13,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:13,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:48:13,381 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:13,382 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:13,383 INFO L259 McrAutomatonBuilder]: Finished intersection with 23 states and 28 transitions. [2020-04-18 07:48:13,383 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:13,389 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:48:13,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 07:48:13,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-04-18 07:48:13,390 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 4 states. [2020-04-18 07:48:13,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:13,400 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2020-04-18 07:48:13,400 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2020-04-18 07:48:13,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:48:13,400 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1228398234] [2020-04-18 07:48:13,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:48:13,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 07:48:13,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1228398234] [2020-04-18 07:48:13,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-18 07:48:13,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:48:13,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 07:48:13,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 07:48:13,402 INFO L87 Difference]: Start difference. First operand 2671 states and 11075 transitions. Second operand 6 states. [2020-04-18 07:48:13,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:13,450 INFO L93 Difference]: Finished difference Result 2165 states and 8845 transitions. [2020-04-18 07:48:13,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:48:13,451 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-04-18 07:48:13,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:48:13,459 INFO L225 Difference]: With dead ends: 2165 [2020-04-18 07:48:13,459 INFO L226 Difference]: Without dead ends: 2165 [2020-04-18 07:48:13,460 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 07:48:13,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2165 states. [2020-04-18 07:48:13,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2165 to 1659. [2020-04-18 07:48:13,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1659 states. [2020-04-18 07:48:13,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 6615 transitions. [2020-04-18 07:48:13,517 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 6615 transitions. Word has length 15 [2020-04-18 07:48:13,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:48:13,518 INFO L479 AbstractCegarLoop]: Abstraction has 1659 states and 6615 transitions. [2020-04-18 07:48:13,518 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-18 07:48:13,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 6615 transitions. [2020-04-18 07:48:13,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 07:48:13,519 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:13,519 INFO L425 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:48:13,519 INFO L427 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:48:13,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:13,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1514810044, now seen corresponding path program 1 times [2020-04-18 07:48:13,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:13,521 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [664088968] [2020-04-18 07:48:13,522 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:13,522 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 17 transitions. [2020-04-18 07:48:13,523 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-04-18 07:48:13,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 07:48:13,523 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:13,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:13,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1514810044, now seen corresponding path program 2 times [2020-04-18 07:48:13,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:13,524 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371646971] [2020-04-18 07:48:13,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:13,548 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-04-18 07:48:13,548 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371646971] [2020-04-18 07:48:13,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:13,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:48:13,549 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:13,550 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:13,551 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 17 transitions. [2020-04-18 07:48:13,551 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:13,554 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:48:13,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:13,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:13,555 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2020-04-18 07:48:13,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:13,558 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2020-04-18 07:48:13,559 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2020-04-18 07:48:13,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:48:13,559 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [664088968] [2020-04-18 07:48:13,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:48:13,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 07:48:13,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [664088968] [2020-04-18 07:48:13,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 07:48:13,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:48:13,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:13,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:13,561 INFO L87 Difference]: Start difference. First operand 1659 states and 6615 transitions. Second operand 3 states. [2020-04-18 07:48:13,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:13,603 INFO L93 Difference]: Finished difference Result 2295 states and 9088 transitions. [2020-04-18 07:48:13,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:48:13,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-04-18 07:48:13,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:48:13,612 INFO L225 Difference]: With dead ends: 2295 [2020-04-18 07:48:13,612 INFO L226 Difference]: Without dead ends: 2295 [2020-04-18 07:48:13,612 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:13,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2295 states. [2020-04-18 07:48:13,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2295 to 1975. [2020-04-18 07:48:13,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1975 states. [2020-04-18 07:48:13,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 8000 transitions. [2020-04-18 07:48:13,676 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 8000 transitions. Word has length 17 [2020-04-18 07:48:13,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:48:13,676 INFO L479 AbstractCegarLoop]: Abstraction has 1975 states and 8000 transitions. [2020-04-18 07:48:13,676 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 07:48:13,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 8000 transitions. [2020-04-18 07:48:13,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 07:48:13,678 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:13,678 INFO L425 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:48:13,679 INFO L427 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:48:13,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:13,679 INFO L82 PathProgramCache]: Analyzing trace with hash -285527274, now seen corresponding path program 1 times [2020-04-18 07:48:13,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:13,680 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [129452345] [2020-04-18 07:48:13,680 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:13,681 INFO L259 McrAutomatonBuilder]: Finished intersection with 27 states and 34 transitions. [2020-04-18 07:48:13,681 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2020-04-18 07:48:13,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 07:48:13,682 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:13,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:13,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1114453212, now seen corresponding path program 2 times [2020-04-18 07:48:13,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:13,682 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310738055] [2020-04-18 07:48:13,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:13,698 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-04-18 07:48:13,699 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310738055] [2020-04-18 07:48:13,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:13,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:48:13,699 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:13,700 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:13,702 INFO L259 McrAutomatonBuilder]: Finished intersection with 27 states and 33 transitions. [2020-04-18 07:48:13,703 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:13,725 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 07:48:13,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 07:48:13,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 07:48:13,726 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 5 states. [2020-04-18 07:48:13,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:13,738 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2020-04-18 07:48:13,738 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2020-04-18 07:48:13,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 07:48:13,739 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:48:13,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:13,739 INFO L82 PathProgramCache]: Analyzing trace with hash -285527274, now seen corresponding path program 3 times [2020-04-18 07:48:13,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:13,740 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825716905] [2020-04-18 07:48:13,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:13,762 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-04-18 07:48:13,762 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825716905] [2020-04-18 07:48:13,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:13,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:48:13,763 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:13,764 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:13,766 INFO L259 McrAutomatonBuilder]: Finished intersection with 26 states and 31 transitions. [2020-04-18 07:48:13,766 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:13,772 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:48:13,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 07:48:13,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-04-18 07:48:13,772 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand 4 states. [2020-04-18 07:48:13,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:13,782 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2020-04-18 07:48:13,782 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2020-04-18 07:48:13,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:48:13,783 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [129452345] [2020-04-18 07:48:13,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:48:13,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 07:48:13,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [129452345] [2020-04-18 07:48:13,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-18 07:48:13,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:48:13,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 07:48:13,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 07:48:13,784 INFO L87 Difference]: Start difference. First operand 1975 states and 8000 transitions. Second operand 6 states. [2020-04-18 07:48:13,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:13,829 INFO L93 Difference]: Finished difference Result 1655 states and 6592 transitions. [2020-04-18 07:48:13,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:48:13,830 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-04-18 07:48:13,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:48:13,835 INFO L225 Difference]: With dead ends: 1655 [2020-04-18 07:48:13,835 INFO L226 Difference]: Without dead ends: 1655 [2020-04-18 07:48:13,836 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 07:48:13,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2020-04-18 07:48:13,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1335. [2020-04-18 07:48:13,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1335 states. [2020-04-18 07:48:13,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335 states to 1335 states and 5184 transitions. [2020-04-18 07:48:13,885 INFO L78 Accepts]: Start accepts. Automaton has 1335 states and 5184 transitions. Word has length 18 [2020-04-18 07:48:13,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:48:13,885 INFO L479 AbstractCegarLoop]: Abstraction has 1335 states and 5184 transitions. [2020-04-18 07:48:13,885 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-18 07:48:13,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 5184 transitions. [2020-04-18 07:48:13,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 07:48:13,888 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:13,888 INFO L425 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:48:13,888 INFO L427 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:48:13,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:13,889 INFO L82 PathProgramCache]: Analyzing trace with hash -285687237, now seen corresponding path program 1 times [2020-04-18 07:48:13,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:13,889 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [716692262] [2020-04-18 07:48:13,890 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:13,891 INFO L259 McrAutomatonBuilder]: Finished intersection with 19 states and 18 transitions. [2020-04-18 07:48:13,891 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-04-18 07:48:13,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 07:48:13,891 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:13,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:13,892 INFO L82 PathProgramCache]: Analyzing trace with hash -285687237, now seen corresponding path program 2 times [2020-04-18 07:48:13,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:13,892 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103729404] [2020-04-18 07:48:13,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:13,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 07:48:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 07:48:13,911 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-04-18 07:48:13,911 INFO L174 FreeRefinementEngine]: Strategy MCR found a feasible trace [2020-04-18 07:48:13,911 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-04-18 07:48:13,912 WARN L363 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2020-04-18 07:48:13,912 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2020-04-18 07:48:13,921 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,922 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,922 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,922 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,922 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,922 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,922 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,923 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,923 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,923 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,923 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,923 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,923 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,924 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,924 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,924 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,924 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,924 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,924 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,924 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,925 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,925 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,925 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,925 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,925 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,925 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,925 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,926 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,926 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,926 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,926 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,926 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,926 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,926 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,927 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,927 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,927 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,927 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,927 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,927 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,927 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,927 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,928 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,928 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,928 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,928 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,928 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,928 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,928 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,929 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,929 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,929 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,929 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,929 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,929 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,929 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,930 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,930 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,930 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,930 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,930 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,930 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,930 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,931 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,931 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,931 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,931 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,931 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,931 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,931 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,932 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,932 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,932 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,932 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,932 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,932 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,932 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,933 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,933 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,933 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,933 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,933 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,933 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,933 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,934 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,934 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,934 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,934 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,934 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,934 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,936 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,936 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,936 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,936 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,937 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,937 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,938 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,938 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,938 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,938 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,938 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,939 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,940 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,940 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,940 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,940 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,940 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,941 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,942 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,942 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,942 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,942 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,942 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,942 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,943 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,944 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,944 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,944 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,944 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,944 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:13,945 INFO L251 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-04-18 07:48:13,945 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 07:48:13,946 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 07:48:13,946 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 07:48:13,946 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 07:48:13,946 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 07:48:13,946 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 07:48:13,946 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 07:48:13,946 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 07:48:13,947 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 98 transitions, 256 flow [2020-04-18 07:48:13,947 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 104 places, 98 transitions, 256 flow [2020-04-18 07:48:13,963 INFO L129 PetriNetUnfolder]: 13/151 cut-off events. [2020-04-18 07:48:13,964 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2020-04-18 07:48:13,965 INFO L80 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 151 events. 13/151 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 434 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 151. Up to 14 conditions per place. [2020-04-18 07:48:13,972 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 104 places, 98 transitions, 256 flow [2020-04-18 07:48:13,987 INFO L129 PetriNetUnfolder]: 13/151 cut-off events. [2020-04-18 07:48:13,988 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2020-04-18 07:48:13,989 INFO L80 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 151 events. 13/151 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 434 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 151. Up to 14 conditions per place. [2020-04-18 07:48:13,996 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 6120 [2020-04-18 07:48:13,996 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-04-18 07:48:15,336 INFO L206 etLargeBlockEncoding]: Checked pairs total: 10327 [2020-04-18 07:48:15,336 INFO L214 etLargeBlockEncoding]: Total number of compositions: 89 [2020-04-18 07:48:15,336 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 33 transitions, 126 flow [2020-04-18 07:48:19,834 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25940 states. [2020-04-18 07:48:19,834 INFO L276 IsEmpty]: Start isEmpty. Operand 25940 states. [2020-04-18 07:48:19,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-04-18 07:48:19,834 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:19,834 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-04-18 07:48:19,835 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:48:19,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:19,835 INFO L82 PathProgramCache]: Analyzing trace with hash 862156483, now seen corresponding path program 1 times [2020-04-18 07:48:19,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:19,835 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [456966477] [2020-04-18 07:48:19,835 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:19,836 INFO L259 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-04-18 07:48:19,836 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2020-04-18 07:48:19,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-04-18 07:48:19,836 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:19,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:19,836 INFO L82 PathProgramCache]: Analyzing trace with hash 862156483, now seen corresponding path program 2 times [2020-04-18 07:48:19,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:19,836 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177156629] [2020-04-18 07:48:19,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:19,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:19,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:48:19,852 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177156629] [2020-04-18 07:48:19,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:19,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:48:19,853 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:19,853 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:19,853 INFO L259 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-04-18 07:48:19,853 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:19,857 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:48:19,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:19,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:19,858 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2020-04-18 07:48:19,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:19,860 INFO L93 Difference]: Finished difference Result 6 states and 5 transitions. [2020-04-18 07:48:19,860 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 5 transitions. [2020-04-18 07:48:19,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:48:19,861 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [456966477] [2020-04-18 07:48:19,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:48:19,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 07:48:19,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [456966477] [2020-04-18 07:48:19,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 07:48:19,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:48:19,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:19,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:19,862 INFO L87 Difference]: Start difference. First operand 25940 states. Second operand 3 states. [2020-04-18 07:48:20,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:20,280 INFO L93 Difference]: Finished difference Result 30660 states and 153869 transitions. [2020-04-18 07:48:20,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:48:20,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-04-18 07:48:20,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:48:20,445 INFO L225 Difference]: With dead ends: 30660 [2020-04-18 07:48:20,445 INFO L226 Difference]: Without dead ends: 30660 [2020-04-18 07:48:20,446 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:22,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30660 states. [2020-04-18 07:48:23,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30660 to 25560. [2020-04-18 07:48:23,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25560 states. [2020-04-18 07:48:23,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25560 states to 25560 states and 131665 transitions. [2020-04-18 07:48:23,851 INFO L78 Accepts]: Start accepts. Automaton has 25560 states and 131665 transitions. Word has length 5 [2020-04-18 07:48:23,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:48:23,851 INFO L479 AbstractCegarLoop]: Abstraction has 25560 states and 131665 transitions. [2020-04-18 07:48:23,851 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 07:48:23,851 INFO L276 IsEmpty]: Start isEmpty. Operand 25560 states and 131665 transitions. [2020-04-18 07:48:23,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-04-18 07:48:23,852 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:23,852 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2020-04-18 07:48:23,852 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:48:23,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:23,852 INFO L82 PathProgramCache]: Analyzing trace with hash 422134040, now seen corresponding path program 1 times [2020-04-18 07:48:23,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:23,852 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1120985092] [2020-04-18 07:48:23,853 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:23,853 INFO L259 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-04-18 07:48:23,853 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-04-18 07:48:23,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-04-18 07:48:23,853 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:23,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:23,853 INFO L82 PathProgramCache]: Analyzing trace with hash 422134040, now seen corresponding path program 2 times [2020-04-18 07:48:23,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:23,854 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820080766] [2020-04-18 07:48:23,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:23,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 07:48:23,870 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820080766] [2020-04-18 07:48:23,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:23,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:48:23,871 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:23,871 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:23,872 INFO L259 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-04-18 07:48:23,872 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:23,875 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:48:23,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:23,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:23,876 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2020-04-18 07:48:23,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:23,878 INFO L93 Difference]: Finished difference Result 9 states and 8 transitions. [2020-04-18 07:48:23,878 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 8 transitions. [2020-04-18 07:48:23,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:48:23,879 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1120985092] [2020-04-18 07:48:23,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:48:23,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 07:48:23,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1120985092] [2020-04-18 07:48:23,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 07:48:23,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:48:23,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:23,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:23,880 INFO L87 Difference]: Start difference. First operand 25560 states and 131665 transitions. Second operand 3 states. [2020-04-18 07:48:24,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:24,285 INFO L93 Difference]: Finished difference Result 36927 states and 186525 transitions. [2020-04-18 07:48:24,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:48:24,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-04-18 07:48:24,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:48:24,477 INFO L225 Difference]: With dead ends: 36927 [2020-04-18 07:48:24,477 INFO L226 Difference]: Without dead ends: 36927 [2020-04-18 07:48:24,477 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:27,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36927 states. [2020-04-18 07:48:28,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36927 to 30580. [2020-04-18 07:48:28,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30580 states. [2020-04-18 07:48:28,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30580 states to 30580 states and 158564 transitions. [2020-04-18 07:48:28,343 INFO L78 Accepts]: Start accepts. Automaton has 30580 states and 158564 transitions. Word has length 8 [2020-04-18 07:48:28,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:48:28,343 INFO L479 AbstractCegarLoop]: Abstraction has 30580 states and 158564 transitions. [2020-04-18 07:48:28,343 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 07:48:28,343 INFO L276 IsEmpty]: Start isEmpty. Operand 30580 states and 158564 transitions. [2020-04-18 07:48:28,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 07:48:28,343 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:28,343 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:48:28,344 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:48:28,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:28,344 INFO L82 PathProgramCache]: Analyzing trace with hash 203971322, now seen corresponding path program 1 times [2020-04-18 07:48:28,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:28,344 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1092819405] [2020-04-18 07:48:28,344 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:28,345 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 25 transitions. [2020-04-18 07:48:28,345 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-04-18 07:48:28,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 07:48:28,345 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:28,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:28,346 INFO L82 PathProgramCache]: Analyzing trace with hash 204004172, now seen corresponding path program 2 times [2020-04-18 07:48:28,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:28,346 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474195836] [2020-04-18 07:48:28,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:28,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-04-18 07:48:28,362 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474195836] [2020-04-18 07:48:28,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:28,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:48:28,362 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:28,363 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:28,364 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 24 transitions. [2020-04-18 07:48:28,364 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:28,368 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 07:48:28,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:28,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:28,368 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2020-04-18 07:48:28,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:28,374 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2020-04-18 07:48:28,374 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2020-04-18 07:48:28,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 07:48:28,374 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:48:28,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:28,375 INFO L82 PathProgramCache]: Analyzing trace with hash 203971322, now seen corresponding path program 3 times [2020-04-18 07:48:28,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:28,375 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046658098] [2020-04-18 07:48:28,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:28,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:28,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-04-18 07:48:28,392 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046658098] [2020-04-18 07:48:28,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:28,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:48:28,393 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:28,393 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:28,394 INFO L259 McrAutomatonBuilder]: Finished intersection with 14 states and 16 transitions. [2020-04-18 07:48:28,394 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:28,398 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 07:48:28,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 07:48:28,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 07:48:28,399 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand 4 states. [2020-04-18 07:48:28,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:28,409 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2020-04-18 07:48:28,409 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2020-04-18 07:48:28,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:48:28,410 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1092819405] [2020-04-18 07:48:28,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:48:28,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 07:48:28,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1092819405] [2020-04-18 07:48:28,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-04-18 07:48:28,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:48:28,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 07:48:28,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 07:48:28,411 INFO L87 Difference]: Start difference. First operand 30580 states and 158564 transitions. Second operand 4 states. [2020-04-18 07:48:28,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:28,597 INFO L93 Difference]: Finished difference Result 24233 states and 124256 transitions. [2020-04-18 07:48:28,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:48:28,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-04-18 07:48:28,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:48:28,683 INFO L225 Difference]: With dead ends: 24233 [2020-04-18 07:48:28,684 INFO L226 Difference]: Without dead ends: 24233 [2020-04-18 07:48:28,684 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 07:48:29,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24233 states. [2020-04-18 07:48:30,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24233 to 19165. [2020-04-18 07:48:30,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19165 states. [2020-04-18 07:48:30,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19165 states to 19165 states and 97114 transitions. [2020-04-18 07:48:30,273 INFO L78 Accepts]: Start accepts. Automaton has 19165 states and 97114 transitions. Word has length 9 [2020-04-18 07:48:30,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:48:30,273 INFO L479 AbstractCegarLoop]: Abstraction has 19165 states and 97114 transitions. [2020-04-18 07:48:30,273 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-04-18 07:48:30,273 INFO L276 IsEmpty]: Start isEmpty. Operand 19165 states and 97114 transitions. [2020-04-18 07:48:30,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 07:48:30,273 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:30,273 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:48:30,274 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:48:30,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:30,274 INFO L82 PathProgramCache]: Analyzing trace with hash 201256629, now seen corresponding path program 1 times [2020-04-18 07:48:30,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:30,274 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1354768739] [2020-04-18 07:48:30,275 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:30,275 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 19 transitions. [2020-04-18 07:48:30,275 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2020-04-18 07:48:30,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 07:48:30,275 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:30,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:30,275 INFO L82 PathProgramCache]: Analyzing trace with hash 203971299, now seen corresponding path program 2 times [2020-04-18 07:48:30,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:30,276 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539188955] [2020-04-18 07:48:30,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:30,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 07:48:30,289 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539188955] [2020-04-18 07:48:30,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:30,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:48:30,289 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:30,290 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:30,291 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 18 transitions. [2020-04-18 07:48:30,291 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:30,310 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 07:48:30,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 07:48:30,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 07:48:30,311 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 5 states. [2020-04-18 07:48:30,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:30,323 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2020-04-18 07:48:30,323 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2020-04-18 07:48:30,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 07:48:30,324 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:48:30,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:30,324 INFO L82 PathProgramCache]: Analyzing trace with hash 201256629, now seen corresponding path program 3 times [2020-04-18 07:48:30,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:30,324 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283785225] [2020-04-18 07:48:30,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:30,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 07:48:30,342 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283785225] [2020-04-18 07:48:30,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:30,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:48:30,342 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:30,343 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:30,344 INFO L259 McrAutomatonBuilder]: Finished intersection with 14 states and 16 transitions. [2020-04-18 07:48:30,344 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:30,350 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:48:30,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 07:48:30,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-04-18 07:48:30,351 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 4 states. [2020-04-18 07:48:30,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:30,361 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2020-04-18 07:48:30,361 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2020-04-18 07:48:30,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:48:30,361 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1354768739] [2020-04-18 07:48:30,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:48:30,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 07:48:30,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1354768739] [2020-04-18 07:48:30,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-18 07:48:30,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:48:30,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 07:48:30,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 07:48:30,363 INFO L87 Difference]: Start difference. First operand 19165 states and 97114 transitions. Second operand 6 states. [2020-04-18 07:48:30,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:30,517 INFO L93 Difference]: Finished difference Result 15344 states and 76976 transitions. [2020-04-18 07:48:30,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:48:30,517 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-04-18 07:48:30,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:48:30,575 INFO L225 Difference]: With dead ends: 15344 [2020-04-18 07:48:30,575 INFO L226 Difference]: Without dead ends: 15344 [2020-04-18 07:48:30,576 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 07:48:32,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15344 states. [2020-04-18 07:48:32,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15344 to 11523. [2020-04-18 07:48:32,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11523 states. [2020-04-18 07:48:32,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11523 states to 11523 states and 56838 transitions. [2020-04-18 07:48:32,523 INFO L78 Accepts]: Start accepts. Automaton has 11523 states and 56838 transitions. Word has length 9 [2020-04-18 07:48:32,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:48:32,524 INFO L479 AbstractCegarLoop]: Abstraction has 11523 states and 56838 transitions. [2020-04-18 07:48:32,524 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-18 07:48:32,524 INFO L276 IsEmpty]: Start isEmpty. Operand 11523 states and 56838 transitions. [2020-04-18 07:48:32,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-04-18 07:48:32,524 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:32,524 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2020-04-18 07:48:32,524 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:48:32,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:32,525 INFO L82 PathProgramCache]: Analyzing trace with hash -40974610, now seen corresponding path program 1 times [2020-04-18 07:48:32,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:32,525 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [2022281124] [2020-04-18 07:48:32,525 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:32,526 INFO L259 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-04-18 07:48:32,526 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2020-04-18 07:48:32,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-04-18 07:48:32,526 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:32,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:32,527 INFO L82 PathProgramCache]: Analyzing trace with hash -40974610, now seen corresponding path program 2 times [2020-04-18 07:48:32,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:32,527 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639752091] [2020-04-18 07:48:32,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:32,539 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-04-18 07:48:32,540 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639752091] [2020-04-18 07:48:32,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:32,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:48:32,541 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:32,541 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:32,542 INFO L259 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-04-18 07:48:32,542 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:32,545 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:48:32,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:32,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:32,545 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 3 states. [2020-04-18 07:48:32,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:32,548 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2020-04-18 07:48:32,548 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2020-04-18 07:48:32,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:48:32,549 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [2022281124] [2020-04-18 07:48:32,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:48:32,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 07:48:32,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [2022281124] [2020-04-18 07:48:32,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 07:48:32,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:48:32,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:32,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:32,550 INFO L87 Difference]: Start difference. First operand 11523 states and 56838 transitions. Second operand 3 states. [2020-04-18 07:48:32,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:32,737 INFO L93 Difference]: Finished difference Result 17226 states and 83578 transitions. [2020-04-18 07:48:32,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:48:32,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-04-18 07:48:32,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:48:32,795 INFO L225 Difference]: With dead ends: 17226 [2020-04-18 07:48:32,795 INFO L226 Difference]: Without dead ends: 17226 [2020-04-18 07:48:32,796 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:33,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17226 states. [2020-04-18 07:48:33,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17226 to 14368. [2020-04-18 07:48:33,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14368 states. [2020-04-18 07:48:33,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14368 states to 14368 states and 71601 transitions. [2020-04-18 07:48:33,765 INFO L78 Accepts]: Start accepts. Automaton has 14368 states and 71601 transitions. Word has length 11 [2020-04-18 07:48:33,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:48:33,765 INFO L479 AbstractCegarLoop]: Abstraction has 14368 states and 71601 transitions. [2020-04-18 07:48:33,765 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 07:48:33,765 INFO L276 IsEmpty]: Start isEmpty. Operand 14368 states and 71601 transitions. [2020-04-18 07:48:33,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-04-18 07:48:33,765 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:33,766 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:48:33,766 INFO L427 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:48:33,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:33,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1270210238, now seen corresponding path program 1 times [2020-04-18 07:48:33,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:33,766 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1230458917] [2020-04-18 07:48:33,766 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:33,767 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 22 transitions. [2020-04-18 07:48:33,767 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-04-18 07:48:33,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-04-18 07:48:33,767 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:33,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:33,767 INFO L82 PathProgramCache]: Analyzing trace with hash -314645844, now seen corresponding path program 2 times [2020-04-18 07:48:33,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:33,768 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133875438] [2020-04-18 07:48:33,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:33,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:33,798 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-04-18 07:48:33,799 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133875438] [2020-04-18 07:48:33,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:33,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:48:33,799 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:33,800 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:33,802 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 21 transitions. [2020-04-18 07:48:33,802 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:33,851 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 07:48:33,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 07:48:33,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 07:48:33,852 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 5 states. [2020-04-18 07:48:33,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:33,870 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2020-04-18 07:48:33,871 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-04-18 07:48:33,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-04-18 07:48:33,871 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:48:33,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:33,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1270210238, now seen corresponding path program 3 times [2020-04-18 07:48:33,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:33,872 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138128863] [2020-04-18 07:48:33,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:33,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:33,890 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-04-18 07:48:33,891 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138128863] [2020-04-18 07:48:33,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:33,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:48:33,892 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:33,892 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:33,893 INFO L259 McrAutomatonBuilder]: Finished intersection with 17 states and 19 transitions. [2020-04-18 07:48:33,894 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:33,901 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:48:33,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 07:48:33,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-04-18 07:48:33,901 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 4 states. [2020-04-18 07:48:33,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:33,911 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2020-04-18 07:48:33,911 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-04-18 07:48:33,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:48:33,912 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1230458917] [2020-04-18 07:48:33,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:48:33,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 07:48:33,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1230458917] [2020-04-18 07:48:33,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-18 07:48:33,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:48:33,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 07:48:33,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 07:48:33,913 INFO L87 Difference]: Start difference. First operand 14368 states and 71601 transitions. Second operand 6 states. [2020-04-18 07:48:34,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:34,037 INFO L93 Difference]: Finished difference Result 11510 states and 56766 transitions. [2020-04-18 07:48:34,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:48:34,038 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-04-18 07:48:34,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:48:34,072 INFO L225 Difference]: With dead ends: 11510 [2020-04-18 07:48:34,072 INFO L226 Difference]: Without dead ends: 11510 [2020-04-18 07:48:34,072 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 07:48:34,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11510 states. [2020-04-18 07:48:34,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11510 to 8652. [2020-04-18 07:48:34,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8652 states. [2020-04-18 07:48:34,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8652 states to 8652 states and 41931 transitions. [2020-04-18 07:48:34,416 INFO L78 Accepts]: Start accepts. Automaton has 8652 states and 41931 transitions. Word has length 12 [2020-04-18 07:48:34,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:48:34,416 INFO L479 AbstractCegarLoop]: Abstraction has 8652 states and 41931 transitions. [2020-04-18 07:48:34,416 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-18 07:48:34,416 INFO L276 IsEmpty]: Start isEmpty. Operand 8652 states and 41931 transitions. [2020-04-18 07:48:34,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 07:48:34,417 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:34,417 INFO L425 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:48:34,417 INFO L427 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:48:34,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:34,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1064251902, now seen corresponding path program 1 times [2020-04-18 07:48:34,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:34,418 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1352515849] [2020-04-18 07:48:34,418 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:34,418 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 14 transitions. [2020-04-18 07:48:34,419 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2020-04-18 07:48:34,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 07:48:34,419 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:34,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:34,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1064251902, now seen corresponding path program 2 times [2020-04-18 07:48:34,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:34,419 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686274971] [2020-04-18 07:48:34,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:34,431 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-04-18 07:48:34,432 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686274971] [2020-04-18 07:48:34,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:34,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:48:34,432 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:34,433 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:34,434 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 14 transitions. [2020-04-18 07:48:34,434 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:34,437 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:48:34,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:34,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:34,438 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2020-04-18 07:48:34,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:34,440 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2020-04-18 07:48:34,440 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2020-04-18 07:48:34,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:48:34,440 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1352515849] [2020-04-18 07:48:34,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:48:34,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 07:48:34,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1352515849] [2020-04-18 07:48:34,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 07:48:34,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:48:34,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:34,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:34,442 INFO L87 Difference]: Start difference. First operand 8652 states and 41931 transitions. Second operand 3 states. [2020-04-18 07:48:34,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:34,563 INFO L93 Difference]: Finished difference Result 12888 states and 61498 transitions. [2020-04-18 07:48:34,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:48:34,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-04-18 07:48:34,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:48:34,612 INFO L225 Difference]: With dead ends: 12888 [2020-04-18 07:48:34,612 INFO L226 Difference]: Without dead ends: 12888 [2020-04-18 07:48:34,613 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:34,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12888 states. [2020-04-18 07:48:35,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12888 to 10765. [2020-04-18 07:48:35,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10765 states. [2020-04-18 07:48:35,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10765 states to 10765 states and 52746 transitions. [2020-04-18 07:48:35,065 INFO L78 Accepts]: Start accepts. Automaton has 10765 states and 52746 transitions. Word has length 14 [2020-04-18 07:48:35,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:48:35,065 INFO L479 AbstractCegarLoop]: Abstraction has 10765 states and 52746 transitions. [2020-04-18 07:48:35,065 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 07:48:35,065 INFO L276 IsEmpty]: Start isEmpty. Operand 10765 states and 52746 transitions. [2020-04-18 07:48:35,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 07:48:35,066 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:35,066 INFO L425 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:48:35,066 INFO L427 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:48:35,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:35,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1367932408, now seen corresponding path program 1 times [2020-04-18 07:48:35,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:35,067 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [458789718] [2020-04-18 07:48:35,068 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:35,068 INFO L259 McrAutomatonBuilder]: Finished intersection with 24 states and 31 transitions. [2020-04-18 07:48:35,068 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-04-18 07:48:35,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 07:48:35,069 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:35,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:35,069 INFO L82 PathProgramCache]: Analyzing trace with hash 2138911108, now seen corresponding path program 2 times [2020-04-18 07:48:35,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:35,070 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066722063] [2020-04-18 07:48:35,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:35,083 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-04-18 07:48:35,084 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066722063] [2020-04-18 07:48:35,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:35,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:48:35,084 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:35,085 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:35,087 INFO L259 McrAutomatonBuilder]: Finished intersection with 24 states and 30 transitions. [2020-04-18 07:48:35,087 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:35,105 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 07:48:35,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 07:48:35,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 07:48:35,106 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-04-18 07:48:35,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:35,121 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2020-04-18 07:48:35,121 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2020-04-18 07:48:35,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 07:48:35,122 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:48:35,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:35,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1367932408, now seen corresponding path program 3 times [2020-04-18 07:48:35,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:35,122 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795704755] [2020-04-18 07:48:35,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:35,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:35,142 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-04-18 07:48:35,142 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795704755] [2020-04-18 07:48:35,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:35,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:48:35,143 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:35,144 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:35,145 INFO L259 McrAutomatonBuilder]: Finished intersection with 23 states and 28 transitions. [2020-04-18 07:48:35,145 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:35,153 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:48:35,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 07:48:35,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-04-18 07:48:35,154 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 4 states. [2020-04-18 07:48:35,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:35,164 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2020-04-18 07:48:35,164 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2020-04-18 07:48:35,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:48:35,165 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [458789718] [2020-04-18 07:48:35,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:48:35,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 07:48:35,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [458789718] [2020-04-18 07:48:35,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-18 07:48:35,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:48:35,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 07:48:35,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 07:48:35,166 INFO L87 Difference]: Start difference. First operand 10765 states and 52746 transitions. Second operand 6 states. [2020-04-18 07:48:35,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:35,280 INFO L93 Difference]: Finished difference Result 8642 states and 41871 transitions. [2020-04-18 07:48:35,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:48:35,281 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-04-18 07:48:35,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:48:35,314 INFO L225 Difference]: With dead ends: 8642 [2020-04-18 07:48:35,315 INFO L226 Difference]: Without dead ends: 8642 [2020-04-18 07:48:35,315 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 07:48:35,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8642 states. [2020-04-18 07:48:35,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8642 to 6519. [2020-04-18 07:48:35,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6519 states. [2020-04-18 07:48:35,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6519 states to 6519 states and 30996 transitions. [2020-04-18 07:48:35,550 INFO L78 Accepts]: Start accepts. Automaton has 6519 states and 30996 transitions. Word has length 15 [2020-04-18 07:48:35,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:48:35,550 INFO L479 AbstractCegarLoop]: Abstraction has 6519 states and 30996 transitions. [2020-04-18 07:48:35,551 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-18 07:48:35,551 INFO L276 IsEmpty]: Start isEmpty. Operand 6519 states and 30996 transitions. [2020-04-18 07:48:35,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 07:48:35,552 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:35,552 INFO L425 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:48:35,552 INFO L427 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:48:35,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:35,552 INFO L82 PathProgramCache]: Analyzing trace with hash 152749525, now seen corresponding path program 1 times [2020-04-18 07:48:35,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:35,553 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1196513940] [2020-04-18 07:48:35,553 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:35,554 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 17 transitions. [2020-04-18 07:48:35,554 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-04-18 07:48:35,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 07:48:35,554 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:35,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:35,555 INFO L82 PathProgramCache]: Analyzing trace with hash 152749525, now seen corresponding path program 2 times [2020-04-18 07:48:35,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:35,555 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063054621] [2020-04-18 07:48:35,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:35,567 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-04-18 07:48:35,567 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063054621] [2020-04-18 07:48:35,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:35,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:48:35,568 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:35,569 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:35,570 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 17 transitions. [2020-04-18 07:48:35,570 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:35,810 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2020-04-18 07:48:35,811 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:48:35,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:35,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:35,811 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2020-04-18 07:48:35,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:35,814 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2020-04-18 07:48:35,815 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2020-04-18 07:48:35,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:48:35,815 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1196513940] [2020-04-18 07:48:35,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:48:35,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 07:48:35,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1196513940] [2020-04-18 07:48:35,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 07:48:35,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:48:35,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:35,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:35,816 INFO L87 Difference]: Start difference. First operand 6519 states and 30996 transitions. Second operand 3 states. [2020-04-18 07:48:35,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:35,916 INFO L93 Difference]: Finished difference Result 9576 states and 44989 transitions. [2020-04-18 07:48:35,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:48:35,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-04-18 07:48:35,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:48:35,950 INFO L225 Difference]: With dead ends: 9576 [2020-04-18 07:48:35,951 INFO L226 Difference]: Without dead ends: 9576 [2020-04-18 07:48:35,951 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:36,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9576 states. [2020-04-18 07:48:36,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9576 to 8044. [2020-04-18 07:48:36,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8044 states. [2020-04-18 07:48:36,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8044 states to 8044 states and 38736 transitions. [2020-04-18 07:48:36,222 INFO L78 Accepts]: Start accepts. Automaton has 8044 states and 38736 transitions. Word has length 17 [2020-04-18 07:48:36,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:48:36,223 INFO L479 AbstractCegarLoop]: Abstraction has 8044 states and 38736 transitions. [2020-04-18 07:48:36,223 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 07:48:36,223 INFO L276 IsEmpty]: Start isEmpty. Operand 8044 states and 38736 transitions. [2020-04-18 07:48:36,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 07:48:36,224 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:36,224 INFO L425 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:48:36,224 INFO L427 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:48:36,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:36,224 INFO L82 PathProgramCache]: Analyzing trace with hash 440270196, now seen corresponding path program 1 times [2020-04-18 07:48:36,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:36,225 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [871115143] [2020-04-18 07:48:36,225 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:36,225 INFO L259 McrAutomatonBuilder]: Finished intersection with 24 states and 28 transitions. [2020-04-18 07:48:36,226 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-04-18 07:48:36,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 07:48:36,226 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:36,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:36,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1252627610, now seen corresponding path program 2 times [2020-04-18 07:48:36,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:36,226 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116836705] [2020-04-18 07:48:36,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:36,241 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-04-18 07:48:36,241 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116836705] [2020-04-18 07:48:36,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:36,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:48:36,242 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:36,243 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:36,245 INFO L259 McrAutomatonBuilder]: Finished intersection with 24 states and 27 transitions. [2020-04-18 07:48:36,245 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:36,274 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 07:48:36,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 07:48:36,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 07:48:36,275 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-04-18 07:48:36,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:36,290 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2020-04-18 07:48:36,290 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2020-04-18 07:48:36,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 07:48:36,290 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:48:36,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:36,291 INFO L82 PathProgramCache]: Analyzing trace with hash 440270196, now seen corresponding path program 3 times [2020-04-18 07:48:36,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:36,291 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637395634] [2020-04-18 07:48:36,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:36,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:36,311 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-04-18 07:48:36,312 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637395634] [2020-04-18 07:48:36,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:36,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:48:36,312 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:36,314 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:36,315 INFO L259 McrAutomatonBuilder]: Finished intersection with 23 states and 25 transitions. [2020-04-18 07:48:36,315 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:36,324 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:48:36,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 07:48:36,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-04-18 07:48:36,325 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 4 states. [2020-04-18 07:48:36,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:36,335 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2020-04-18 07:48:36,336 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2020-04-18 07:48:36,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:48:36,336 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [871115143] [2020-04-18 07:48:36,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:48:36,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 07:48:36,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [871115143] [2020-04-18 07:48:36,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-18 07:48:36,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:48:36,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 07:48:36,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 07:48:36,337 INFO L87 Difference]: Start difference. First operand 8044 states and 38736 transitions. Second operand 6 states. [2020-04-18 07:48:36,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:36,429 INFO L93 Difference]: Finished difference Result 6512 states and 30951 transitions. [2020-04-18 07:48:36,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:48:36,430 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-04-18 07:48:36,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:48:36,452 INFO L225 Difference]: With dead ends: 6512 [2020-04-18 07:48:36,452 INFO L226 Difference]: Without dead ends: 6512 [2020-04-18 07:48:36,453 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 07:48:36,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6512 states. [2020-04-18 07:48:36,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6512 to 4980. [2020-04-18 07:48:36,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4980 states. [2020-04-18 07:48:36,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4980 states to 4980 states and 23166 transitions. [2020-04-18 07:48:36,622 INFO L78 Accepts]: Start accepts. Automaton has 4980 states and 23166 transitions. Word has length 18 [2020-04-18 07:48:36,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:48:36,622 INFO L479 AbstractCegarLoop]: Abstraction has 4980 states and 23166 transitions. [2020-04-18 07:48:36,623 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-18 07:48:36,623 INFO L276 IsEmpty]: Start isEmpty. Operand 4980 states and 23166 transitions. [2020-04-18 07:48:36,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-04-18 07:48:36,625 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:36,625 INFO L425 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:48:36,625 INFO L427 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:48:36,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:36,625 INFO L82 PathProgramCache]: Analyzing trace with hash 2026385382, now seen corresponding path program 1 times [2020-04-18 07:48:36,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:36,626 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [775319071] [2020-04-18 07:48:36,626 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:36,627 INFO L259 McrAutomatonBuilder]: Finished intersection with 21 states and 20 transitions. [2020-04-18 07:48:36,627 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-04-18 07:48:36,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-04-18 07:48:36,627 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:36,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:36,628 INFO L82 PathProgramCache]: Analyzing trace with hash 2026385382, now seen corresponding path program 2 times [2020-04-18 07:48:36,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:36,628 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007217234] [2020-04-18 07:48:36,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:36,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:36,641 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-04-18 07:48:36,641 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007217234] [2020-04-18 07:48:36,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:36,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:48:36,642 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:36,643 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:36,644 INFO L259 McrAutomatonBuilder]: Finished intersection with 21 states and 20 transitions. [2020-04-18 07:48:36,645 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:36,648 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:48:36,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:36,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:36,648 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2020-04-18 07:48:36,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:36,650 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2020-04-18 07:48:36,651 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2020-04-18 07:48:36,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:48:36,651 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [775319071] [2020-04-18 07:48:36,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:48:36,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 07:48:36,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [775319071] [2020-04-18 07:48:36,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 07:48:36,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:48:36,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:48:36,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:36,652 INFO L87 Difference]: Start difference. First operand 4980 states and 23166 transitions. Second operand 3 states. [2020-04-18 07:48:36,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:36,730 INFO L93 Difference]: Finished difference Result 6912 states and 31999 transitions. [2020-04-18 07:48:36,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:48:36,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-04-18 07:48:36,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:48:36,753 INFO L225 Difference]: With dead ends: 6912 [2020-04-18 07:48:36,754 INFO L226 Difference]: Without dead ends: 6912 [2020-04-18 07:48:36,754 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:48:36,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6912 states. [2020-04-18 07:48:36,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6912 to 5944. [2020-04-18 07:48:36,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5944 states. [2020-04-18 07:48:36,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5944 states to 5944 states and 28053 transitions. [2020-04-18 07:48:36,948 INFO L78 Accepts]: Start accepts. Automaton has 5944 states and 28053 transitions. Word has length 20 [2020-04-18 07:48:36,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:48:36,948 INFO L479 AbstractCegarLoop]: Abstraction has 5944 states and 28053 transitions. [2020-04-18 07:48:36,948 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 07:48:36,948 INFO L276 IsEmpty]: Start isEmpty. Operand 5944 states and 28053 transitions. [2020-04-18 07:48:36,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 07:48:36,951 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:36,951 INFO L425 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:48:36,951 INFO L427 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:48:36,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:36,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1606559931, now seen corresponding path program 1 times [2020-04-18 07:48:36,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:36,952 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [199048249] [2020-04-18 07:48:36,953 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:36,953 INFO L259 McrAutomatonBuilder]: Finished intersection with 30 states and 37 transitions. [2020-04-18 07:48:36,954 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-04-18 07:48:36,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 07:48:36,954 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:36,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:36,955 INFO L82 PathProgramCache]: Analyzing trace with hash -2106052863, now seen corresponding path program 2 times [2020-04-18 07:48:36,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:36,955 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001838898] [2020-04-18 07:48:36,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:36,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:36,974 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-04-18 07:48:36,974 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001838898] [2020-04-18 07:48:36,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:36,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:48:36,975 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:36,976 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:36,979 INFO L259 McrAutomatonBuilder]: Finished intersection with 30 states and 36 transitions. [2020-04-18 07:48:36,979 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:37,011 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 07:48:37,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 07:48:37,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 07:48:37,012 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 5 states. [2020-04-18 07:48:37,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:37,034 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2020-04-18 07:48:37,035 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2020-04-18 07:48:37,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 07:48:37,035 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:48:37,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:37,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1606559931, now seen corresponding path program 3 times [2020-04-18 07:48:37,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:37,036 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59654323] [2020-04-18 07:48:37,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:48:37,054 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-04-18 07:48:37,054 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59654323] [2020-04-18 07:48:37,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:48:37,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:48:37,055 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:48:37,056 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:37,059 INFO L259 McrAutomatonBuilder]: Finished intersection with 29 states and 34 transitions. [2020-04-18 07:48:37,059 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:48:37,065 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:48:37,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 07:48:37,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-04-18 07:48:37,066 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 4 states. [2020-04-18 07:48:37,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:37,076 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2020-04-18 07:48:37,077 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2020-04-18 07:48:37,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:48:37,077 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [199048249] [2020-04-18 07:48:37,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:48:37,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 07:48:37,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [199048249] [2020-04-18 07:48:37,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-18 07:48:37,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:48:37,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 07:48:37,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 07:48:37,078 INFO L87 Difference]: Start difference. First operand 5944 states and 28053 transitions. Second operand 6 states. [2020-04-18 07:48:37,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:48:37,152 INFO L93 Difference]: Finished difference Result 4976 states and 23139 transitions. [2020-04-18 07:48:37,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:48:37,152 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-04-18 07:48:37,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:48:37,168 INFO L225 Difference]: With dead ends: 4976 [2020-04-18 07:48:37,168 INFO L226 Difference]: Without dead ends: 4976 [2020-04-18 07:48:37,169 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 07:48:37,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4976 states. [2020-04-18 07:48:37,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4976 to 4008. [2020-04-18 07:48:37,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4008 states. [2020-04-18 07:48:37,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4008 states to 4008 states and 18225 transitions. [2020-04-18 07:48:37,303 INFO L78 Accepts]: Start accepts. Automaton has 4008 states and 18225 transitions. Word has length 21 [2020-04-18 07:48:37,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:48:37,303 INFO L479 AbstractCegarLoop]: Abstraction has 4008 states and 18225 transitions. [2020-04-18 07:48:37,303 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-18 07:48:37,303 INFO L276 IsEmpty]: Start isEmpty. Operand 4008 states and 18225 transitions. [2020-04-18 07:48:37,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 07:48:37,305 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:48:37,305 INFO L425 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:48:37,305 INFO L427 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:48:37,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:37,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1606739912, now seen corresponding path program 1 times [2020-04-18 07:48:37,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:48:37,305 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [631640393] [2020-04-18 07:48:37,306 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:48:37,307 INFO L259 McrAutomatonBuilder]: Finished intersection with 22 states and 21 transitions. [2020-04-18 07:48:37,307 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2020-04-18 07:48:37,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 07:48:37,307 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:48:37,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:48:37,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1606739912, now seen corresponding path program 2 times [2020-04-18 07:48:37,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:48:37,308 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951621009] [2020-04-18 07:48:37,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:48:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 07:48:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 07:48:37,324 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-04-18 07:48:37,324 INFO L174 FreeRefinementEngine]: Strategy MCR found a feasible trace [2020-04-18 07:48:37,324 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-04-18 07:48:37,325 WARN L363 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2020-04-18 07:48:37,325 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2020-04-18 07:48:37,335 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,336 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,336 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,336 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,336 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,336 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,336 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,336 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,339 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,339 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,339 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,339 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,340 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,340 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,340 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,340 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,340 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,340 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,340 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,341 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,341 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,341 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,341 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,341 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,341 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,341 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,342 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,342 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,342 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,344 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,344 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,344 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,344 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,345 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,345 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,345 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,345 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,345 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,345 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,346 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,346 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,346 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,346 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,346 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,346 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,346 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,347 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,347 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,347 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,347 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,347 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,347 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,348 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,348 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,348 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,348 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,348 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,348 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,348 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,348 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,349 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,349 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,349 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,349 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,349 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,349 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,349 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,349 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,350 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,350 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,350 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,350 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,350 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,350 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,350 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,351 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,351 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,351 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,351 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,351 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,351 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,351 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,351 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,352 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,352 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,352 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,352 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,352 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,352 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,352 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,352 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,353 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,353 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,353 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,353 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,353 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,353 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,353 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,354 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,354 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,354 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,354 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,354 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,354 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,365 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,365 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,365 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,365 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,365 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,365 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,368 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,368 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,369 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,369 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,369 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,369 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,370 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,370 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,370 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,370 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,370 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,371 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,372 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,372 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,372 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,372 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,372 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,372 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,373 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,373 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,373 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,374 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,374 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,374 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,375 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,375 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,375 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,375 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,375 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of7ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,375 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of7ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:48:37,376 INFO L251 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2020-04-18 07:48:37,377 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 07:48:37,377 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 07:48:37,377 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 07:48:37,377 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 07:48:37,377 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 07:48:37,377 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 07:48:37,377 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 07:48:37,377 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 07:48:37,378 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 111 transitions, 299 flow [2020-04-18 07:48:37,379 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 111 transitions, 299 flow [2020-04-18 07:48:37,402 INFO L129 PetriNetUnfolder]: 15/173 cut-off events. [2020-04-18 07:48:37,402 INFO L130 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2020-04-18 07:48:37,405 INFO L80 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 173 events. 15/173 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 517 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 182. Up to 16 conditions per place. [2020-04-18 07:48:37,423 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 111 transitions, 299 flow [2020-04-18 07:48:37,453 INFO L129 PetriNetUnfolder]: 15/173 cut-off events. [2020-04-18 07:48:37,453 INFO L130 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2020-04-18 07:48:37,456 INFO L80 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 173 events. 15/173 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 517 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 182. Up to 16 conditions per place. [2020-04-18 07:48:37,462 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 8232 [2020-04-18 07:48:37,463 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-04-18 07:48:39,001 INFO L206 etLargeBlockEncoding]: Checked pairs total: 13237 [2020-04-18 07:48:39,002 INFO L214 etLargeBlockEncoding]: Total number of compositions: 95 [2020-04-18 07:48:39,002 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 48 places, 34 transitions, 145 flow [2020-04-18 07:49:17,693 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 103764 states. [2020-04-18 07:49:17,693 INFO L276 IsEmpty]: Start isEmpty. Operand 103764 states. [2020-04-18 07:49:17,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-04-18 07:49:17,694 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:49:17,694 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-04-18 07:49:17,694 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:49:17,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:49:17,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1079248743, now seen corresponding path program 1 times [2020-04-18 07:49:17,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:49:17,695 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1261992123] [2020-04-18 07:49:17,695 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:49:17,695 INFO L259 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-04-18 07:49:17,696 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2020-04-18 07:49:17,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-04-18 07:49:17,696 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:49:17,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:49:17,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1079248743, now seen corresponding path program 2 times [2020-04-18 07:49:17,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:49:17,696 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205834371] [2020-04-18 07:49:17,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:49:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:49:17,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:49:17,723 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205834371] [2020-04-18 07:49:17,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:49:17,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:49:17,723 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:49:17,724 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:49:17,724 INFO L259 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-04-18 07:49:17,724 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:49:17,727 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:49:17,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:49:17,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:49:17,728 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2020-04-18 07:49:17,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:49:17,730 INFO L93 Difference]: Finished difference Result 6 states and 5 transitions. [2020-04-18 07:49:17,730 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 5 transitions. [2020-04-18 07:49:17,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:49:17,731 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1261992123] [2020-04-18 07:49:17,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:49:17,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 07:49:17,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1261992123] [2020-04-18 07:49:17,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 07:49:17,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:49:17,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:49:17,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:49:17,732 INFO L87 Difference]: Start difference. First operand 103764 states. Second operand 3 states. [2020-04-18 07:49:22,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:49:22,653 INFO L93 Difference]: Finished difference Result 122811 states and 708293 transitions. [2020-04-18 07:49:22,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:49:22,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-04-18 07:49:22,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:49:23,154 INFO L225 Difference]: With dead ends: 122811 [2020-04-18 07:49:23,154 INFO L226 Difference]: Without dead ends: 122811 [2020-04-18 07:49:23,154 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:49:32,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122811 states. [2020-04-18 07:49:35,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122811 to 102354. [2020-04-18 07:49:35,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102354 states. [2020-04-18 07:49:36,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102354 states to 102354 states and 603935 transitions. [2020-04-18 07:49:36,019 INFO L78 Accepts]: Start accepts. Automaton has 102354 states and 603935 transitions. Word has length 5 [2020-04-18 07:49:36,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:49:36,020 INFO L479 AbstractCegarLoop]: Abstraction has 102354 states and 603935 transitions. [2020-04-18 07:49:36,020 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 07:49:36,020 INFO L276 IsEmpty]: Start isEmpty. Operand 102354 states and 603935 transitions. [2020-04-18 07:49:36,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-04-18 07:49:36,020 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:49:36,020 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2020-04-18 07:49:36,020 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:49:36,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:49:36,021 INFO L82 PathProgramCache]: Analyzing trace with hash -423468189, now seen corresponding path program 1 times [2020-04-18 07:49:36,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:49:36,021 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1507582612] [2020-04-18 07:49:36,021 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:49:36,022 INFO L259 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-04-18 07:49:36,022 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-04-18 07:49:36,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-04-18 07:49:36,022 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:49:36,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:49:36,023 INFO L82 PathProgramCache]: Analyzing trace with hash -423468189, now seen corresponding path program 2 times [2020-04-18 07:49:36,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:49:36,023 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366364940] [2020-04-18 07:49:36,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:49:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:49:36,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 07:49:36,044 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366364940] [2020-04-18 07:49:36,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:49:36,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:49:36,045 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:49:36,045 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:49:36,046 INFO L259 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-04-18 07:49:36,046 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:49:36,048 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:49:36,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:49:36,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:49:36,049 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2020-04-18 07:49:36,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:49:36,052 INFO L93 Difference]: Finished difference Result 9 states and 8 transitions. [2020-04-18 07:49:36,052 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 8 transitions. [2020-04-18 07:49:36,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:49:36,052 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1507582612] [2020-04-18 07:49:36,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:49:36,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 07:49:36,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1507582612] [2020-04-18 07:49:36,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 07:49:36,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:49:36,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:49:36,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:49:36,054 INFO L87 Difference]: Start difference. First operand 102354 states and 603935 transitions. Second operand 3 states. [2020-04-18 07:49:43,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:49:43,108 INFO L93 Difference]: Finished difference Result 148254 states and 859795 transitions. [2020-04-18 07:49:43,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:49:43,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-04-18 07:49:43,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:49:43,714 INFO L225 Difference]: With dead ends: 148254 [2020-04-18 07:49:43,715 INFO L226 Difference]: Without dead ends: 148254 [2020-04-18 07:49:43,715 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:49:59,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148254 states. [2020-04-18 07:50:02,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148254 to 122716. [2020-04-18 07:50:02,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122716 states. [2020-04-18 07:50:04,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122716 states to 122716 states and 728220 transitions. [2020-04-18 07:50:04,164 INFO L78 Accepts]: Start accepts. Automaton has 122716 states and 728220 transitions. Word has length 8 [2020-04-18 07:50:04,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:50:04,164 INFO L479 AbstractCegarLoop]: Abstraction has 122716 states and 728220 transitions. [2020-04-18 07:50:04,164 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 07:50:04,164 INFO L276 IsEmpty]: Start isEmpty. Operand 122716 states and 728220 transitions. [2020-04-18 07:50:04,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 07:50:04,165 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:50:04,165 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:50:04,165 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:50:04,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:50:04,165 INFO L82 PathProgramCache]: Analyzing trace with hash -242594376, now seen corresponding path program 1 times [2020-04-18 07:50:04,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:50:04,165 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [734937408] [2020-04-18 07:50:04,165 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:50:04,166 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 25 transitions. [2020-04-18 07:50:04,166 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-04-18 07:50:04,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 07:50:04,166 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:50:04,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:50:04,166 INFO L82 PathProgramCache]: Analyzing trace with hash -242595696, now seen corresponding path program 2 times [2020-04-18 07:50:04,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:50:04,167 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962847912] [2020-04-18 07:50:04,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:50:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:50:04,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 07:50:04,178 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962847912] [2020-04-18 07:50:04,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:50:04,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:50:04,179 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:50:04,179 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:50:04,180 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 24 transitions. [2020-04-18 07:50:04,180 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:50:04,184 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 6 times. [2020-04-18 07:50:04,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:50:04,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:50:04,185 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2020-04-18 07:50:04,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:50:04,190 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2020-04-18 07:50:04,190 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2020-04-18 07:50:04,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 07:50:04,190 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:50:04,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:50:04,191 INFO L82 PathProgramCache]: Analyzing trace with hash -242594376, now seen corresponding path program 3 times [2020-04-18 07:50:04,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:50:04,191 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421896582] [2020-04-18 07:50:04,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:50:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:50:04,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 07:50:04,206 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421896582] [2020-04-18 07:50:04,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:50:04,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:50:04,207 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:50:04,208 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:50:04,209 INFO L259 McrAutomatonBuilder]: Finished intersection with 14 states and 16 transitions. [2020-04-18 07:50:04,209 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:50:04,213 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 07:50:04,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 07:50:04,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 07:50:04,214 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand 4 states. [2020-04-18 07:50:04,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:50:04,224 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2020-04-18 07:50:04,224 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2020-04-18 07:50:04,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:50:04,224 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [734937408] [2020-04-18 07:50:04,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:50:04,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 07:50:04,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [734937408] [2020-04-18 07:50:04,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-04-18 07:50:04,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:50:04,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 07:50:04,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 07:50:04,225 INFO L87 Difference]: Start difference. First operand 122716 states and 728220 transitions. Second operand 4 states. [2020-04-18 07:50:04,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:50:04,960 INFO L93 Difference]: Finished difference Result 97178 states and 571107 transitions. [2020-04-18 07:50:04,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:50:04,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-04-18 07:50:04,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:50:05,381 INFO L225 Difference]: With dead ends: 97178 [2020-04-18 07:50:05,381 INFO L226 Difference]: Without dead ends: 97178 [2020-04-18 07:50:05,381 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 07:50:17,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97178 states. [2020-04-18 07:50:19,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97178 to 76759. [2020-04-18 07:50:19,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76759 states. [2020-04-18 07:50:19,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76759 states to 76759 states and 446504 transitions. [2020-04-18 07:50:19,832 INFO L78 Accepts]: Start accepts. Automaton has 76759 states and 446504 transitions. Word has length 9 [2020-04-18 07:50:19,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:50:19,832 INFO L479 AbstractCegarLoop]: Abstraction has 76759 states and 446504 transitions. [2020-04-18 07:50:19,832 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-04-18 07:50:19,832 INFO L276 IsEmpty]: Start isEmpty. Operand 76759 states and 446504 transitions. [2020-04-18 07:50:19,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 07:50:19,833 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:50:19,833 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:50:19,833 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:50:19,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:50:19,833 INFO L82 PathProgramCache]: Analyzing trace with hash -242609250, now seen corresponding path program 1 times [2020-04-18 07:50:19,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:50:19,833 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1670777710] [2020-04-18 07:50:19,834 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:50:19,834 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 19 transitions. [2020-04-18 07:50:19,834 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2020-04-18 07:50:19,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 07:50:19,834 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:50:19,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:50:19,834 INFO L82 PathProgramCache]: Analyzing trace with hash -242610870, now seen corresponding path program 2 times [2020-04-18 07:50:19,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:50:19,835 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10714909] [2020-04-18 07:50:19,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:50:19,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:50:19,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 07:50:19,849 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10714909] [2020-04-18 07:50:19,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:50:19,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:50:19,850 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:50:19,850 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:50:19,851 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 18 transitions. [2020-04-18 07:50:19,851 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:50:19,854 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:50:19,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:50:19,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:50:19,855 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2020-04-18 07:50:19,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:50:19,860 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2020-04-18 07:50:19,860 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2020-04-18 07:50:19,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-04-18 07:50:19,860 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:50:19,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:50:19,861 INFO L82 PathProgramCache]: Analyzing trace with hash -242609250, now seen corresponding path program 3 times [2020-04-18 07:50:19,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:50:19,861 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910375676] [2020-04-18 07:50:19,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:50:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:50:19,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 07:50:19,877 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910375676] [2020-04-18 07:50:19,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:50:19,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:50:19,878 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:50:19,878 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:50:19,880 INFO L259 McrAutomatonBuilder]: Finished intersection with 14 states and 16 transitions. [2020-04-18 07:50:19,881 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:50:19,885 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:50:19,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 07:50:19,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 07:50:19,886 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 4 states. [2020-04-18 07:50:19,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:50:19,896 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2020-04-18 07:50:19,896 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2020-04-18 07:50:19,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:50:19,897 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1670777710] [2020-04-18 07:50:19,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:50:19,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 07:50:19,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1670777710] [2020-04-18 07:50:19,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-04-18 07:50:19,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:50:19,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 07:50:19,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 07:50:19,898 INFO L87 Difference]: Start difference. First operand 76759 states and 446504 transitions. Second operand 4 states. [2020-04-18 07:50:20,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:50:20,544 INFO L93 Difference]: Finished difference Result 61421 states and 354199 transitions. [2020-04-18 07:50:20,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:50:20,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-04-18 07:50:20,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:50:20,773 INFO L225 Difference]: With dead ends: 61421 [2020-04-18 07:50:20,773 INFO L226 Difference]: Without dead ends: 61421 [2020-04-18 07:50:20,773 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 07:50:25,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61421 states. [2020-04-18 07:50:31,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61421 to 46083. [2020-04-18 07:50:31,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46083 states. [2020-04-18 07:50:31,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46083 states to 46083 states and 261894 transitions. [2020-04-18 07:50:31,804 INFO L78 Accepts]: Start accepts. Automaton has 46083 states and 261894 transitions. Word has length 9 [2020-04-18 07:50:31,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:50:31,805 INFO L479 AbstractCegarLoop]: Abstraction has 46083 states and 261894 transitions. [2020-04-18 07:50:31,805 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-04-18 07:50:31,805 INFO L276 IsEmpty]: Start isEmpty. Operand 46083 states and 261894 transitions. [2020-04-18 07:50:31,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-04-18 07:50:31,805 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:50:31,805 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2020-04-18 07:50:31,805 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:50:31,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:50:31,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1404864702, now seen corresponding path program 1 times [2020-04-18 07:50:31,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:50:31,806 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1279017565] [2020-04-18 07:50:31,806 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:50:31,807 INFO L259 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-04-18 07:50:31,807 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2020-04-18 07:50:31,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-04-18 07:50:31,807 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:50:31,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:50:31,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1404864702, now seen corresponding path program 2 times [2020-04-18 07:50:31,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:50:31,808 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123983509] [2020-04-18 07:50:31,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:50:31,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:50:31,819 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-04-18 07:50:31,819 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123983509] [2020-04-18 07:50:31,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:50:31,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:50:31,820 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:50:31,820 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:50:31,821 INFO L259 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-04-18 07:50:31,821 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:50:31,824 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:50:31,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:50:31,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:50:31,825 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 3 states. [2020-04-18 07:50:31,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:50:31,828 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2020-04-18 07:50:31,828 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2020-04-18 07:50:31,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:50:31,828 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1279017565] [2020-04-18 07:50:31,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:50:31,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 07:50:31,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1279017565] [2020-04-18 07:50:31,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 07:50:31,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:50:31,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:50:31,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:50:31,830 INFO L87 Difference]: Start difference. First operand 46083 states and 261894 transitions. Second operand 3 states. [2020-04-18 07:50:32,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:50:32,332 INFO L93 Difference]: Finished difference Result 69057 states and 386770 transitions. [2020-04-18 07:50:32,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:50:32,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-04-18 07:50:32,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:50:32,588 INFO L225 Difference]: With dead ends: 69057 [2020-04-18 07:50:32,589 INFO L226 Difference]: Without dead ends: 69057 [2020-04-18 07:50:32,589 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:50:39,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69057 states. [2020-04-18 07:50:40,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69057 to 57562. [2020-04-18 07:50:40,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57562 states. [2020-04-18 07:50:40,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57562 states to 57562 states and 330031 transitions. [2020-04-18 07:50:40,771 INFO L78 Accepts]: Start accepts. Automaton has 57562 states and 330031 transitions. Word has length 11 [2020-04-18 07:50:40,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:50:40,772 INFO L479 AbstractCegarLoop]: Abstraction has 57562 states and 330031 transitions. [2020-04-18 07:50:40,772 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 07:50:40,772 INFO L276 IsEmpty]: Start isEmpty. Operand 57562 states and 330031 transitions. [2020-04-18 07:50:40,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-04-18 07:50:40,772 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:50:40,772 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:50:40,772 INFO L427 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:50:40,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:50:40,773 INFO L82 PathProgramCache]: Analyzing trace with hash -601130141, now seen corresponding path program 1 times [2020-04-18 07:50:40,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:50:40,773 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1966025212] [2020-04-18 07:50:40,773 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:50:40,774 INFO L259 McrAutomatonBuilder]: Finished intersection with 21 states and 28 transitions. [2020-04-18 07:50:40,774 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-04-18 07:50:40,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-04-18 07:50:40,774 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:50:40,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:50:40,774 INFO L82 PathProgramCache]: Analyzing trace with hash -601131701, now seen corresponding path program 2 times [2020-04-18 07:50:40,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:50:40,774 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616442345] [2020-04-18 07:50:40,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:50:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:50:40,784 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-04-18 07:50:40,785 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616442345] [2020-04-18 07:50:40,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:50:40,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:50:40,785 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:50:40,786 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:50:40,787 INFO L259 McrAutomatonBuilder]: Finished intersection with 21 states and 27 transitions. [2020-04-18 07:50:40,787 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:50:40,791 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:50:40,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:50:40,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:50:40,791 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2020-04-18 07:50:40,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:50:40,796 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2020-04-18 07:50:40,796 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2020-04-18 07:50:40,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-04-18 07:50:40,797 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:50:40,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:50:40,797 INFO L82 PathProgramCache]: Analyzing trace with hash -601130141, now seen corresponding path program 3 times [2020-04-18 07:50:40,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:50:40,798 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571431634] [2020-04-18 07:50:40,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:50:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:50:40,812 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-04-18 07:50:40,813 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571431634] [2020-04-18 07:50:40,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:50:40,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:50:40,813 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:50:40,814 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:50:40,815 INFO L259 McrAutomatonBuilder]: Finished intersection with 20 states and 25 transitions. [2020-04-18 07:50:40,815 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:50:40,819 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:50:40,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 07:50:40,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 07:50:40,820 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand 4 states. [2020-04-18 07:50:40,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:50:40,829 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2020-04-18 07:50:40,829 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2020-04-18 07:50:40,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:50:40,830 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1966025212] [2020-04-18 07:50:40,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:50:40,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 07:50:40,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1966025212] [2020-04-18 07:50:40,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-04-18 07:50:40,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:50:40,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 07:50:40,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 07:50:40,831 INFO L87 Difference]: Start difference. First operand 57562 states and 330031 transitions. Second operand 4 states. [2020-04-18 07:50:41,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:50:41,898 INFO L93 Difference]: Finished difference Result 46067 states and 261797 transitions. [2020-04-18 07:50:41,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:50:41,901 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-04-18 07:50:41,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:50:42,070 INFO L225 Difference]: With dead ends: 46067 [2020-04-18 07:50:42,070 INFO L226 Difference]: Without dead ends: 46067 [2020-04-18 07:50:42,070 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 07:50:44,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46067 states. [2020-04-18 07:50:45,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46067 to 34572. [2020-04-18 07:50:45,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34572 states. [2020-04-18 07:50:45,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34572 states to 34572 states and 193563 transitions. [2020-04-18 07:50:45,450 INFO L78 Accepts]: Start accepts. Automaton has 34572 states and 193563 transitions. Word has length 12 [2020-04-18 07:50:45,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:50:45,450 INFO L479 AbstractCegarLoop]: Abstraction has 34572 states and 193563 transitions. [2020-04-18 07:50:45,450 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-04-18 07:50:45,450 INFO L276 IsEmpty]: Start isEmpty. Operand 34572 states and 193563 transitions. [2020-04-18 07:50:45,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 07:50:45,451 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:50:45,451 INFO L425 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:50:45,451 INFO L427 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:50:45,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:50:45,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1950756351, now seen corresponding path program 1 times [2020-04-18 07:50:45,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:50:45,451 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1039215991] [2020-04-18 07:50:45,452 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:50:45,452 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 14 transitions. [2020-04-18 07:50:45,452 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2020-04-18 07:50:45,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 07:50:45,452 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:50:45,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:50:45,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1950756351, now seen corresponding path program 2 times [2020-04-18 07:50:45,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:50:45,453 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86009397] [2020-04-18 07:50:45,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:50:45,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:50:45,476 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-04-18 07:50:45,477 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86009397] [2020-04-18 07:50:45,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:50:45,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:50:45,477 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:50:45,478 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:50:45,479 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 14 transitions. [2020-04-18 07:50:45,479 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:50:45,482 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:50:45,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:50:45,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:50:45,483 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2020-04-18 07:50:45,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:50:45,486 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2020-04-18 07:50:45,486 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2020-04-18 07:50:45,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:50:45,486 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1039215991] [2020-04-18 07:50:45,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:50:45,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 07:50:45,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1039215991] [2020-04-18 07:50:45,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 07:50:45,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:50:45,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:50:45,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:50:45,487 INFO L87 Difference]: Start difference. First operand 34572 states and 193563 transitions. Second operand 3 states. [2020-04-18 07:50:46,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:50:46,572 INFO L93 Difference]: Finished difference Result 51759 states and 285634 transitions. [2020-04-18 07:50:46,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:50:46,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-04-18 07:50:46,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:50:46,755 INFO L225 Difference]: With dead ends: 51759 [2020-04-18 07:50:46,755 INFO L226 Difference]: Without dead ends: 51759 [2020-04-18 07:50:46,755 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:50:51,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51759 states. [2020-04-18 07:50:52,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51759 to 43159. [2020-04-18 07:50:52,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43159 states. [2020-04-18 07:50:52,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43159 states to 43159 states and 243856 transitions. [2020-04-18 07:50:52,960 INFO L78 Accepts]: Start accepts. Automaton has 43159 states and 243856 transitions. Word has length 14 [2020-04-18 07:50:52,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:50:52,960 INFO L479 AbstractCegarLoop]: Abstraction has 43159 states and 243856 transitions. [2020-04-18 07:50:52,960 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 07:50:52,960 INFO L276 IsEmpty]: Start isEmpty. Operand 43159 states and 243856 transitions. [2020-04-18 07:50:52,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 07:50:52,960 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:50:52,960 INFO L425 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:50:52,961 INFO L427 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:50:52,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:50:52,961 INFO L82 PathProgramCache]: Analyzing trace with hash 343906870, now seen corresponding path program 1 times [2020-04-18 07:50:52,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:50:52,961 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [481204566] [2020-04-18 07:50:52,961 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:50:52,962 INFO L259 McrAutomatonBuilder]: Finished intersection with 21 states and 25 transitions. [2020-04-18 07:50:52,962 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-04-18 07:50:52,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 07:50:52,962 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:50:52,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:50:52,962 INFO L82 PathProgramCache]: Analyzing trace with hash 343905820, now seen corresponding path program 2 times [2020-04-18 07:50:52,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:50:52,962 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578073262] [2020-04-18 07:50:52,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:50:52,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:50:52,973 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-04-18 07:50:52,973 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578073262] [2020-04-18 07:50:52,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:50:52,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:50:52,974 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:50:52,975 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:50:52,976 INFO L259 McrAutomatonBuilder]: Finished intersection with 21 states and 24 transitions. [2020-04-18 07:50:52,976 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:50:52,980 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:50:52,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:50:52,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:50:52,980 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2020-04-18 07:50:52,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:50:52,985 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2020-04-18 07:50:52,985 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2020-04-18 07:50:52,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 07:50:52,985 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:50:52,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:50:52,986 INFO L82 PathProgramCache]: Analyzing trace with hash 343906870, now seen corresponding path program 3 times [2020-04-18 07:50:52,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:50:52,986 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082862116] [2020-04-18 07:50:52,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:50:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:50:53,008 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-04-18 07:50:53,009 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082862116] [2020-04-18 07:50:53,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:50:53,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:50:53,009 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:50:53,010 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:50:53,012 INFO L259 McrAutomatonBuilder]: Finished intersection with 20 states and 22 transitions. [2020-04-18 07:50:53,012 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:50:53,016 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:50:53,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 07:50:53,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 07:50:53,017 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 4 states. [2020-04-18 07:50:53,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:50:53,032 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2020-04-18 07:50:53,032 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2020-04-18 07:50:53,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:50:53,033 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [481204566] [2020-04-18 07:50:53,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:50:53,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 07:50:53,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [481204566] [2020-04-18 07:50:53,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-04-18 07:50:53,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:50:53,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 07:50:53,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 07:50:53,034 INFO L87 Difference]: Start difference. First operand 43159 states and 243856 transitions. Second operand 4 states. [2020-04-18 07:50:53,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:50:53,378 INFO L93 Difference]: Finished difference Result 34559 states and 193478 transitions. [2020-04-18 07:50:53,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:50:53,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-04-18 07:50:53,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:50:53,497 INFO L225 Difference]: With dead ends: 34559 [2020-04-18 07:50:53,497 INFO L226 Difference]: Without dead ends: 34559 [2020-04-18 07:50:53,497 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 07:50:54,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34559 states. [2020-04-18 07:50:55,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34559 to 25959. [2020-04-18 07:50:55,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25959 states. [2020-04-18 07:50:55,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25959 states to 25959 states and 143100 transitions. [2020-04-18 07:50:55,747 INFO L78 Accepts]: Start accepts. Automaton has 25959 states and 143100 transitions. Word has length 15 [2020-04-18 07:50:55,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:50:55,748 INFO L479 AbstractCegarLoop]: Abstraction has 25959 states and 143100 transitions. [2020-04-18 07:50:55,748 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-04-18 07:50:55,748 INFO L276 IsEmpty]: Start isEmpty. Operand 25959 states and 143100 transitions. [2020-04-18 07:50:55,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 07:50:55,748 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:50:55,748 INFO L425 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:50:55,749 INFO L427 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:50:55,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:50:55,749 INFO L82 PathProgramCache]: Analyzing trace with hash -408592942, now seen corresponding path program 1 times [2020-04-18 07:50:55,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:50:55,749 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1057801841] [2020-04-18 07:50:55,750 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:50:55,751 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 17 transitions. [2020-04-18 07:50:55,751 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-04-18 07:50:55,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 07:50:55,751 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:50:55,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:50:55,752 INFO L82 PathProgramCache]: Analyzing trace with hash -408592942, now seen corresponding path program 2 times [2020-04-18 07:50:55,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:50:55,752 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764397250] [2020-04-18 07:50:55,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:50:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:50:55,779 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-04-18 07:50:55,780 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764397250] [2020-04-18 07:50:55,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:50:55,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:50:55,780 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:50:55,782 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:50:55,783 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 17 transitions. [2020-04-18 07:50:55,783 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:50:55,786 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:50:55,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:50:55,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:50:55,787 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2020-04-18 07:50:55,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:50:55,789 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2020-04-18 07:50:55,789 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2020-04-18 07:50:55,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:50:55,790 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1057801841] [2020-04-18 07:50:55,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:50:55,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 07:50:55,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1057801841] [2020-04-18 07:50:55,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 07:50:55,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:50:55,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:50:55,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:50:55,791 INFO L87 Difference]: Start difference. First operand 25959 states and 143100 transitions. Second operand 3 states. [2020-04-18 07:50:56,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:50:56,076 INFO L93 Difference]: Finished difference Result 38727 states and 210643 transitions. [2020-04-18 07:50:56,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:50:56,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-04-18 07:50:56,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:50:56,207 INFO L225 Difference]: With dead ends: 38727 [2020-04-18 07:50:56,207 INFO L226 Difference]: Without dead ends: 38727 [2020-04-18 07:50:56,207 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:50:57,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38727 states. [2020-04-18 07:50:58,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38727 to 32338. [2020-04-18 07:50:58,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32338 states. [2020-04-18 07:50:58,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32338 states to 32338 states and 180031 transitions. [2020-04-18 07:50:58,627 INFO L78 Accepts]: Start accepts. Automaton has 32338 states and 180031 transitions. Word has length 17 [2020-04-18 07:50:58,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:50:58,627 INFO L479 AbstractCegarLoop]: Abstraction has 32338 states and 180031 transitions. [2020-04-18 07:50:58,627 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 07:50:58,628 INFO L276 IsEmpty]: Start isEmpty. Operand 32338 states and 180031 transitions. [2020-04-18 07:50:58,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 07:50:58,629 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:50:58,629 INFO L425 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:50:58,629 INFO L427 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:50:58,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:50:58,629 INFO L82 PathProgramCache]: Analyzing trace with hash 218524327, now seen corresponding path program 1 times [2020-04-18 07:50:58,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:50:58,630 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1713378907] [2020-04-18 07:50:58,630 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:50:58,631 INFO L259 McrAutomatonBuilder]: Finished intersection with 24 states and 28 transitions. [2020-04-18 07:50:58,631 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-04-18 07:50:58,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 07:50:58,631 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:50:58,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:50:58,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1651387971, now seen corresponding path program 2 times [2020-04-18 07:50:58,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:50:58,632 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784993506] [2020-04-18 07:50:58,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:50:58,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:50:58,642 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-04-18 07:50:58,643 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784993506] [2020-04-18 07:50:58,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:50:58,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:50:58,643 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:50:58,644 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:50:58,646 INFO L259 McrAutomatonBuilder]: Finished intersection with 24 states and 27 transitions. [2020-04-18 07:50:58,646 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:50:58,671 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 07:50:58,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 07:50:58,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 07:50:58,671 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-04-18 07:50:58,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:50:58,691 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2020-04-18 07:50:58,691 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2020-04-18 07:50:58,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 07:50:58,691 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:50:58,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:50:58,692 INFO L82 PathProgramCache]: Analyzing trace with hash 218524327, now seen corresponding path program 3 times [2020-04-18 07:50:58,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:50:58,692 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034693215] [2020-04-18 07:50:58,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:50:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:50:58,708 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-04-18 07:50:58,708 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034693215] [2020-04-18 07:50:58,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:50:58,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:50:58,709 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:50:58,710 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:50:58,712 INFO L259 McrAutomatonBuilder]: Finished intersection with 23 states and 25 transitions. [2020-04-18 07:50:58,712 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:50:58,719 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:50:58,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 07:50:58,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-04-18 07:50:58,719 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 4 states. [2020-04-18 07:50:58,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:50:58,729 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2020-04-18 07:50:58,730 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2020-04-18 07:50:58,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:50:58,730 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1713378907] [2020-04-18 07:50:58,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:50:58,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 07:50:58,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1713378907] [2020-04-18 07:50:58,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-18 07:50:58,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:50:58,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 07:50:58,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 07:50:58,731 INFO L87 Difference]: Start difference. First operand 32338 states and 180031 transitions. Second operand 6 states. [2020-04-18 07:50:58,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:50:58,999 INFO L93 Difference]: Finished difference Result 25949 states and 143030 transitions. [2020-04-18 07:50:58,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:50:58,999 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-04-18 07:50:58,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:50:59,102 INFO L225 Difference]: With dead ends: 25949 [2020-04-18 07:50:59,102 INFO L226 Difference]: Without dead ends: 25949 [2020-04-18 07:50:59,102 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 07:51:00,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25949 states. [2020-04-18 07:51:00,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25949 to 19560. [2020-04-18 07:51:00,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19560 states. [2020-04-18 07:51:00,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19560 states to 19560 states and 106029 transitions. [2020-04-18 07:51:00,712 INFO L78 Accepts]: Start accepts. Automaton has 19560 states and 106029 transitions. Word has length 18 [2020-04-18 07:51:00,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:51:00,712 INFO L479 AbstractCegarLoop]: Abstraction has 19560 states and 106029 transitions. [2020-04-18 07:51:00,712 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-18 07:51:00,712 INFO L276 IsEmpty]: Start isEmpty. Operand 19560 states and 106029 transitions. [2020-04-18 07:51:00,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-04-18 07:51:00,714 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:51:00,714 INFO L425 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:51:00,714 INFO L427 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:51:00,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:51:00,714 INFO L82 PathProgramCache]: Analyzing trace with hash -640482004, now seen corresponding path program 1 times [2020-04-18 07:51:00,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:51:00,715 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1867112627] [2020-04-18 07:51:00,715 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:51:00,716 INFO L259 McrAutomatonBuilder]: Finished intersection with 21 states and 20 transitions. [2020-04-18 07:51:00,716 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-04-18 07:51:00,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-04-18 07:51:00,716 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:51:00,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:51:00,716 INFO L82 PathProgramCache]: Analyzing trace with hash -640482004, now seen corresponding path program 2 times [2020-04-18 07:51:00,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:51:00,716 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930251908] [2020-04-18 07:51:00,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:51:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:51:00,725 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-04-18 07:51:00,726 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930251908] [2020-04-18 07:51:00,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:51:00,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:51:00,726 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:51:00,727 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:51:00,729 INFO L259 McrAutomatonBuilder]: Finished intersection with 21 states and 20 transitions. [2020-04-18 07:51:00,729 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:51:00,732 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:51:00,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:51:00,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:51:00,732 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2020-04-18 07:51:00,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:51:00,734 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2020-04-18 07:51:00,734 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2020-04-18 07:51:00,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:51:00,735 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1867112627] [2020-04-18 07:51:00,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:51:00,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 07:51:00,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1867112627] [2020-04-18 07:51:00,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 07:51:00,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:51:00,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:51:00,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:51:00,737 INFO L87 Difference]: Start difference. First operand 19560 states and 106029 transitions. Second operand 3 states. [2020-04-18 07:51:00,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:51:00,948 INFO L93 Difference]: Finished difference Result 28773 states and 154399 transitions. [2020-04-18 07:51:00,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:51:00,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-04-18 07:51:00,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:51:01,041 INFO L225 Difference]: With dead ends: 28773 [2020-04-18 07:51:01,042 INFO L226 Difference]: Without dead ends: 28773 [2020-04-18 07:51:01,042 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:51:01,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28773 states. [2020-04-18 07:51:02,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28773 to 24163. [2020-04-18 07:51:02,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24163 states. [2020-04-18 07:51:02,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24163 states to 24163 states and 132493 transitions. [2020-04-18 07:51:02,600 INFO L78 Accepts]: Start accepts. Automaton has 24163 states and 132493 transitions. Word has length 20 [2020-04-18 07:51:02,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:51:02,600 INFO L479 AbstractCegarLoop]: Abstraction has 24163 states and 132493 transitions. [2020-04-18 07:51:02,600 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 07:51:02,600 INFO L276 IsEmpty]: Start isEmpty. Operand 24163 states and 132493 transitions. [2020-04-18 07:51:02,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 07:51:02,602 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:51:02,603 INFO L425 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:51:02,603 INFO L427 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:51:02,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:51:02,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1619896945, now seen corresponding path program 1 times [2020-04-18 07:51:02,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:51:02,603 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1736056277] [2020-04-18 07:51:02,604 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:51:02,604 INFO L259 McrAutomatonBuilder]: Finished intersection with 27 states and 31 transitions. [2020-04-18 07:51:02,605 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2020-04-18 07:51:02,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 07:51:02,605 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:51:02,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:51:02,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1299505867, now seen corresponding path program 2 times [2020-04-18 07:51:02,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:51:02,605 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54874584] [2020-04-18 07:51:02,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:51:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:51:02,616 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-04-18 07:51:02,617 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54874584] [2020-04-18 07:51:02,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:51:02,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:51:02,617 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:51:02,619 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:51:02,622 INFO L259 McrAutomatonBuilder]: Finished intersection with 27 states and 30 transitions. [2020-04-18 07:51:02,622 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:51:02,645 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 07:51:02,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 07:51:02,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 07:51:02,646 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 5 states. [2020-04-18 07:51:02,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:51:02,657 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2020-04-18 07:51:02,657 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2020-04-18 07:51:02,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-04-18 07:51:02,657 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:51:02,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:51:02,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1619896945, now seen corresponding path program 3 times [2020-04-18 07:51:02,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:51:02,658 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003613585] [2020-04-18 07:51:02,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:51:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:51:02,689 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-04-18 07:51:02,689 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003613585] [2020-04-18 07:51:02,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:51:02,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:51:02,690 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:51:02,691 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:51:02,693 INFO L259 McrAutomatonBuilder]: Finished intersection with 26 states and 28 transitions. [2020-04-18 07:51:02,693 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:51:02,702 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:51:02,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 07:51:02,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-04-18 07:51:02,703 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 4 states. [2020-04-18 07:51:02,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:51:02,714 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2020-04-18 07:51:02,715 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2020-04-18 07:51:02,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:51:02,715 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1736056277] [2020-04-18 07:51:02,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:51:02,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 07:51:02,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1736056277] [2020-04-18 07:51:02,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-18 07:51:02,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:51:02,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 07:51:02,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 07:51:02,717 INFO L87 Difference]: Start difference. First operand 24163 states and 132493 transitions. Second operand 6 states. [2020-04-18 07:51:02,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:51:02,895 INFO L93 Difference]: Finished difference Result 19553 states and 105977 transitions. [2020-04-18 07:51:02,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:51:02,896 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-04-18 07:51:02,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:51:02,954 INFO L225 Difference]: With dead ends: 19553 [2020-04-18 07:51:02,955 INFO L226 Difference]: Without dead ends: 19553 [2020-04-18 07:51:02,955 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-04-18 07:51:03,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19553 states. [2020-04-18 07:51:03,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19553 to 14943. [2020-04-18 07:51:03,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14943 states. [2020-04-18 07:51:03,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14943 states to 14943 states and 79461 transitions. [2020-04-18 07:51:03,791 INFO L78 Accepts]: Start accepts. Automaton has 14943 states and 79461 transitions. Word has length 21 [2020-04-18 07:51:03,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:51:03,791 INFO L479 AbstractCegarLoop]: Abstraction has 14943 states and 79461 transitions. [2020-04-18 07:51:03,792 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-18 07:51:03,792 INFO L276 IsEmpty]: Start isEmpty. Operand 14943 states and 79461 transitions. [2020-04-18 07:51:03,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-04-18 07:51:03,797 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:51:03,797 INFO L425 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:51:03,797 INFO L427 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:51:03,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:51:03,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1741862694, now seen corresponding path program 1 times [2020-04-18 07:51:03,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:51:03,798 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1309240196] [2020-04-18 07:51:03,798 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:51:03,800 INFO L259 McrAutomatonBuilder]: Finished intersection with 24 states and 23 transitions. [2020-04-18 07:51:03,800 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-04-18 07:51:03,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-04-18 07:51:03,800 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:51:03,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:51:03,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1741862694, now seen corresponding path program 2 times [2020-04-18 07:51:03,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:51:03,801 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352321888] [2020-04-18 07:51:03,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:51:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:51:03,827 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-04-18 07:51:03,827 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352321888] [2020-04-18 07:51:03,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:51:03,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:51:03,828 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:51:03,829 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:51:03,831 INFO L259 McrAutomatonBuilder]: Finished intersection with 24 states and 23 transitions. [2020-04-18 07:51:03,831 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:51:03,834 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:51:03,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:51:03,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:51:03,834 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2020-04-18 07:51:03,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:51:03,836 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2020-04-18 07:51:03,836 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions. [2020-04-18 07:51:03,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:51:03,837 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1309240196] [2020-04-18 07:51:03,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:51:03,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 07:51:03,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1309240196] [2020-04-18 07:51:03,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 07:51:03,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:51:03,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:51:03,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:51:03,838 INFO L87 Difference]: Start difference. First operand 14943 states and 79461 transitions. Second operand 3 states. [2020-04-18 07:51:03,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:51:03,992 INFO L93 Difference]: Finished difference Result 20763 states and 109990 transitions. [2020-04-18 07:51:03,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:51:03,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-04-18 07:51:03,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:51:04,054 INFO L225 Difference]: With dead ends: 20763 [2020-04-18 07:51:04,054 INFO L226 Difference]: Without dead ends: 20763 [2020-04-18 07:51:04,054 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:51:04,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20763 states. [2020-04-18 07:51:05,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20763 to 17851. [2020-04-18 07:51:05,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17851 states. [2020-04-18 07:51:05,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17851 states to 17851 states and 96166 transitions. [2020-04-18 07:51:05,166 INFO L78 Accepts]: Start accepts. Automaton has 17851 states and 96166 transitions. Word has length 23 [2020-04-18 07:51:05,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:51:05,166 INFO L479 AbstractCegarLoop]: Abstraction has 17851 states and 96166 transitions. [2020-04-18 07:51:05,166 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 07:51:05,166 INFO L276 IsEmpty]: Start isEmpty. Operand 17851 states and 96166 transitions. [2020-04-18 07:51:05,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-04-18 07:51:05,171 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:51:05,171 INFO L425 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:51:05,171 INFO L427 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:51:05,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:51:05,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1837019004, now seen corresponding path program 1 times [2020-04-18 07:51:05,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:51:05,172 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [401047937] [2020-04-18 07:51:05,172 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:51:05,173 INFO L259 McrAutomatonBuilder]: Finished intersection with 25 states and 24 transitions. [2020-04-18 07:51:05,173 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2020-04-18 07:51:05,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-04-18 07:51:05,174 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:51:05,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:51:05,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1837019004, now seen corresponding path program 2 times [2020-04-18 07:51:05,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:51:05,174 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927871043] [2020-04-18 07:51:05,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:51:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 07:51:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 07:51:05,193 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-04-18 07:51:05,194 INFO L174 FreeRefinementEngine]: Strategy MCR found a feasible trace [2020-04-18 07:51:05,194 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-04-18 07:51:05,194 WARN L363 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2020-04-18 07:51:05,195 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2020-04-18 07:51:05,206 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,206 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,206 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,206 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,206 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,206 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,207 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,207 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,207 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,207 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,207 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,207 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,207 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,207 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,208 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,208 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,208 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,208 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,208 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,208 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,208 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,209 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,209 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,209 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,209 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,209 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,209 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,209 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,210 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,210 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,210 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,210 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,210 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,210 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,210 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,210 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,210 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,211 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,211 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,211 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,211 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,211 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,211 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,211 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,212 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,212 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,212 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,212 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,212 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,212 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,212 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,212 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,213 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,213 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,213 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,213 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,213 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,213 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,213 WARN L315 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,213 WARN L315 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,213 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,214 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,214 WARN L315 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,214 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,214 WARN L315 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,214 WARN L315 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,214 WARN L315 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,214 WARN L315 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,214 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,214 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,214 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,214 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,215 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,215 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,215 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,215 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,215 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,215 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,215 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,215 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,215 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,215 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,215 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,215 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,216 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,216 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,216 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,216 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,216 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,216 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,216 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,216 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,216 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,216 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,216 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,216 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,217 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,217 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,217 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,217 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,217 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,217 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,217 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,217 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,217 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,217 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,217 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,217 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,218 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,218 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,218 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,218 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,218 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,218 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,218 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,219 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,219 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,219 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,230 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,231 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,231 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,231 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,231 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,231 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,233 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,233 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,233 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,233 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,233 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,233 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,235 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,235 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,235 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,235 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,235 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,235 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,237 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,237 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,237 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,237 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,237 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,237 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,239 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,239 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,239 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,239 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,239 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,239 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,241 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,241 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,242 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,242 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread7of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,242 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,242 WARN L315 ript$VariableManager]: TermVariabe thr1Thread7of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,243 WARN L315 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,243 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,243 WARN L315 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,244 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,244 WARN L315 ript$VariableManager]: TermVariabe thr1Thread8of8ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,244 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread8of8ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:51:05,245 INFO L251 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2020-04-18 07:51:05,245 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 07:51:05,245 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 07:51:05,245 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 07:51:05,246 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 07:51:05,246 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 07:51:05,246 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 07:51:05,246 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 07:51:05,246 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 07:51:05,247 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 124 transitions, 344 flow [2020-04-18 07:51:05,248 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 344 flow [2020-04-18 07:51:05,272 INFO L129 PetriNetUnfolder]: 17/195 cut-off events. [2020-04-18 07:51:05,272 INFO L130 PetriNetUnfolder]: For 112/112 co-relation queries the response was YES. [2020-04-18 07:51:05,274 INFO L80 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 195 events. 17/195 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 596 event pairs, 0 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 214. Up to 18 conditions per place. [2020-04-18 07:51:05,283 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 344 flow [2020-04-18 07:51:05,307 INFO L129 PetriNetUnfolder]: 17/195 cut-off events. [2020-04-18 07:51:05,307 INFO L130 PetriNetUnfolder]: For 112/112 co-relation queries the response was YES. [2020-04-18 07:51:05,310 INFO L80 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 195 events. 17/195 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 596 event pairs, 0 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 214. Up to 18 conditions per place. [2020-04-18 07:51:05,318 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10656 [2020-04-18 07:51:05,319 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-04-18 07:51:06,823 INFO L206 etLargeBlockEncoding]: Checked pairs total: 14930 [2020-04-18 07:51:06,823 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2020-04-18 07:51:06,823 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 54 places, 38 transitions, 172 flow Received shutdown request... [2020-04-18 07:51:38,704 WARN L544 AbstractCegarLoop]: Verification canceled [2020-04-18 07:51:38,706 WARN L228 ceAbstractionStarter]: Timeout [2020-04-18 07:51:38,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.04 07:51:38 BasicIcfg [2020-04-18 07:51:38,707 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-04-18 07:51:38,708 INFO L168 Benchmark]: Toolchain (without parser) took 219116.33 ms. Allocated memory was 137.4 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 99.4 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2020-04-18 07:51:38,709 INFO L168 Benchmark]: CDTParser took 1.33 ms. Allocated memory is still 137.4 MB. Free memory was 119.0 MB in the beginning and 118.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-04-18 07:51:38,709 INFO L168 Benchmark]: CACSL2BoogieTranslator took 644.74 ms. Allocated memory was 137.4 MB in the beginning and 202.9 MB in the end (delta: 65.5 MB). Free memory was 97.4 MB in the beginning and 162.9 MB in the end (delta: -65.5 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB. [2020-04-18 07:51:38,710 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.04 ms. Allocated memory is still 202.9 MB. Free memory was 162.9 MB in the beginning and 160.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-04-18 07:51:38,710 INFO L168 Benchmark]: Boogie Preprocessor took 30.47 ms. Allocated memory is still 202.9 MB. Free memory was 160.8 MB in the beginning and 159.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-04-18 07:51:38,710 INFO L168 Benchmark]: RCFGBuilder took 403.64 ms. Allocated memory is still 202.9 MB. Free memory was 159.5 MB in the beginning and 143.3 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. [2020-04-18 07:51:38,711 INFO L168 Benchmark]: TraceAbstraction took 217965.11 ms. Allocated memory was 202.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 143.3 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2020-04-18 07:51:38,713 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.33 ms. Allocated memory is still 137.4 MB. Free memory was 119.0 MB in the beginning and 118.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 644.74 ms. Allocated memory was 137.4 MB in the beginning and 202.9 MB in the end (delta: 65.5 MB). Free memory was 97.4 MB in the beginning and 162.9 MB in the end (delta: -65.5 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 51.04 ms. Allocated memory is still 202.9 MB. Free memory was 162.9 MB in the beginning and 160.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.47 ms. Allocated memory is still 202.9 MB. Free memory was 160.8 MB in the beginning and 159.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 403.64 ms. Allocated memory is still 202.9 MB. Free memory was 159.5 MB in the beginning and 143.3 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 217965.11 ms. Allocated memory was 202.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 143.3 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.7s, 34 ProgramPointsBefore, 11 ProgramPointsAfterwards, 33 TransitionsBefore, 8 TransitionsAfterwards, 240 CoEnabledTransitionPairs, 5 FixpointIterations, 9 TrivialSequentialCompositions, 16 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 119 VarBasedMoverChecksPositive, 0 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 167 CheckedPairsTotal, 30 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.8s, 48 ProgramPointsBefore, 18 ProgramPointsAfterwards, 46 TransitionsBefore, 13 TransitionsAfterwards, 792 CoEnabledTransitionPairs, 5 FixpointIterations, 9 TrivialSequentialCompositions, 19 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 3 ChoiceCompositions, 466 VarBasedMoverChecksPositive, 21 VarBasedMoverChecksNegative, 2 SemBasedMoverChecksPositive, 22 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 1029 CheckedPairsTotal, 37 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.7s, 62 ProgramPointsBefore, 24 ProgramPointsAfterwards, 59 TransitionsBefore, 17 TransitionsAfterwards, 1656 CoEnabledTransitionPairs, 5 FixpointIterations, 9 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 4 ChoiceCompositions, 966 VarBasedMoverChecksPositive, 31 VarBasedMoverChecksNegative, 2 SemBasedMoverChecksPositive, 34 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 2190 CheckedPairsTotal, 48 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.9s, 76 ProgramPointsBefore, 30 ProgramPointsAfterwards, 72 TransitionsBefore, 23 TransitionsAfterwards, 2832 CoEnabledTransitionPairs, 6 FixpointIterations, 9 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 3 ChoiceCompositions, 1593 VarBasedMoverChecksPositive, 58 VarBasedMoverChecksNegative, 20 SemBasedMoverChecksPositive, 43 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 4290 CheckedPairsTotal, 63 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.2s, 90 ProgramPointsBefore, 36 ProgramPointsAfterwards, 85 TransitionsBefore, 28 TransitionsAfterwards, 4320 CoEnabledTransitionPairs, 6 FixpointIterations, 9 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 18 ConcurrentYvCompositions, 3 ChoiceCompositions, 2473 VarBasedMoverChecksPositive, 100 VarBasedMoverChecksNegative, 56 SemBasedMoverChecksPositive, 52 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.2s, 0 MoverChecksTotal, 6467 CheckedPairsTotal, 76 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.3s, 104 ProgramPointsBefore, 42 ProgramPointsAfterwards, 98 TransitionsBefore, 33 TransitionsAfterwards, 6120 CoEnabledTransitionPairs, 6 FixpointIterations, 9 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 21 ConcurrentYvCompositions, 3 ChoiceCompositions, 3503 VarBasedMoverChecksPositive, 143 VarBasedMoverChecksNegative, 79 SemBasedMoverChecksPositive, 73 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.3s, 0 MoverChecksTotal, 10327 CheckedPairsTotal, 89 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.6s, 118 ProgramPointsBefore, 48 ProgramPointsAfterwards, 111 TransitionsBefore, 34 TransitionsAfterwards, 8232 CoEnabledTransitionPairs, 6 FixpointIterations, 9 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 26 ConcurrentYvCompositions, 7 ChoiceCompositions, 4657 VarBasedMoverChecksPositive, 95 VarBasedMoverChecksNegative, 23 SemBasedMoverChecksPositive, 87 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.3s, 0 MoverChecksTotal, 13237 CheckedPairsTotal, 95 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.5s, 132 ProgramPointsBefore, 54 ProgramPointsAfterwards, 124 TransitionsBefore, 38 TransitionsAfterwards, 10656 CoEnabledTransitionPairs, 5 FixpointIterations, 9 TrivialSequentialCompositions, 66 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 8 ChoiceCompositions, 6263 VarBasedMoverChecksPositive, 108 VarBasedMoverChecksNegative, 28 SemBasedMoverChecksPositive, 88 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.3s, 0 MoverChecksTotal, 14930 CheckedPairsTotal, 105 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 680]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 680). Cancelled while BasicCegarLoop was constructing initial abstraction,while PetriNet2FiniteAutomaton was constructing automaton for Petri net that has has 54 places, 38 transitions, 172 flow. Already constructed 124927 states. Currently 33807 states in worklist.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 31 locations, 1 error locations. Started 8 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 217.5s, OverallIterations: 59, TraceHistogramMax: 8, AutomataDifference: 25.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 85.0s, HoareTripleCheckerStatistics: 1566 SDtfs, 1089 SDslu, 1109 SDs, 0 SdLazy, 1449 SolverSat, 140 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 947 GetRequests, 818 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122716occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 103.0s AutomataMinimizationTime, 52 MinimizatonAttempts, 192156 StatesRemovedByMinimization, 51 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown