/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-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix026_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:37:27,430 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:37:27,433 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:37:27,446 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:37:27,446 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:37:27,447 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:37:27,448 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:37:27,450 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:37:27,452 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:37:27,453 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:37:27,454 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:37:27,455 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:37:27,455 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:37:27,456 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:37:27,457 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:37:27,458 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:37:27,459 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:37:27,460 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:37:27,462 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:37:27,464 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:37:27,466 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:37:27,467 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:37:27,468 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:37:27,469 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:37:27,471 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:37:27,471 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:37:27,472 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:37:27,473 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:37:27,473 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:37:27,474 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:37:27,474 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:37:27,475 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:37:27,476 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:37:27,477 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:37:27,477 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:37:27,478 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:37:27,478 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:37:27,479 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:37:27,479 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:37:27,480 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:37:27,480 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:37:27,481 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-VariableLbe-MCR.epf [2019-12-27 20:37:27,495 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:37:27,496 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:37:27,497 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:37:27,497 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:37:27,497 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:37:27,498 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:37:27,498 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:37:27,498 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:37:27,498 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:37:27,498 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:37:27,498 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:37:27,499 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:37:27,499 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:37:27,499 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:37:27,499 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:37:27,499 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:37:27,500 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:37:27,500 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:37:27,500 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:37:27,500 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:37:27,500 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:37:27,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:37:27,501 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:37:27,501 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:37:27,501 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:37:27,501 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:37:27,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:37:27,502 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:37:27,502 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:37:27,502 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:37:27,502 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:37:27,503 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:37:27,771 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:37:27,788 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:37:27,791 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:37:27,792 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:37:27,792 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:37:27,793 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix026_pso.opt.i [2019-12-27 20:37:27,861 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57a7b9f59/52f7939f89f043f0a79ce8ceb1018997/FLAG1eec29d81 [2019-12-27 20:37:28,420 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:37:28,421 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix026_pso.opt.i [2019-12-27 20:37:28,446 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57a7b9f59/52f7939f89f043f0a79ce8ceb1018997/FLAG1eec29d81 [2019-12-27 20:37:28,689 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57a7b9f59/52f7939f89f043f0a79ce8ceb1018997 [2019-12-27 20:37:28,700 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:37:28,702 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:37:28,704 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:37:28,704 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:37:28,707 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:37:28,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:37:28" (1/1) ... [2019-12-27 20:37:28,712 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49853036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:37:28, skipping insertion in model container [2019-12-27 20:37:28,712 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:37:28" (1/1) ... [2019-12-27 20:37:28,722 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:37:28,790 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:37:29,311 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:37:29,325 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:37:29,402 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:37:29,472 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:37:29,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:37:29 WrapperNode [2019-12-27 20:37:29,473 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:37:29,473 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:37:29,474 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:37:29,474 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:37:29,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:37:29" (1/1) ... [2019-12-27 20:37:29,507 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:37:29" (1/1) ... [2019-12-27 20:37:29,542 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:37:29,543 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:37:29,543 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:37:29,543 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:37:29,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:37:29" (1/1) ... [2019-12-27 20:37:29,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:37:29" (1/1) ... [2019-12-27 20:37:29,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:37:29" (1/1) ... [2019-12-27 20:37:29,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:37:29" (1/1) ... [2019-12-27 20:37:29,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:37:29" (1/1) ... [2019-12-27 20:37:29,572 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:37:29" (1/1) ... [2019-12-27 20:37:29,575 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:37:29" (1/1) ... [2019-12-27 20:37:29,581 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:37:29,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:37:29,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:37:29,581 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:37:29,582 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:37:29" (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 [2019-12-27 20:37:29,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:37:29,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:37:29,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:37:29,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:37:29,669 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:37:29,669 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:37:29,670 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:37:29,670 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:37:29,671 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 20:37:29,671 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 20:37:29,671 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 20:37:29,671 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 20:37:29,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:37:29,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:37:29,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:37:29,675 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 20:37:30,422 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:37:30,423 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:37:30,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:37:30 BoogieIcfgContainer [2019-12-27 20:37:30,424 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:37:30,426 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:37:30,426 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:37:30,429 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:37:30,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:37:28" (1/3) ... [2019-12-27 20:37:30,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f87c7dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:37:30, skipping insertion in model container [2019-12-27 20:37:30,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:37:29" (2/3) ... [2019-12-27 20:37:30,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f87c7dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:37:30, skipping insertion in model container [2019-12-27 20:37:30,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:37:30" (3/3) ... [2019-12-27 20:37:30,433 INFO L109 eAbstractionObserver]: Analyzing ICFG mix026_pso.opt.i [2019-12-27 20:37:30,442 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:37:30,442 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:37:30,450 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:37:30,451 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:37:30,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,500 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,501 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,504 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,506 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,568 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,569 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,569 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,569 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,569 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,576 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,576 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,576 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,576 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,577 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,577 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,577 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,577 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,578 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,578 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,578 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,578 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,578 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,579 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,579 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,579 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,579 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,583 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,583 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,584 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,584 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,584 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,584 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,584 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,584 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,585 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,585 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,585 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,585 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,585 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,590 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,590 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,590 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,590 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,591 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,591 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,591 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,591 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,591 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,592 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,598 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,598 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,602 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,604 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,608 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,608 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,608 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:37:30,625 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 20:37:30,645 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:37:30,645 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:37:30,645 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:37:30,645 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:37:30,645 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:37:30,645 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:37:30,646 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:37:30,646 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:37:30,662 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-27 20:37:30,664 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-27 20:37:30,774 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-27 20:37:30,775 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:37:30,796 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 448 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 20:37:30,819 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-27 20:37:30,895 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-27 20:37:30,896 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:37:30,903 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 448 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 20:37:30,925 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-27 20:37:30,927 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:37:34,786 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 20:37:34,924 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 20:37:34,943 INFO L206 etLargeBlockEncoding]: Checked pairs total: 68785 [2019-12-27 20:37:34,943 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-27 20:37:34,946 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 89 places, 94 transitions [2019-12-27 20:38:11,378 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 171512 states. [2019-12-27 20:38:11,380 INFO L276 IsEmpty]: Start isEmpty. Operand 171512 states. [2019-12-27 20:38:11,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 20:38:11,386 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:38:11,387 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:38:11,387 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:38:11,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:38:11,394 INFO L82 PathProgramCache]: Analyzing trace with hash 411952807, now seen corresponding path program 1 times [2019-12-27 20:38:11,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:38:11,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058456039] [2019-12-27 20:38:11,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:38:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:38:11,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:38:11,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058456039] [2019-12-27 20:38:11,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:38:11,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:38:11,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [227882262] [2019-12-27 20:38:11,664 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:38:11,668 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:38:11,681 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 20:38:11,682 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:38:11,686 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:38:11,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:38:11,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:38:11,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:38:11,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:38:11,702 INFO L87 Difference]: Start difference. First operand 171512 states. Second operand 3 states. [2019-12-27 20:38:18,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:38:18,453 INFO L93 Difference]: Finished difference Result 168024 states and 799121 transitions. [2019-12-27 20:38:18,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:38:18,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 20:38:18,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:38:19,373 INFO L225 Difference]: With dead ends: 168024 [2019-12-27 20:38:19,374 INFO L226 Difference]: Without dead ends: 158222 [2019-12-27 20:38:19,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:38:24,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158222 states. [2019-12-27 20:38:30,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158222 to 158222. [2019-12-27 20:38:30,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158222 states. [2019-12-27 20:38:36,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158222 states to 158222 states and 751554 transitions. [2019-12-27 20:38:36,629 INFO L78 Accepts]: Start accepts. Automaton has 158222 states and 751554 transitions. Word has length 7 [2019-12-27 20:38:36,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:38:36,630 INFO L462 AbstractCegarLoop]: Abstraction has 158222 states and 751554 transitions. [2019-12-27 20:38:36,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:38:36,631 INFO L276 IsEmpty]: Start isEmpty. Operand 158222 states and 751554 transitions. [2019-12-27 20:38:36,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 20:38:36,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:38:36,642 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:38:36,643 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:38:36,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:38:36,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1837496969, now seen corresponding path program 1 times [2019-12-27 20:38:36,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:38:36,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141137810] [2019-12-27 20:38:36,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:38:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:38:36,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:38:36,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141137810] [2019-12-27 20:38:36,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:38:36,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:38:36,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [432219870] [2019-12-27 20:38:36,763 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:38:36,765 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:38:36,770 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 20:38:36,771 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:38:36,771 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:38:36,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:38:36,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:38:36,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:38:36,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:38:36,773 INFO L87 Difference]: Start difference. First operand 158222 states and 751554 transitions. Second operand 4 states. [2019-12-27 20:38:43,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:38:43,949 INFO L93 Difference]: Finished difference Result 247350 states and 1127352 transitions. [2019-12-27 20:38:43,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:38:43,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 20:38:43,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:38:45,682 INFO L225 Difference]: With dead ends: 247350 [2019-12-27 20:38:45,682 INFO L226 Difference]: Without dead ends: 247168 [2019-12-27 20:38:45,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:38:52,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247168 states. [2019-12-27 20:38:59,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247168 to 227148. [2019-12-27 20:38:59,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227148 states. [2019-12-27 20:39:12,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227148 states to 227148 states and 1045761 transitions. [2019-12-27 20:39:12,882 INFO L78 Accepts]: Start accepts. Automaton has 227148 states and 1045761 transitions. Word has length 15 [2019-12-27 20:39:12,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:39:12,882 INFO L462 AbstractCegarLoop]: Abstraction has 227148 states and 1045761 transitions. [2019-12-27 20:39:12,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:39:12,882 INFO L276 IsEmpty]: Start isEmpty. Operand 227148 states and 1045761 transitions. [2019-12-27 20:39:12,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 20:39:12,887 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:39:12,887 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:39:12,887 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:39:12,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:39:12,887 INFO L82 PathProgramCache]: Analyzing trace with hash -372809848, now seen corresponding path program 1 times [2019-12-27 20:39:12,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:39:12,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587740131] [2019-12-27 20:39:12,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:39:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:39:12,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:39:12,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587740131] [2019-12-27 20:39:12,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:39:12,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:39:12,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1010522553] [2019-12-27 20:39:12,954 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:39:12,955 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:39:12,957 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 20:39:12,958 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:39:12,958 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:39:12,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:39:12,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:39:12,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:39:12,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:39:12,959 INFO L87 Difference]: Start difference. First operand 227148 states and 1045761 transitions. Second operand 3 states. [2019-12-27 20:39:13,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:39:13,681 INFO L93 Difference]: Finished difference Result 141425 states and 586615 transitions. [2019-12-27 20:39:13,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:39:13,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 20:39:13,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:39:14,087 INFO L225 Difference]: With dead ends: 141425 [2019-12-27 20:39:14,088 INFO L226 Difference]: Without dead ends: 141425 [2019-12-27 20:39:14,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:39:25,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141425 states. [2019-12-27 20:39:27,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141425 to 141425. [2019-12-27 20:39:27,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141425 states. [2019-12-27 20:39:29,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141425 states to 141425 states and 586615 transitions. [2019-12-27 20:39:29,414 INFO L78 Accepts]: Start accepts. Automaton has 141425 states and 586615 transitions. Word has length 15 [2019-12-27 20:39:29,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:39:29,414 INFO L462 AbstractCegarLoop]: Abstraction has 141425 states and 586615 transitions. [2019-12-27 20:39:29,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:39:29,414 INFO L276 IsEmpty]: Start isEmpty. Operand 141425 states and 586615 transitions. [2019-12-27 20:39:29,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:39:29,419 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:39:29,419 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:39:29,420 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:39:29,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:39:29,420 INFO L82 PathProgramCache]: Analyzing trace with hash -728396216, now seen corresponding path program 1 times [2019-12-27 20:39:29,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:39:29,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172632529] [2019-12-27 20:39:29,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:39:29,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:39:29,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:39:29,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172632529] [2019-12-27 20:39:29,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:39:29,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:39:29,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [832131398] [2019-12-27 20:39:29,514 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:39:29,515 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:39:29,518 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 28 transitions. [2019-12-27 20:39:29,518 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:39:29,520 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:39:29,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:39:29,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:39:29,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:39:29,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:39:29,521 INFO L87 Difference]: Start difference. First operand 141425 states and 586615 transitions. Second operand 4 states. [2019-12-27 20:39:29,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:39:29,719 INFO L93 Difference]: Finished difference Result 38183 states and 134511 transitions. [2019-12-27 20:39:29,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:39:29,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 20:39:29,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:39:29,794 INFO L225 Difference]: With dead ends: 38183 [2019-12-27 20:39:29,794 INFO L226 Difference]: Without dead ends: 38183 [2019-12-27 20:39:29,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:39:30,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38183 states. [2019-12-27 20:39:30,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38183 to 38183. [2019-12-27 20:39:30,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38183 states. [2019-12-27 20:39:30,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38183 states to 38183 states and 134511 transitions. [2019-12-27 20:39:30,486 INFO L78 Accepts]: Start accepts. Automaton has 38183 states and 134511 transitions. Word has length 16 [2019-12-27 20:39:30,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:39:30,487 INFO L462 AbstractCegarLoop]: Abstraction has 38183 states and 134511 transitions. [2019-12-27 20:39:30,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:39:30,487 INFO L276 IsEmpty]: Start isEmpty. Operand 38183 states and 134511 transitions. [2019-12-27 20:39:30,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:39:30,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:39:30,489 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:39:30,489 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:39:30,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:39:30,489 INFO L82 PathProgramCache]: Analyzing trace with hash 539668976, now seen corresponding path program 1 times [2019-12-27 20:39:30,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:39:30,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518447297] [2019-12-27 20:39:30,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:39:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:39:30,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:39:30,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518447297] [2019-12-27 20:39:30,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:39:30,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:39:30,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [793293341] [2019-12-27 20:39:30,617 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:39:30,620 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:39:30,625 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 20:39:30,625 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:39:30,724 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:39:30,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:39:30,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:39:30,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:39:30,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:39:30,726 INFO L87 Difference]: Start difference. First operand 38183 states and 134511 transitions. Second operand 7 states. [2019-12-27 20:39:31,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:39:31,480 INFO L93 Difference]: Finished difference Result 53681 states and 185843 transitions. [2019-12-27 20:39:31,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:39:31,480 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-12-27 20:39:31,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:39:34,336 INFO L225 Difference]: With dead ends: 53681 [2019-12-27 20:39:34,337 INFO L226 Difference]: Without dead ends: 53665 [2019-12-27 20:39:34,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:39:34,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53665 states. [2019-12-27 20:39:35,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53665 to 41924. [2019-12-27 20:39:35,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41924 states. [2019-12-27 20:39:35,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41924 states to 41924 states and 147192 transitions. [2019-12-27 20:39:35,154 INFO L78 Accepts]: Start accepts. Automaton has 41924 states and 147192 transitions. Word has length 16 [2019-12-27 20:39:35,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:39:35,155 INFO L462 AbstractCegarLoop]: Abstraction has 41924 states and 147192 transitions. [2019-12-27 20:39:35,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:39:35,155 INFO L276 IsEmpty]: Start isEmpty. Operand 41924 states and 147192 transitions. [2019-12-27 20:39:35,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 20:39:35,171 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:39:35,171 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:39:35,171 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:39:35,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:39:35,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1532269358, now seen corresponding path program 1 times [2019-12-27 20:39:35,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:39:35,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795717638] [2019-12-27 20:39:35,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:39:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:39:35,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:39:35,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795717638] [2019-12-27 20:39:35,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:39:35,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:39:35,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1243778109] [2019-12-27 20:39:35,265 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:39:35,268 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:39:35,282 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 114 transitions. [2019-12-27 20:39:35,282 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:39:35,327 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:39:35,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:39:35,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:39:35,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:39:35,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:39:35,329 INFO L87 Difference]: Start difference. First operand 41924 states and 147192 transitions. Second operand 8 states. [2019-12-27 20:39:37,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:39:37,129 INFO L93 Difference]: Finished difference Result 63881 states and 218393 transitions. [2019-12-27 20:39:37,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 20:39:37,130 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-12-27 20:39:37,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:39:37,291 INFO L225 Difference]: With dead ends: 63881 [2019-12-27 20:39:37,291 INFO L226 Difference]: Without dead ends: 63853 [2019-12-27 20:39:37,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-12-27 20:39:37,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63853 states. [2019-12-27 20:39:38,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63853 to 43646. [2019-12-27 20:39:38,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43646 states. [2019-12-27 20:39:38,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43646 states to 43646 states and 152050 transitions. [2019-12-27 20:39:38,245 INFO L78 Accepts]: Start accepts. Automaton has 43646 states and 152050 transitions. Word has length 24 [2019-12-27 20:39:38,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:39:38,245 INFO L462 AbstractCegarLoop]: Abstraction has 43646 states and 152050 transitions. [2019-12-27 20:39:38,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:39:38,246 INFO L276 IsEmpty]: Start isEmpty. Operand 43646 states and 152050 transitions. [2019-12-27 20:39:38,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 20:39:38,267 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:39:38,267 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:39:38,267 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:39:38,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:39:38,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1695567288, now seen corresponding path program 1 times [2019-12-27 20:39:38,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:39:38,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662308088] [2019-12-27 20:39:38,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:39:38,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:39:38,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:39:38,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662308088] [2019-12-27 20:39:38,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:39:38,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:39:38,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1640652243] [2019-12-27 20:39:38,339 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:39:38,344 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:39:38,352 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 40 transitions. [2019-12-27 20:39:38,352 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:39:38,353 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:39:38,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:39:38,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:39:38,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:39:38,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:39:38,354 INFO L87 Difference]: Start difference. First operand 43646 states and 152050 transitions. Second operand 5 states. [2019-12-27 20:39:38,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:39:38,487 INFO L93 Difference]: Finished difference Result 22336 states and 78762 transitions. [2019-12-27 20:39:38,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:39:38,488 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 20:39:38,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:39:38,529 INFO L225 Difference]: With dead ends: 22336 [2019-12-27 20:39:38,529 INFO L226 Difference]: Without dead ends: 22336 [2019-12-27 20:39:38,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:39:38,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22336 states. [2019-12-27 20:39:39,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22336 to 22144. [2019-12-27 20:39:39,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22144 states. [2019-12-27 20:39:39,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22144 states to 22144 states and 78106 transitions. [2019-12-27 20:39:39,181 INFO L78 Accepts]: Start accepts. Automaton has 22144 states and 78106 transitions. Word has length 28 [2019-12-27 20:39:39,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:39:39,181 INFO L462 AbstractCegarLoop]: Abstraction has 22144 states and 78106 transitions. [2019-12-27 20:39:39,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:39:39,181 INFO L276 IsEmpty]: Start isEmpty. Operand 22144 states and 78106 transitions. [2019-12-27 20:39:39,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 20:39:39,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:39:39,221 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:39:39,221 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:39:39,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:39:39,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1310501217, now seen corresponding path program 1 times [2019-12-27 20:39:39,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:39:39,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101517048] [2019-12-27 20:39:39,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:39:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:39:39,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:39:39,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101517048] [2019-12-27 20:39:39,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:39:39,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:39:39,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1477215421] [2019-12-27 20:39:39,306 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:39:39,315 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:39:39,345 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 131 transitions. [2019-12-27 20:39:39,345 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:39:39,346 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:39:39,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:39:39,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:39:39,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:39:39,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:39:39,347 INFO L87 Difference]: Start difference. First operand 22144 states and 78106 transitions. Second operand 4 states. [2019-12-27 20:39:39,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:39:39,473 INFO L93 Difference]: Finished difference Result 32187 states and 108348 transitions. [2019-12-27 20:39:39,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:39:39,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-27 20:39:39,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:39:39,528 INFO L225 Difference]: With dead ends: 32187 [2019-12-27 20:39:39,528 INFO L226 Difference]: Without dead ends: 22530 [2019-12-27 20:39:39,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:39:39,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22530 states. [2019-12-27 20:39:39,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22530 to 22434. [2019-12-27 20:39:39,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22434 states. [2019-12-27 20:39:39,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22434 states to 22434 states and 78130 transitions. [2019-12-27 20:39:39,897 INFO L78 Accepts]: Start accepts. Automaton has 22434 states and 78130 transitions. Word has length 42 [2019-12-27 20:39:39,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:39:39,898 INFO L462 AbstractCegarLoop]: Abstraction has 22434 states and 78130 transitions. [2019-12-27 20:39:39,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:39:39,898 INFO L276 IsEmpty]: Start isEmpty. Operand 22434 states and 78130 transitions. [2019-12-27 20:39:39,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 20:39:39,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:39:39,935 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:39:39,935 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:39:39,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:39:39,936 INFO L82 PathProgramCache]: Analyzing trace with hash 475291737, now seen corresponding path program 2 times [2019-12-27 20:39:39,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:39:39,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727779959] [2019-12-27 20:39:39,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:39:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:39:40,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:39:40,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727779959] [2019-12-27 20:39:40,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:39:40,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:39:40,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1366404205] [2019-12-27 20:39:40,042 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:39:40,052 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:39:40,112 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 193 transitions. [2019-12-27 20:39:40,113 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:39:40,138 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 20:39:40,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:39:40,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:39:40,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:39:40,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:39:40,140 INFO L87 Difference]: Start difference. First operand 22434 states and 78130 transitions. Second operand 5 states. [2019-12-27 20:39:41,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:39:41,028 INFO L93 Difference]: Finished difference Result 34019 states and 117486 transitions. [2019-12-27 20:39:41,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:39:41,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-27 20:39:41,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:39:41,124 INFO L225 Difference]: With dead ends: 34019 [2019-12-27 20:39:41,124 INFO L226 Difference]: Without dead ends: 34019 [2019-12-27 20:39:41,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:39:41,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34019 states. [2019-12-27 20:39:41,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34019 to 26693. [2019-12-27 20:39:41,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26693 states. [2019-12-27 20:39:41,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26693 states to 26693 states and 93064 transitions. [2019-12-27 20:39:41,718 INFO L78 Accepts]: Start accepts. Automaton has 26693 states and 93064 transitions. Word has length 42 [2019-12-27 20:39:41,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:39:41,718 INFO L462 AbstractCegarLoop]: Abstraction has 26693 states and 93064 transitions. [2019-12-27 20:39:41,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:39:41,718 INFO L276 IsEmpty]: Start isEmpty. Operand 26693 states and 93064 transitions. [2019-12-27 20:39:41,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 20:39:41,758 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:39:41,758 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:39:41,758 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:39:41,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:39:41,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1445286149, now seen corresponding path program 3 times [2019-12-27 20:39:41,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:39:41,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413450038] [2019-12-27 20:39:41,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:39:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:39:41,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:39:41,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413450038] [2019-12-27 20:39:41,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:39:41,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:39:41,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [72753074] [2019-12-27 20:39:41,840 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:39:41,851 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:39:41,911 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 110 states and 176 transitions. [2019-12-27 20:39:41,911 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:39:41,912 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:39:41,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:39:41,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:39:41,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:39:41,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:39:41,913 INFO L87 Difference]: Start difference. First operand 26693 states and 93064 transitions. Second operand 6 states. [2019-12-27 20:39:42,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:39:42,109 INFO L93 Difference]: Finished difference Result 25272 states and 89500 transitions. [2019-12-27 20:39:42,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:39:42,110 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-27 20:39:42,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:39:42,179 INFO L225 Difference]: With dead ends: 25272 [2019-12-27 20:39:42,179 INFO L226 Difference]: Without dead ends: 23431 [2019-12-27 20:39:42,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:39:42,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23431 states. [2019-12-27 20:39:42,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23431 to 22547. [2019-12-27 20:39:42,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22547 states. [2019-12-27 20:39:42,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22547 states to 22547 states and 80021 transitions. [2019-12-27 20:39:42,982 INFO L78 Accepts]: Start accepts. Automaton has 22547 states and 80021 transitions. Word has length 42 [2019-12-27 20:39:42,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:39:42,982 INFO L462 AbstractCegarLoop]: Abstraction has 22547 states and 80021 transitions. [2019-12-27 20:39:42,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:39:42,983 INFO L276 IsEmpty]: Start isEmpty. Operand 22547 states and 80021 transitions. [2019-12-27 20:39:43,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:39:43,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:39:43,019 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:39:43,020 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:39:43,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:39:43,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1547062622, now seen corresponding path program 1 times [2019-12-27 20:39:43,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:39:43,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020191256] [2019-12-27 20:39:43,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:39:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:39:43,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:39:43,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020191256] [2019-12-27 20:39:43,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:39:43,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:39:43,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [237011839] [2019-12-27 20:39:43,084 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:39:43,104 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:39:43,337 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 258 states and 481 transitions. [2019-12-27 20:39:43,338 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:39:43,362 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:39:43,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:39:43,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:39:43,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:39:43,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:39:43,363 INFO L87 Difference]: Start difference. First operand 22547 states and 80021 transitions. Second operand 5 states. [2019-12-27 20:39:43,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:39:43,548 INFO L93 Difference]: Finished difference Result 31881 states and 113184 transitions. [2019-12-27 20:39:43,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:39:43,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-27 20:39:43,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:39:43,608 INFO L225 Difference]: With dead ends: 31881 [2019-12-27 20:39:43,608 INFO L226 Difference]: Without dead ends: 31881 [2019-12-27 20:39:43,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:39:43,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31881 states. [2019-12-27 20:39:44,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31881 to 26551. [2019-12-27 20:39:44,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26551 states. [2019-12-27 20:39:44,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26551 states to 26551 states and 94982 transitions. [2019-12-27 20:39:44,443 INFO L78 Accepts]: Start accepts. Automaton has 26551 states and 94982 transitions. Word has length 57 [2019-12-27 20:39:44,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:39:44,443 INFO L462 AbstractCegarLoop]: Abstraction has 26551 states and 94982 transitions. [2019-12-27 20:39:44,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:39:44,444 INFO L276 IsEmpty]: Start isEmpty. Operand 26551 states and 94982 transitions. [2019-12-27 20:39:44,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:39:44,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:39:44,497 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:39:44,497 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:39:44,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:39:44,497 INFO L82 PathProgramCache]: Analyzing trace with hash -990317698, now seen corresponding path program 1 times [2019-12-27 20:39:44,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:39:44,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908870792] [2019-12-27 20:39:44,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:39:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:39:44,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:39:44,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908870792] [2019-12-27 20:39:44,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:39:44,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:39:44,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2018463901] [2019-12-27 20:39:44,633 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:39:44,652 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:39:44,901 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 262 states and 494 transitions. [2019-12-27 20:39:44,901 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:39:44,913 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:39:44,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:39:44,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:39:44,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:39:44,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:39:44,915 INFO L87 Difference]: Start difference. First operand 26551 states and 94982 transitions. Second operand 5 states. [2019-12-27 20:39:45,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:39:45,075 INFO L93 Difference]: Finished difference Result 38479 states and 132146 transitions. [2019-12-27 20:39:45,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:39:45,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-27 20:39:45,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:39:45,094 INFO L225 Difference]: With dead ends: 38479 [2019-12-27 20:39:45,094 INFO L226 Difference]: Without dead ends: 12719 [2019-12-27 20:39:45,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:39:45,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12719 states. [2019-12-27 20:39:45,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12719 to 12719. [2019-12-27 20:39:45,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12719 states. [2019-12-27 20:39:45,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12719 states to 12719 states and 39405 transitions. [2019-12-27 20:39:45,284 INFO L78 Accepts]: Start accepts. Automaton has 12719 states and 39405 transitions. Word has length 57 [2019-12-27 20:39:45,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:39:45,284 INFO L462 AbstractCegarLoop]: Abstraction has 12719 states and 39405 transitions. [2019-12-27 20:39:45,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:39:45,285 INFO L276 IsEmpty]: Start isEmpty. Operand 12719 states and 39405 transitions. [2019-12-27 20:39:45,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:39:45,298 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:39:45,298 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:39:45,299 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:39:45,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:39:45,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1206429816, now seen corresponding path program 2 times [2019-12-27 20:39:45,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:39:45,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780136116] [2019-12-27 20:39:45,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:39:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:39:45,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:39:45,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780136116] [2019-12-27 20:39:45,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:39:45,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:39:45,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [996762600] [2019-12-27 20:39:45,393 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:39:45,412 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:39:45,671 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 156 states and 259 transitions. [2019-12-27 20:39:45,671 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:39:45,682 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 20:39:45,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:39:45,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:39:45,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:39:45,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:39:45,683 INFO L87 Difference]: Start difference. First operand 12719 states and 39405 transitions. Second operand 7 states. [2019-12-27 20:39:46,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:39:46,132 INFO L93 Difference]: Finished difference Result 34451 states and 105542 transitions. [2019-12-27 20:39:46,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 20:39:46,133 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-27 20:39:46,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:39:46,172 INFO L225 Difference]: With dead ends: 34451 [2019-12-27 20:39:46,172 INFO L226 Difference]: Without dead ends: 25293 [2019-12-27 20:39:46,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 20:39:46,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25293 states. [2019-12-27 20:39:46,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25293 to 15331. [2019-12-27 20:39:46,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15331 states. [2019-12-27 20:39:46,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15331 states to 15331 states and 47433 transitions. [2019-12-27 20:39:46,490 INFO L78 Accepts]: Start accepts. Automaton has 15331 states and 47433 transitions. Word has length 57 [2019-12-27 20:39:46,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:39:46,491 INFO L462 AbstractCegarLoop]: Abstraction has 15331 states and 47433 transitions. [2019-12-27 20:39:46,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:39:46,491 INFO L276 IsEmpty]: Start isEmpty. Operand 15331 states and 47433 transitions. [2019-12-27 20:39:46,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:39:46,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:39:46,507 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:39:46,507 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:39:46,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:39:46,508 INFO L82 PathProgramCache]: Analyzing trace with hash 460584032, now seen corresponding path program 3 times [2019-12-27 20:39:46,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:39:46,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160867415] [2019-12-27 20:39:46,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:39:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:39:46,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:39:46,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160867415] [2019-12-27 20:39:46,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:39:46,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:39:46,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1068754032] [2019-12-27 20:39:46,605 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:39:46,623 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:39:46,828 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 165 states and 270 transitions. [2019-12-27 20:39:46,828 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:39:47,142 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 20:39:47,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 20:39:47,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:39:47,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 20:39:47,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:39:47,144 INFO L87 Difference]: Start difference. First operand 15331 states and 47433 transitions. Second operand 11 states. [2019-12-27 20:39:50,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:39:50,707 INFO L93 Difference]: Finished difference Result 116989 states and 352148 transitions. [2019-12-27 20:39:50,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 20:39:50,708 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2019-12-27 20:39:50,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:39:50,847 INFO L225 Difference]: With dead ends: 116989 [2019-12-27 20:39:50,847 INFO L226 Difference]: Without dead ends: 86117 [2019-12-27 20:39:50,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 18 SyntacticMatches, 10 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=433, Invalid=1729, Unknown=0, NotChecked=0, Total=2162 [2019-12-27 20:39:51,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86117 states. [2019-12-27 20:39:51,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86117 to 21156. [2019-12-27 20:39:51,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21156 states. [2019-12-27 20:39:52,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21156 states to 21156 states and 65869 transitions. [2019-12-27 20:39:52,037 INFO L78 Accepts]: Start accepts. Automaton has 21156 states and 65869 transitions. Word has length 57 [2019-12-27 20:39:52,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:39:52,037 INFO L462 AbstractCegarLoop]: Abstraction has 21156 states and 65869 transitions. [2019-12-27 20:39:52,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 20:39:52,037 INFO L276 IsEmpty]: Start isEmpty. Operand 21156 states and 65869 transitions. [2019-12-27 20:39:52,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:39:52,059 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:39:52,060 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:39:52,060 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:39:52,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:39:52,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1958355418, now seen corresponding path program 4 times [2019-12-27 20:39:52,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:39:52,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977248714] [2019-12-27 20:39:52,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:39:52,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:39:52,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:39:52,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977248714] [2019-12-27 20:39:52,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:39:52,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:39:52,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1297925675] [2019-12-27 20:39:52,138 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:39:52,170 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:39:52,354 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 176 states and 293 transitions. [2019-12-27 20:39:52,354 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:39:52,442 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 20:39:52,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:39:52,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:39:52,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:39:52,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:39:52,444 INFO L87 Difference]: Start difference. First operand 21156 states and 65869 transitions. Second operand 9 states. [2019-12-27 20:39:53,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:39:53,865 INFO L93 Difference]: Finished difference Result 50589 states and 154864 transitions. [2019-12-27 20:39:53,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 20:39:53,866 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-27 20:39:53,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:39:53,935 INFO L225 Difference]: With dead ends: 50589 [2019-12-27 20:39:53,935 INFO L226 Difference]: Without dead ends: 43069 [2019-12-27 20:39:53,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2019-12-27 20:39:54,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43069 states. [2019-12-27 20:39:54,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43069 to 21396. [2019-12-27 20:39:54,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21396 states. [2019-12-27 20:39:54,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21396 states to 21396 states and 66557 transitions. [2019-12-27 20:39:54,826 INFO L78 Accepts]: Start accepts. Automaton has 21396 states and 66557 transitions. Word has length 57 [2019-12-27 20:39:54,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:39:54,826 INFO L462 AbstractCegarLoop]: Abstraction has 21396 states and 66557 transitions. [2019-12-27 20:39:54,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:39:54,827 INFO L276 IsEmpty]: Start isEmpty. Operand 21396 states and 66557 transitions. [2019-12-27 20:39:54,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:39:54,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:39:54,852 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:39:54,852 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:39:54,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:39:54,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1662940808, now seen corresponding path program 5 times [2019-12-27 20:39:54,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:39:54,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090196376] [2019-12-27 20:39:54,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:39:54,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:39:54,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:39:54,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090196376] [2019-12-27 20:39:54,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:39:54,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:39:54,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [546128823] [2019-12-27 20:39:54,961 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:39:54,981 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:39:55,132 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 156 states and 258 transitions. [2019-12-27 20:39:55,132 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:39:55,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:39:55,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:39:55,366 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 20:39:55,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 20:39:55,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:39:55,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 20:39:55,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 20:39:55,367 INFO L87 Difference]: Start difference. First operand 21396 states and 66557 transitions. Second operand 12 states. [2019-12-27 20:39:59,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:39:59,266 INFO L93 Difference]: Finished difference Result 39794 states and 120383 transitions. [2019-12-27 20:39:59,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-27 20:39:59,266 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-12-27 20:39:59,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:39:59,328 INFO L225 Difference]: With dead ends: 39794 [2019-12-27 20:39:59,329 INFO L226 Difference]: Without dead ends: 39794 [2019-12-27 20:39:59,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 41 SyntacticMatches, 7 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=361, Invalid=2089, Unknown=0, NotChecked=0, Total=2450 [2019-12-27 20:39:59,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39794 states. [2019-12-27 20:39:59,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39794 to 26631. [2019-12-27 20:39:59,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26631 states. [2019-12-27 20:39:59,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26631 states to 26631 states and 82617 transitions. [2019-12-27 20:39:59,998 INFO L78 Accepts]: Start accepts. Automaton has 26631 states and 82617 transitions. Word has length 57 [2019-12-27 20:39:59,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:39:59,999 INFO L462 AbstractCegarLoop]: Abstraction has 26631 states and 82617 transitions. [2019-12-27 20:39:59,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 20:39:59,999 INFO L276 IsEmpty]: Start isEmpty. Operand 26631 states and 82617 transitions. [2019-12-27 20:40:00,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:40:00,030 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:40:00,031 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:40:00,031 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:40:00,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:40:00,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1460335274, now seen corresponding path program 6 times [2019-12-27 20:40:00,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:40:00,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406623668] [2019-12-27 20:40:00,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:40:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:40:00,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:40:00,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406623668] [2019-12-27 20:40:00,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:40:00,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:40:00,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [790502657] [2019-12-27 20:40:00,127 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:40:00,143 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:40:00,239 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 128 states and 185 transitions. [2019-12-27 20:40:00,240 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:40:00,272 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 20:40:00,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:40:00,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:40:00,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:40:00,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:40:00,274 INFO L87 Difference]: Start difference. First operand 26631 states and 82617 transitions. Second operand 8 states. [2019-12-27 20:40:01,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:40:01,620 INFO L93 Difference]: Finished difference Result 36376 states and 109358 transitions. [2019-12-27 20:40:01,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 20:40:01,621 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-12-27 20:40:01,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:40:01,694 INFO L225 Difference]: With dead ends: 36376 [2019-12-27 20:40:01,695 INFO L226 Difference]: Without dead ends: 36187 [2019-12-27 20:40:01,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2019-12-27 20:40:01,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36187 states. [2019-12-27 20:40:02,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36187 to 30084. [2019-12-27 20:40:02,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30084 states. [2019-12-27 20:40:02,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30084 states to 30084 states and 92261 transitions. [2019-12-27 20:40:02,484 INFO L78 Accepts]: Start accepts. Automaton has 30084 states and 92261 transitions. Word has length 57 [2019-12-27 20:40:02,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:40:02,484 INFO L462 AbstractCegarLoop]: Abstraction has 30084 states and 92261 transitions. [2019-12-27 20:40:02,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:40:02,484 INFO L276 IsEmpty]: Start isEmpty. Operand 30084 states and 92261 transitions. [2019-12-27 20:40:02,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:40:02,518 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:40:02,518 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:40:02,518 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:40:02,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:40:02,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1853589528, now seen corresponding path program 7 times [2019-12-27 20:40:02,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:40:02,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444068034] [2019-12-27 20:40:02,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:40:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:40:02,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:40:02,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444068034] [2019-12-27 20:40:02,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:40:02,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:40:02,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1793275930] [2019-12-27 20:40:02,601 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:40:02,618 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:40:02,779 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 202 transitions. [2019-12-27 20:40:02,779 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:40:02,971 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-12-27 20:40:03,068 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 20:40:03,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 20:40:03,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:40:03,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 20:40:03,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:40:03,070 INFO L87 Difference]: Start difference. First operand 30084 states and 92261 transitions. Second operand 10 states. [2019-12-27 20:40:05,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:40:05,253 INFO L93 Difference]: Finished difference Result 67052 states and 201869 transitions. [2019-12-27 20:40:05,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 20:40:05,254 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2019-12-27 20:40:05,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:40:05,352 INFO L225 Difference]: With dead ends: 67052 [2019-12-27 20:40:05,352 INFO L226 Difference]: Without dead ends: 66887 [2019-12-27 20:40:05,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=353, Unknown=0, NotChecked=0, Total=506 [2019-12-27 20:40:05,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66887 states. [2019-12-27 20:40:06,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66887 to 37682. [2019-12-27 20:40:06,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37682 states. [2019-12-27 20:40:06,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37682 states to 37682 states and 115601 transitions. [2019-12-27 20:40:06,127 INFO L78 Accepts]: Start accepts. Automaton has 37682 states and 115601 transitions. Word has length 57 [2019-12-27 20:40:06,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:40:06,128 INFO L462 AbstractCegarLoop]: Abstraction has 37682 states and 115601 transitions. [2019-12-27 20:40:06,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 20:40:06,128 INFO L276 IsEmpty]: Start isEmpty. Operand 37682 states and 115601 transitions. [2019-12-27 20:40:06,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:40:06,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:40:06,174 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:40:06,174 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:40:06,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:40:06,174 INFO L82 PathProgramCache]: Analyzing trace with hash 936998466, now seen corresponding path program 8 times [2019-12-27 20:40:06,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:40:06,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151372426] [2019-12-27 20:40:06,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:40:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:40:06,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:40:06,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151372426] [2019-12-27 20:40:06,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:40:06,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 20:40:06,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1604870721] [2019-12-27 20:40:06,357 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:40:06,373 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:40:06,461 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 122 states and 164 transitions. [2019-12-27 20:40:06,461 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:40:06,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:40:06,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:40:06,638 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 20:40:06,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 20:40:06,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:40:06,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 20:40:06,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:40:06,639 INFO L87 Difference]: Start difference. First operand 37682 states and 115601 transitions. Second operand 11 states. [2019-12-27 20:40:09,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:40:09,413 INFO L93 Difference]: Finished difference Result 60042 states and 177450 transitions. [2019-12-27 20:40:09,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 20:40:09,413 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2019-12-27 20:40:09,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:40:09,508 INFO L225 Difference]: With dead ends: 60042 [2019-12-27 20:40:09,509 INFO L226 Difference]: Without dead ends: 59684 [2019-12-27 20:40:09,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 8 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2019-12-27 20:40:09,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59684 states. [2019-12-27 20:40:10,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59684 to 36037. [2019-12-27 20:40:10,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36037 states. [2019-12-27 20:40:10,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36037 states to 36037 states and 108701 transitions. [2019-12-27 20:40:10,270 INFO L78 Accepts]: Start accepts. Automaton has 36037 states and 108701 transitions. Word has length 57 [2019-12-27 20:40:10,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:40:10,270 INFO L462 AbstractCegarLoop]: Abstraction has 36037 states and 108701 transitions. [2019-12-27 20:40:10,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 20:40:10,270 INFO L276 IsEmpty]: Start isEmpty. Operand 36037 states and 108701 transitions. [2019-12-27 20:40:10,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:40:10,310 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:40:10,311 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:40:10,311 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:40:10,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:40:10,311 INFO L82 PathProgramCache]: Analyzing trace with hash -2036427254, now seen corresponding path program 9 times [2019-12-27 20:40:10,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:40:10,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487695412] [2019-12-27 20:40:10,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:40:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:40:10,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:40:10,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487695412] [2019-12-27 20:40:10,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:40:10,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:40:10,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1871379286] [2019-12-27 20:40:10,450 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:40:10,467 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:40:10,733 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 110 states and 148 transitions. [2019-12-27 20:40:10,734 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:40:10,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:40:10,818 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:40:10,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 20:40:10,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:40:10,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 20:40:10,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:40:10,819 INFO L87 Difference]: Start difference. First operand 36037 states and 108701 transitions. Second operand 10 states. [2019-12-27 20:40:12,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:40:12,774 INFO L93 Difference]: Finished difference Result 46137 states and 136679 transitions. [2019-12-27 20:40:12,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 20:40:12,775 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2019-12-27 20:40:12,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:40:12,844 INFO L225 Difference]: With dead ends: 46137 [2019-12-27 20:40:12,844 INFO L226 Difference]: Without dead ends: 46137 [2019-12-27 20:40:12,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=658, Unknown=0, NotChecked=0, Total=812 [2019-12-27 20:40:12,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46137 states. [2019-12-27 20:40:13,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46137 to 35043. [2019-12-27 20:40:13,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35043 states. [2019-12-27 20:40:13,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35043 states to 35043 states and 105855 transitions. [2019-12-27 20:40:13,481 INFO L78 Accepts]: Start accepts. Automaton has 35043 states and 105855 transitions. Word has length 57 [2019-12-27 20:40:13,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:40:13,481 INFO L462 AbstractCegarLoop]: Abstraction has 35043 states and 105855 transitions. [2019-12-27 20:40:13,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 20:40:13,481 INFO L276 IsEmpty]: Start isEmpty. Operand 35043 states and 105855 transitions. [2019-12-27 20:40:13,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:40:13,518 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:40:13,518 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:40:13,518 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:40:13,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:40:13,519 INFO L82 PathProgramCache]: Analyzing trace with hash 658893110, now seen corresponding path program 10 times [2019-12-27 20:40:13,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:40:13,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898791198] [2019-12-27 20:40:13,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:40:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:40:13,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:40:13,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898791198] [2019-12-27 20:40:13,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:40:13,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:40:13,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1909047400] [2019-12-27 20:40:13,649 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:40:13,666 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:40:14,031 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 233 states and 398 transitions. [2019-12-27 20:40:14,031 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:40:14,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:40:14,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:40:14,459 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 29 times. [2019-12-27 20:40:14,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 20:40:14,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:40:14,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 20:40:14,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-12-27 20:40:14,461 INFO L87 Difference]: Start difference. First operand 35043 states and 105855 transitions. Second operand 15 states. [2019-12-27 20:40:19,441 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-12-27 20:40:19,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:40:19,999 INFO L93 Difference]: Finished difference Result 96526 states and 285805 transitions. [2019-12-27 20:40:19,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-27 20:40:19,999 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2019-12-27 20:40:20,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:40:20,148 INFO L225 Difference]: With dead ends: 96526 [2019-12-27 20:40:20,148 INFO L226 Difference]: Without dead ends: 96312 [2019-12-27 20:40:20,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 26 SyntacticMatches, 11 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 906 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=590, Invalid=2166, Unknown=0, NotChecked=0, Total=2756 [2019-12-27 20:40:20,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96312 states. [2019-12-27 20:40:21,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96312 to 33670. [2019-12-27 20:40:21,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33670 states. [2019-12-27 20:40:21,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33670 states to 33670 states and 101429 transitions. [2019-12-27 20:40:21,145 INFO L78 Accepts]: Start accepts. Automaton has 33670 states and 101429 transitions. Word has length 57 [2019-12-27 20:40:21,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:40:21,145 INFO L462 AbstractCegarLoop]: Abstraction has 33670 states and 101429 transitions. [2019-12-27 20:40:21,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 20:40:21,145 INFO L276 IsEmpty]: Start isEmpty. Operand 33670 states and 101429 transitions. [2019-12-27 20:40:21,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 20:40:21,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:40:21,185 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:40:21,185 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:40:21,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:40:21,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1429885570, now seen corresponding path program 11 times [2019-12-27 20:40:21,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:40:21,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522582348] [2019-12-27 20:40:21,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:40:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:40:21,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:40:21,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522582348] [2019-12-27 20:40:21,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:40:21,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:40:21,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [478318632] [2019-12-27 20:40:21,253 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:40:21,269 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:40:21,773 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 199 states and 325 transitions. [2019-12-27 20:40:21,773 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:40:21,774 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:40:21,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:40:21,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:40:21,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:40:21,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:40:21,778 INFO L87 Difference]: Start difference. First operand 33670 states and 101429 transitions. Second operand 3 states. [2019-12-27 20:40:21,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:40:21,977 INFO L93 Difference]: Finished difference Result 33668 states and 101424 transitions. [2019-12-27 20:40:21,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:40:21,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-27 20:40:21,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:40:22,046 INFO L225 Difference]: With dead ends: 33668 [2019-12-27 20:40:22,046 INFO L226 Difference]: Without dead ends: 33668 [2019-12-27 20:40:22,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:40:22,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33668 states. [2019-12-27 20:40:22,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33668 to 31403. [2019-12-27 20:40:22,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31403 states. [2019-12-27 20:40:22,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31403 states to 31403 states and 95608 transitions. [2019-12-27 20:40:22,642 INFO L78 Accepts]: Start accepts. Automaton has 31403 states and 95608 transitions. Word has length 57 [2019-12-27 20:40:22,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:40:22,643 INFO L462 AbstractCegarLoop]: Abstraction has 31403 states and 95608 transitions. [2019-12-27 20:40:22,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:40:22,643 INFO L276 IsEmpty]: Start isEmpty. Operand 31403 states and 95608 transitions. [2019-12-27 20:40:22,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 20:40:22,676 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:40:22,677 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:40:22,677 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:40:22,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:40:22,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1032397913, now seen corresponding path program 1 times [2019-12-27 20:40:22,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:40:22,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964070666] [2019-12-27 20:40:22,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:40:22,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:40:22,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:40:22,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964070666] [2019-12-27 20:40:22,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:40:22,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:40:22,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [254960707] [2019-12-27 20:40:22,743 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:40:22,763 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:40:22,897 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 129 states and 168 transitions. [2019-12-27 20:40:22,897 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:40:22,898 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:40:22,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:40:22,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:40:22,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:40:22,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:40:22,899 INFO L87 Difference]: Start difference. First operand 31403 states and 95608 transitions. Second operand 3 states. [2019-12-27 20:40:23,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:40:23,010 INFO L93 Difference]: Finished difference Result 25641 states and 77533 transitions. [2019-12-27 20:40:23,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:40:23,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 20:40:23,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:40:23,045 INFO L225 Difference]: With dead ends: 25641 [2019-12-27 20:40:23,046 INFO L226 Difference]: Without dead ends: 25641 [2019-12-27 20:40:23,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:40:23,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25641 states. [2019-12-27 20:40:23,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25641 to 25120. [2019-12-27 20:40:23,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25120 states. [2019-12-27 20:40:23,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25120 states to 25120 states and 75965 transitions. [2019-12-27 20:40:23,603 INFO L78 Accepts]: Start accepts. Automaton has 25120 states and 75965 transitions. Word has length 58 [2019-12-27 20:40:23,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:40:23,603 INFO L462 AbstractCegarLoop]: Abstraction has 25120 states and 75965 transitions. [2019-12-27 20:40:23,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:40:23,604 INFO L276 IsEmpty]: Start isEmpty. Operand 25120 states and 75965 transitions. [2019-12-27 20:40:23,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 20:40:23,634 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:40:23,634 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:40:23,635 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:40:23,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:40:23,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1074141970, now seen corresponding path program 1 times [2019-12-27 20:40:23,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:40:23,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851733494] [2019-12-27 20:40:23,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:40:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:40:23,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:40:23,752 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:40:23,752 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:40:23,757 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_77| 0 0))) (and (= 0 v_~y$w_buff0~0_26) (= v_~x~0_11 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$read_delayed_var~0.base_4) (= 0 v_~y$read_delayed_var~0.offset_4) (= 0 v_~__unbuffered_p1_EAX~0_15) (= v_~y$r_buff0_thd1~0_10 0) (= 0 v_~__unbuffered_p0_EAX~0_15) (= 0 v_~y$w_buff1~0_24) (= v_~main$tmp_guard0~0_9 0) (= v_~a~0_11 0) (< 0 |v_#StackHeapBarrier_22|) (= |v_#NULL.offset_6| 0) (= |v_#valid_75| (store .cse0 |v_ULTIMATE.start_main_~#t693~0.base_24| 1)) (= 0 v_~__unbuffered_p3_EAX~0_14) (= v_~y$w_buff0_used~0_103 0) (= 0 v_~weak$$choice2~0_34) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t693~0.base_24|) (= 0 v_~y$r_buff1_thd4~0_19) (= v_~y$read_delayed~0_6 0) (= 0 |v_ULTIMATE.start_main_~#t693~0.offset_19|) (= v_~y~0_24 0) (= v_~y$r_buff0_thd3~0_28 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t693~0.base_24|)) (= v_~y$r_buff0_thd2~0_68 0) (= 0 v_~y$flush_delayed~0_13) (= v_~y$r_buff0_thd4~0_21 0) (= v_~y$r_buff1_thd1~0_9 0) (= v_~y$r_buff0_thd0~0_19 0) (= v_~z~0_16 0) (= 0 |v_#NULL.base_6|) (= 0 v_~y$r_buff1_thd0~0_21) (= 0 v_~__unbuffered_cnt~0_27) (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t693~0.base_24| 4) |v_#length_31|) (= v_~main$tmp_guard1~0_14 0) (= 0 v_~__unbuffered_p3_EBX~0_14) (= v_~y$w_buff1_used~0_67 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t693~0.base_24| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t693~0.base_24|) |v_ULTIMATE.start_main_~#t693~0.offset_19| 0)) |v_#memory_int_25|) (= v_~y$mem_tmp~0_10 0) (= 0 v_~y$r_buff1_thd3~0_19) (= 0 v_~y$r_buff1_thd2~0_43))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_77|, #memory_int=|v_#memory_int_26|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_21|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_13|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~a~0=v_~a~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ULTIMATE.start_main_~#t693~0.offset=|v_ULTIMATE.start_main_~#t693~0.offset_19|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, #length=|v_#length_31|, ULTIMATE.start_main_~#t696~0.offset=|v_ULTIMATE.start_main_~#t696~0.offset_16|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_9|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_4, ULTIMATE.start_main_~#t695~0.offset=|v_ULTIMATE.start_main_~#t695~0.offset_16|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_68, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ULTIMATE.start_main_~#t693~0.base=|v_ULTIMATE.start_main_~#t693~0.base_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_21, ~x~0=v_~x~0_11, ULTIMATE.start_main_~#t694~0.base=|v_ULTIMATE.start_main_~#t694~0.base_26|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_4, ULTIMATE.start_main_~#t694~0.offset=|v_ULTIMATE.start_main_~#t694~0.offset_20|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_9, ~y$w_buff0~0=v_~y$w_buff0~0_26, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_28, ~y~0=v_~y~0_24, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, ULTIMATE.start_main_~#t695~0.base=|v_ULTIMATE.start_main_~#t695~0.base_22|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_43, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_21, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_19, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_10|, ULTIMATE.start_main_~#t696~0.base=|v_ULTIMATE.start_main_~#t696~0.base_19|, ~z~0=v_~z~0_16, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t693~0.offset, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t696~0.offset, ULTIMATE.start_main_#t~nondet41, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t695~0.offset, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t693~0.base, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t694~0.base, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t694~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t695~0.base, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t696~0.base, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 20:40:23,758 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L843-1-->L845: Formula: (and (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t694~0.base_13| 1) |v_#valid_46|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t694~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t694~0.offset_11|) (not (= |v_ULTIMATE.start_main_~#t694~0.base_13| 0)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t694~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t694~0.base_13|) |v_ULTIMATE.start_main_~#t694~0.offset_11| 1)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t694~0.base_13|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t694~0.base_13| 4) |v_#length_23|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t694~0.base=|v_ULTIMATE.start_main_~#t694~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t694~0.offset=|v_ULTIMATE.start_main_~#t694~0.offset_11|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t694~0.base, ULTIMATE.start_main_~#t694~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 20:40:23,759 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L845-1-->L847: Formula: (and (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t695~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t695~0.base_11| 0)) (= |v_ULTIMATE.start_main_~#t695~0.offset_9| 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t695~0.base_11| 4)) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t695~0.base_11|) 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t695~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t695~0.base_11|) |v_ULTIMATE.start_main_~#t695~0.offset_9| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t695~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t695~0.offset=|v_ULTIMATE.start_main_~#t695~0.offset_9|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t695~0.base=|v_ULTIMATE.start_main_~#t695~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t695~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t695~0.base] because there is no mapped edge [2019-12-27 20:40:23,760 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L797: Formula: (and (= 1 v_~z~0_6) (= v_~y$r_buff1_thd1~0_4 v_~y$r_buff0_thd1~0_4) (= v_~y$r_buff0_thd2~0_49 v_~y$r_buff1_thd2~0_28) (= v_~y$r_buff0_thd0~0_14 v_~y$r_buff1_thd0~0_11) (= v_~y$r_buff0_thd3~0_16 1) (= v_~y$r_buff0_thd3~0_17 v_~y$r_buff1_thd3~0_13) (= v_~y$r_buff0_thd4~0_15 v_~y$r_buff1_thd4~0_12) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_6 0))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_15, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_17, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_14, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_49, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_6} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_28, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_15, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_4, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_12, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_13, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_16, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_14, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_49, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_6, ~z~0=v_~z~0_6, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_11} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 20:40:23,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L847-1-->L849: Formula: (and (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t696~0.base_9| 1)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t696~0.base_9| 4) |v_#length_17|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t696~0.base_9|) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t696~0.base_9|)) (not (= 0 |v_ULTIMATE.start_main_~#t696~0.base_9|)) (= |v_ULTIMATE.start_main_~#t696~0.offset_8| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t696~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t696~0.base_9|) |v_ULTIMATE.start_main_~#t696~0.offset_8| 3)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t696~0.offset=|v_ULTIMATE.start_main_~#t696~0.offset_8|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t696~0.base=|v_ULTIMATE.start_main_~#t696~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t696~0.offset, ULTIMATE.start_main_#t~nondet40, #valid, #memory_int, #length, ULTIMATE.start_main_~#t696~0.base] because there is no mapped edge [2019-12-27 20:40:23,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] P0ENTRY-->P0EXIT: Formula: (and (= v_~__unbuffered_p0_EAX~0_6 v_~x~0_7) (= 1 v_~a~0_7) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_7} OutVars{~a~0=v_~a~0_7, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_7, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 20:40:23,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L762-->L762-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1482584850 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork2_#t~ite11_Out1482584850| |P1Thread1of1ForFork2_#t~ite12_Out1482584850|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1482584850 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In1482584850 256)) (and (= 0 (mod ~y$w_buff1_used~0_In1482584850 256)) .cse1) (and (= (mod ~y$r_buff1_thd2~0_In1482584850 256) 0) .cse1))) (= ~y$w_buff1~0_In1482584850 |P1Thread1of1ForFork2_#t~ite11_Out1482584850|)) (and (= |P1Thread1of1ForFork2_#t~ite11_In1482584850| |P1Thread1of1ForFork2_#t~ite11_Out1482584850|) (not .cse0) (= ~y$w_buff1~0_In1482584850 |P1Thread1of1ForFork2_#t~ite12_Out1482584850|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1482584850, ~y$w_buff1~0=~y$w_buff1~0_In1482584850, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1482584850, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1482584850, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In1482584850|, ~weak$$choice2~0=~weak$$choice2~0_In1482584850, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1482584850} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1482584850, ~y$w_buff1~0=~y$w_buff1~0_In1482584850, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1482584850, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1482584850, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1482584850|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1482584850|, ~weak$$choice2~0=~weak$$choice2~0_In1482584850, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1482584850} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 20:40:23,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-555780603 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite15_Out-555780603| ~y$w_buff0_used~0_In-555780603) (= |P1Thread1of1ForFork2_#t~ite14_In-555780603| |P1Thread1of1ForFork2_#t~ite14_Out-555780603|) (not .cse0)) (and (= ~y$w_buff0_used~0_In-555780603 |P1Thread1of1ForFork2_#t~ite14_Out-555780603|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-555780603 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-555780603 256)) (and (= 0 (mod ~y$w_buff1_used~0_In-555780603 256)) .cse1) (and (= (mod ~y$r_buff1_thd2~0_In-555780603 256) 0) .cse1))) (= |P1Thread1of1ForFork2_#t~ite15_Out-555780603| |P1Thread1of1ForFork2_#t~ite14_Out-555780603|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-555780603, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-555780603, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-555780603, ~weak$$choice2~0=~weak$$choice2~0_In-555780603, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In-555780603|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-555780603} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-555780603, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-555780603, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-555780603, ~weak$$choice2~0=~weak$$choice2~0_In-555780603, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-555780603|, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out-555780603|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-555780603} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 20:40:23,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L764-->L764-8: Formula: (let ((.cse4 (= |P1Thread1of1ForFork2_#t~ite17_Out1473214401| |P1Thread1of1ForFork2_#t~ite18_Out1473214401|)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In1473214401 256))) (.cse6 (= 0 (mod ~y$r_buff0_thd2~0_In1473214401 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1473214401 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1473214401 256))) (.cse5 (= (mod ~weak$$choice2~0_In1473214401 256) 0))) (or (let ((.cse1 (not .cse6))) (and (= |P1Thread1of1ForFork2_#t~ite16_Out1473214401| 0) (or (not .cse0) .cse1) (= |P1Thread1of1ForFork2_#t~ite16_Out1473214401| |P1Thread1of1ForFork2_#t~ite17_Out1473214401|) (not .cse2) (or .cse1 (not .cse3)) .cse4 .cse5)) (and (or (and (= ~y$w_buff1_used~0_In1473214401 |P1Thread1of1ForFork2_#t~ite18_Out1473214401|) (not .cse5) (= |P1Thread1of1ForFork2_#t~ite17_Out1473214401| |P1Thread1of1ForFork2_#t~ite17_In1473214401|)) (and .cse4 (= ~y$w_buff1_used~0_In1473214401 |P1Thread1of1ForFork2_#t~ite17_Out1473214401|) (or (and .cse6 .cse3) (and .cse6 .cse0) .cse2) .cse5)) (= |P1Thread1of1ForFork2_#t~ite16_In1473214401| |P1Thread1of1ForFork2_#t~ite16_Out1473214401|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1473214401, P1Thread1of1ForFork2_#t~ite17=|P1Thread1of1ForFork2_#t~ite17_In1473214401|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1473214401, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1473214401, ~weak$$choice2~0=~weak$$choice2~0_In1473214401, P1Thread1of1ForFork2_#t~ite16=|P1Thread1of1ForFork2_#t~ite16_In1473214401|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1473214401} OutVars{P1Thread1of1ForFork2_#t~ite18=|P1Thread1of1ForFork2_#t~ite18_Out1473214401|, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1473214401, P1Thread1of1ForFork2_#t~ite17=|P1Thread1of1ForFork2_#t~ite17_Out1473214401|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1473214401, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1473214401, ~weak$$choice2~0=~weak$$choice2~0_In1473214401, P1Thread1of1ForFork2_#t~ite16=|P1Thread1of1ForFork2_#t~ite16_Out1473214401|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1473214401} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite18, P1Thread1of1ForFork2_#t~ite17, P1Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-27 20:40:23,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L765-->L766: Formula: (and (= v_~y$r_buff0_thd2~0_37 v_~y$r_buff0_thd2~0_36) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_7|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_36, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_7|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 20:40:23,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L766-->L766-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In2141111179 256)))) (or (and (= ~y$r_buff1_thd2~0_In2141111179 |P1Thread1of1ForFork2_#t~ite23_Out2141111179|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In2141111179 256)))) (or (and (= (mod ~y$r_buff1_thd2~0_In2141111179 256) 0) .cse0) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In2141111179 256))) (= 0 (mod ~y$w_buff0_used~0_In2141111179 256)))) .cse1 (= |P1Thread1of1ForFork2_#t~ite23_Out2141111179| |P1Thread1of1ForFork2_#t~ite24_Out2141111179|)) (and (not .cse1) (= ~y$r_buff1_thd2~0_In2141111179 |P1Thread1of1ForFork2_#t~ite24_Out2141111179|) (= |P1Thread1of1ForFork2_#t~ite23_In2141111179| |P1Thread1of1ForFork2_#t~ite23_Out2141111179|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2141111179, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2141111179, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2141111179, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In2141111179|, ~weak$$choice2~0=~weak$$choice2~0_In2141111179, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2141111179} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2141111179, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2141111179, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2141111179, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out2141111179|, ~weak$$choice2~0=~weak$$choice2~0_In2141111179, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out2141111179|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2141111179} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-27 20:40:23,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L768-->L776: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_18 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~y~0=v_~y~0_18, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 20:40:23,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L820-2-->L820-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd4~0_In-80092699 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-80092699 256) 0)) (.cse1 (= |P3Thread1of1ForFork0_#t~ite33_Out-80092699| |P3Thread1of1ForFork0_#t~ite32_Out-80092699|))) (or (and (not .cse0) (= ~y$w_buff1~0_In-80092699 |P3Thread1of1ForFork0_#t~ite32_Out-80092699|) .cse1 (not .cse2)) (and (or .cse0 .cse2) .cse1 (= ~y~0_In-80092699 |P3Thread1of1ForFork0_#t~ite32_Out-80092699|)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-80092699, ~y$w_buff1~0=~y$w_buff1~0_In-80092699, ~y~0=~y~0_In-80092699, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-80092699} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-80092699, ~y$w_buff1~0=~y$w_buff1~0_In-80092699, ~y~0=~y~0_In-80092699, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out-80092699|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out-80092699|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-80092699} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-27 20:40:23,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In732010046 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In732010046 256)))) (or (and (not .cse0) (= |P3Thread1of1ForFork0_#t~ite34_Out732010046| 0) (not .cse1)) (and (= |P3Thread1of1ForFork0_#t~ite34_Out732010046| ~y$w_buff0_used~0_In732010046) (or .cse0 .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In732010046, ~y$w_buff0_used~0=~y$w_buff0_used~0_In732010046} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In732010046, ~y$w_buff0_used~0=~y$w_buff0_used~0_In732010046, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out732010046|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-27 20:40:23,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L822-->L822-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd4~0_In1496996270 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1496996270 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1496996270 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In1496996270 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite35_Out1496996270| ~y$w_buff1_used~0_In1496996270) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P3Thread1of1ForFork0_#t~ite35_Out1496996270| 0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1496996270, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1496996270, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1496996270, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1496996270} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1496996270, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1496996270, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1496996270, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out1496996270|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1496996270} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-27 20:40:23,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In-1221459286 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1221459286 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite36_Out-1221459286| 0) (not .cse0) (not .cse1)) (and (= |P3Thread1of1ForFork0_#t~ite36_Out-1221459286| ~y$r_buff0_thd4~0_In-1221459286) (or .cse1 .cse0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1221459286, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1221459286} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1221459286, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1221459286, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out-1221459286|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-27 20:40:23,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-->L824-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-1131135544 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd4~0_In-1131135544 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1131135544 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In-1131135544 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite37_Out-1131135544| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P3Thread1of1ForFork0_#t~ite37_Out-1131135544| ~y$r_buff1_thd4~0_In-1131135544) (or .cse1 .cse0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1131135544, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1131135544, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1131135544, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1131135544} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1131135544, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1131135544, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1131135544, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out-1131135544|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1131135544} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-27 20:40:23,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L824-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_23 1) v_~__unbuffered_cnt~0_22) (= |v_P3Thread1of1ForFork0_#t~ite37_8| v_~y$r_buff1_thd4~0_16) (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_23} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_16, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_7|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 20:40:23,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1283043215 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-1283043215 256) 0))) (or (and (= |P2Thread1of1ForFork3_#t~ite28_Out-1283043215| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork3_#t~ite28_Out-1283043215| ~y$w_buff0_used~0_In-1283043215)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1283043215, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1283043215} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1283043215, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1283043215, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out-1283043215|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-27 20:40:23,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1735013765 256))) (.cse0 (= (mod ~y$r_buff1_thd3~0_In1735013765 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In1735013765 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1735013765 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork3_#t~ite29_Out1735013765|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P2Thread1of1ForFork3_#t~ite29_Out1735013765| ~y$w_buff1_used~0_In1735013765)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1735013765, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1735013765, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1735013765, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1735013765} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1735013765, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1735013765, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1735013765, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out1735013765|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1735013765} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-27 20:40:23,776 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L800-->L801: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-2021714059 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2021714059 256)))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd3~0_Out-2021714059 0)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd3~0_In-2021714059 ~y$r_buff0_thd3~0_Out-2021714059)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2021714059, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2021714059} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out-2021714059|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2021714059, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-2021714059} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 20:40:23,776 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1567406594 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1567406594 256))) (.cse2 (= (mod ~y$r_buff1_thd3~0_In1567406594 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1567406594 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork3_#t~ite31_Out1567406594| ~y$r_buff1_thd3~0_In1567406594)) (and (= |P2Thread1of1ForFork3_#t~ite31_Out1567406594| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1567406594, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1567406594, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1567406594, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1567406594} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1567406594, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1567406594, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1567406594, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out1567406594|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1567406594} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-27 20:40:23,776 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L801-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|) (= |v_P2Thread1of1ForFork3_#t~ite31_8| v_~y$r_buff1_thd3~0_15) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_5|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-27 20:40:23,776 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L849-1-->L855: Formula: (and (= 4 v_~__unbuffered_cnt~0_11) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 20:40:23,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L855-2-->L855-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1995701809 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1995701809 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-1995701809| ~y$w_buff1~0_In-1995701809)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite42_Out-1995701809| ~y~0_In-1995701809)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1995701809, ~y~0=~y~0_In-1995701809, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1995701809, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1995701809} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1995701809, ~y~0=~y~0_In-1995701809, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1995701809|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1995701809, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1995701809} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 20:40:23,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L855-4-->L856: Formula: (= v_~y~0_15 |v_ULTIMATE.start_main_#t~ite42_8|) InVars {ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} OutVars{ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_7|, ~y~0=v_~y~0_15, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 20:40:23,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L856-->L856-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-528331381 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-528331381 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-528331381| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-528331381| ~y$w_buff0_used~0_In-528331381)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-528331381, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-528331381} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-528331381, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-528331381, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-528331381|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 20:40:23,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L857-->L857-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-786259403 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-786259403 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-786259403 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-786259403 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-786259403 |ULTIMATE.start_main_#t~ite45_Out-786259403|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-786259403|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-786259403, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-786259403, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-786259403, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-786259403} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-786259403, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-786259403, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-786259403, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-786259403|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-786259403} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 20:40:23,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L858-->L858-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1833347901 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1833347901 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite46_Out-1833347901| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite46_Out-1833347901| ~y$r_buff0_thd0~0_In-1833347901) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1833347901, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1833347901} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1833347901, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1833347901, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1833347901|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 20:40:23,780 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L859-->L859-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1059309894 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1059309894 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In1059309894 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1059309894 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In1059309894 |ULTIMATE.start_main_#t~ite47_Out1059309894|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite47_Out1059309894| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1059309894, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1059309894, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1059309894, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1059309894} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1059309894, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1059309894, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1059309894|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1059309894, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1059309894} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 20:40:23,780 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z~0_12 2) (= v_~main$tmp_guard1~0_10 0) (= |v_ULTIMATE.start_main_#t~ite47_15| v_~y$r_buff1_thd0~0_17) (= 0 v_~__unbuffered_p1_EAX~0_11) (= 0 v_~__unbuffered_p0_EAX~0_11) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= 2 v_~__unbuffered_p3_EAX~0_10) (= 0 v_~__unbuffered_p3_EBX~0_10) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_10 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_15|, ~z~0=v_~z~0_12, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_14|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~z~0=v_~z~0_12, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_17, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:40:23,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:40:23 BasicIcfg [2019-12-27 20:40:23,892 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:40:23,894 INFO L168 Benchmark]: Toolchain (without parser) took 175192.89 ms. Allocated memory was 138.9 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 101.6 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-27 20:40:23,894 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 138.9 MB. Free memory is still 120.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 20:40:23,895 INFO L168 Benchmark]: CACSL2BoogieTranslator took 769.49 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 101.1 MB in the beginning and 157.0 MB in the end (delta: -55.8 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2019-12-27 20:40:23,895 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.93 ms. Allocated memory is still 203.4 MB. Free memory was 157.0 MB in the beginning and 154.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 20:40:23,896 INFO L168 Benchmark]: Boogie Preprocessor took 38.27 ms. Allocated memory is still 203.4 MB. Free memory was 154.9 MB in the beginning and 152.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 20:40:23,900 INFO L168 Benchmark]: RCFGBuilder took 843.19 ms. Allocated memory is still 203.4 MB. Free memory was 152.0 MB in the beginning and 102.3 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:40:23,901 INFO L168 Benchmark]: TraceAbstraction took 173466.15 ms. Allocated memory was 203.4 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 102.3 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 20:40:23,908 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 138.9 MB. Free memory is still 120.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 769.49 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 101.1 MB in the beginning and 157.0 MB in the end (delta: -55.8 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.93 ms. Allocated memory is still 203.4 MB. Free memory was 157.0 MB in the beginning and 154.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.27 ms. Allocated memory is still 203.4 MB. Free memory was 154.9 MB in the beginning and 152.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 843.19 ms. Allocated memory is still 203.4 MB. Free memory was 152.0 MB in the beginning and 102.3 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 173466.15 ms. Allocated memory was 203.4 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 102.3 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 181 ProgramPointsBefore, 89 ProgramPointsAfterwards, 209 TransitionsBefore, 94 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 28 ChoiceCompositions, 7757 VarBasedMoverChecksPositive, 195 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 68785 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L843] FCALL, FORK 0 pthread_create(&t693, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L845] FCALL, FORK 0 pthread_create(&t694, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L847] FCALL, FORK 0 pthread_create(&t695, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 3 y$w_buff1 = y$w_buff0 [L782] 3 y$w_buff0 = 1 [L783] 3 y$w_buff1_used = y$w_buff0_used [L784] 3 y$w_buff0_used = (_Bool)1 [L849] FCALL, FORK 0 pthread_create(&t696, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 4 z = 2 [L814] 4 __unbuffered_p3_EAX = z [L817] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L820] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 2 x = 1 [L756] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 2 y$flush_delayed = weak$$choice2 [L759] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L761] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L761] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L762] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L763] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L764] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L767] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L820] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L821] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L822] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L823] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L797] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L797] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L798] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L799] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L855] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 173.1s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 49.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4844 SDtfs, 7767 SDslu, 15788 SDs, 0 SdLazy, 15541 SolverSat, 633 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 557 GetRequests, 184 SyntacticMatches, 58 SemanticMatches, 315 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2735 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227148occurred 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: 73.8s AutomataMinimizationTime, 23 MinimizatonAttempts, 311032 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1048 NumberOfCodeBlocks, 1048 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 966 ConstructedInterpolants, 0 QuantifiedInterpolants, 145504 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...