/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 19:04:40,345 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 19:04:40,347 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 19:04:40,360 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 19:04:40,360 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 19:04:40,361 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 19:04:40,362 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 19:04:40,365 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 19:04:40,367 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 19:04:40,368 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 19:04:40,370 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 19:04:40,376 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 19:04:40,376 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 19:04:40,377 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 19:04:40,379 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 19:04:40,380 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 19:04:40,381 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 19:04:40,382 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 19:04:40,385 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 19:04:40,386 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 19:04:40,389 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 19:04:40,395 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 19:04:40,397 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 19:04:40,398 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 19:04:40,400 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 19:04:40,400 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 19:04:40,400 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 19:04:40,401 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 19:04:40,402 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 19:04:40,403 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 19:04:40,404 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 19:04:40,405 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 19:04:40,406 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 19:04:40,407 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 19:04:40,409 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 19:04:40,409 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 19:04:40,410 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 19:04:40,410 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 19:04:40,410 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 19:04:40,411 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 19:04:40,411 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 19:04:40,412 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 19:04:40,426 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 19:04:40,427 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 19:04:40,428 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 19:04:40,428 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 19:04:40,428 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 19:04:40,429 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 19:04:40,429 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 19:04:40,429 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 19:04:40,429 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 19:04:40,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 19:04:40,430 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 19:04:40,430 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 19:04:40,430 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 19:04:40,430 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 19:04:40,430 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 19:04:40,431 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 19:04:40,431 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 19:04:40,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 19:04:40,431 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 19:04:40,431 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 19:04:40,432 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 19:04:40,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 19:04:40,432 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 19:04:40,432 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 19:04:40,433 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 19:04:40,433 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 19:04:40,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 19:04:40,433 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 19:04:40,433 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 19:04:40,706 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 19:04:40,719 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 19:04:40,722 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 19:04:40,724 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 19:04:40,724 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 19:04:40,725 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_rmo.oepc.i [2019-12-18 19:04:40,802 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d73f9166f/48bce39b447b402d91bebe5464d3246c/FLAG15b71c3b8 [2019-12-18 19:04:41,340 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 19:04:41,341 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_rmo.oepc.i [2019-12-18 19:04:41,364 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d73f9166f/48bce39b447b402d91bebe5464d3246c/FLAG15b71c3b8 [2019-12-18 19:04:41,676 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d73f9166f/48bce39b447b402d91bebe5464d3246c [2019-12-18 19:04:41,686 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 19:04:41,687 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 19:04:41,689 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 19:04:41,689 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 19:04:41,692 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 19:04:41,693 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:04:41" (1/1) ... [2019-12-18 19:04:41,696 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bdf7b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:41, skipping insertion in model container [2019-12-18 19:04:41,697 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:04:41" (1/1) ... [2019-12-18 19:04:41,704 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 19:04:41,765 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 19:04:42,324 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:04:42,336 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 19:04:42,434 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:04:42,515 INFO L208 MainTranslator]: Completed translation [2019-12-18 19:04:42,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:42 WrapperNode [2019-12-18 19:04:42,517 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 19:04:42,518 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 19:04:42,518 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 19:04:42,518 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 19:04:42,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:42" (1/1) ... [2019-12-18 19:04:42,552 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:42" (1/1) ... [2019-12-18 19:04:42,598 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 19:04:42,599 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 19:04:42,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 19:04:42,601 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 19:04:42,611 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:42" (1/1) ... [2019-12-18 19:04:42,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:42" (1/1) ... [2019-12-18 19:04:42,616 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:42" (1/1) ... [2019-12-18 19:04:42,616 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:42" (1/1) ... [2019-12-18 19:04:42,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:42" (1/1) ... [2019-12-18 19:04:42,631 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:42" (1/1) ... [2019-12-18 19:04:42,634 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:42" (1/1) ... [2019-12-18 19:04:42,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 19:04:42,640 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 19:04:42,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 19:04:42,641 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 19:04:42,642 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:42" (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-18 19:04:42,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 19:04:42,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 19:04:42,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 19:04:42,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 19:04:42,717 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 19:04:42,717 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 19:04:42,718 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 19:04:42,718 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 19:04:42,718 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 19:04:42,718 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 19:04:42,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 19:04:42,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 19:04:42,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 19:04:42,721 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 19:04:43,491 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 19:04:43,491 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 19:04:43,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:04:43 BoogieIcfgContainer [2019-12-18 19:04:43,493 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 19:04:43,494 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 19:04:43,494 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 19:04:43,498 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 19:04:43,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 07:04:41" (1/3) ... [2019-12-18 19:04:43,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4562210e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:04:43, skipping insertion in model container [2019-12-18 19:04:43,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:04:42" (2/3) ... [2019-12-18 19:04:43,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4562210e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:04:43, skipping insertion in model container [2019-12-18 19:04:43,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:04:43" (3/3) ... [2019-12-18 19:04:43,502 INFO L109 eAbstractionObserver]: Analyzing ICFG safe030_rmo.oepc.i [2019-12-18 19:04:43,511 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 19:04:43,511 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 19:04:43,519 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 19:04:43,520 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 19:04:43,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,557 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,557 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,558 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,558 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,559 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,567 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,567 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,594 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,594 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,605 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,605 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,606 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,609 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,610 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,613 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,613 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:04:43,629 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 19:04:43,645 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 19:04:43,645 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 19:04:43,645 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 19:04:43,645 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 19:04:43,646 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 19:04:43,646 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 19:04:43,646 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 19:04:43,646 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 19:04:43,663 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 210 transitions [2019-12-18 19:04:43,665 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-18 19:04:43,752 INFO L126 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-18 19:04:43,753 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:04:43,774 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 9/167 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 19:04:43,804 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-18 19:04:43,851 INFO L126 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-18 19:04:43,851 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:04:43,861 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 9/167 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 19:04:43,884 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-18 19:04:43,885 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 19:04:48,588 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 19:04:48,729 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 19:04:48,756 INFO L206 etLargeBlockEncoding]: Checked pairs total: 79634 [2019-12-18 19:04:48,756 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-18 19:04:48,760 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-18 19:05:05,529 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115670 states. [2019-12-18 19:05:05,531 INFO L276 IsEmpty]: Start isEmpty. Operand 115670 states. [2019-12-18 19:05:05,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 19:05:05,538 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:05,538 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 19:05:05,539 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:05:05,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:05,543 INFO L82 PathProgramCache]: Analyzing trace with hash 839588, now seen corresponding path program 1 times [2019-12-18 19:05:05,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:05,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040379695] [2019-12-18 19:05:05,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:05,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:05,849 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-18 19:05:05,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040379695] [2019-12-18 19:05:05,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:05,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:05:05,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326665331] [2019-12-18 19:05:05,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:05:05,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:05,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:05:05,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:05:05,875 INFO L87 Difference]: Start difference. First operand 115670 states. Second operand 3 states. [2019-12-18 19:05:10,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:10,088 INFO L93 Difference]: Finished difference Result 115280 states and 496088 transitions. [2019-12-18 19:05:10,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:05:10,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 19:05:10,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:10,884 INFO L225 Difference]: With dead ends: 115280 [2019-12-18 19:05:10,885 INFO L226 Difference]: Without dead ends: 112928 [2019-12-18 19:05:10,889 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-18 19:05:15,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112928 states. [2019-12-18 19:05:17,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112928 to 112928. [2019-12-18 19:05:17,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112928 states. [2019-12-18 19:05:22,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112928 states to 112928 states and 486484 transitions. [2019-12-18 19:05:22,697 INFO L78 Accepts]: Start accepts. Automaton has 112928 states and 486484 transitions. Word has length 3 [2019-12-18 19:05:22,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:22,697 INFO L462 AbstractCegarLoop]: Abstraction has 112928 states and 486484 transitions. [2019-12-18 19:05:22,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:05:22,697 INFO L276 IsEmpty]: Start isEmpty. Operand 112928 states and 486484 transitions. [2019-12-18 19:05:22,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 19:05:22,702 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:22,702 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:05:22,702 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:05:22,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:22,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1760802055, now seen corresponding path program 1 times [2019-12-18 19:05:22,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:22,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284671430] [2019-12-18 19:05:22,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:22,893 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-18 19:05:22,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284671430] [2019-12-18 19:05:22,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:22,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:05:22,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272662071] [2019-12-18 19:05:22,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:05:22,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:22,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:05:22,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:05:22,897 INFO L87 Difference]: Start difference. First operand 112928 states and 486484 transitions. Second operand 4 states. [2019-12-18 19:05:24,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:24,112 INFO L93 Difference]: Finished difference Result 176610 states and 731654 transitions. [2019-12-18 19:05:24,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:05:24,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 19:05:24,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:29,702 INFO L225 Difference]: With dead ends: 176610 [2019-12-18 19:05:29,702 INFO L226 Difference]: Without dead ends: 176561 [2019-12-18 19:05:29,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 19:05:33,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176561 states. [2019-12-18 19:05:36,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176561 to 162745. [2019-12-18 19:05:36,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162745 states. [2019-12-18 19:05:38,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162745 states to 162745 states and 681729 transitions. [2019-12-18 19:05:38,511 INFO L78 Accepts]: Start accepts. Automaton has 162745 states and 681729 transitions. Word has length 11 [2019-12-18 19:05:38,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:38,511 INFO L462 AbstractCegarLoop]: Abstraction has 162745 states and 681729 transitions. [2019-12-18 19:05:38,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:05:38,511 INFO L276 IsEmpty]: Start isEmpty. Operand 162745 states and 681729 transitions. [2019-12-18 19:05:38,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 19:05:38,518 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:38,519 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:05:38,519 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:05:38,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:38,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1561773324, now seen corresponding path program 1 times [2019-12-18 19:05:38,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:38,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245040030] [2019-12-18 19:05:38,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:38,599 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-18 19:05:38,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245040030] [2019-12-18 19:05:38,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:38,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:05:38,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524421695] [2019-12-18 19:05:38,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:05:38,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:38,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:05:38,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:05:38,603 INFO L87 Difference]: Start difference. First operand 162745 states and 681729 transitions. Second operand 3 states. [2019-12-18 19:05:38,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:38,743 INFO L93 Difference]: Finished difference Result 33244 states and 109167 transitions. [2019-12-18 19:05:38,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:05:38,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 19:05:38,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:38,796 INFO L225 Difference]: With dead ends: 33244 [2019-12-18 19:05:38,797 INFO L226 Difference]: Without dead ends: 33244 [2019-12-18 19:05:38,797 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-18 19:05:38,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33244 states. [2019-12-18 19:05:39,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33244 to 33244. [2019-12-18 19:05:39,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33244 states. [2019-12-18 19:05:39,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33244 states to 33244 states and 109167 transitions. [2019-12-18 19:05:39,364 INFO L78 Accepts]: Start accepts. Automaton has 33244 states and 109167 transitions. Word has length 13 [2019-12-18 19:05:39,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:39,365 INFO L462 AbstractCegarLoop]: Abstraction has 33244 states and 109167 transitions. [2019-12-18 19:05:39,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:05:39,365 INFO L276 IsEmpty]: Start isEmpty. Operand 33244 states and 109167 transitions. [2019-12-18 19:05:39,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 19:05:39,367 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:39,367 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:05:39,367 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:05:39,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:39,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1197008698, now seen corresponding path program 1 times [2019-12-18 19:05:39,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:39,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022731257] [2019-12-18 19:05:39,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:39,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:39,451 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-18 19:05:39,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022731257] [2019-12-18 19:05:39,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:39,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:05:39,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743158810] [2019-12-18 19:05:39,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:05:39,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:39,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:05:39,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:05:39,453 INFO L87 Difference]: Start difference. First operand 33244 states and 109167 transitions. Second operand 4 states. [2019-12-18 19:05:39,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:39,887 INFO L93 Difference]: Finished difference Result 44535 states and 142999 transitions. [2019-12-18 19:05:39,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:05:39,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 19:05:39,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:40,505 INFO L225 Difference]: With dead ends: 44535 [2019-12-18 19:05:40,505 INFO L226 Difference]: Without dead ends: 44528 [2019-12-18 19:05:40,506 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-18 19:05:40,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44528 states. [2019-12-18 19:05:41,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44528 to 39179. [2019-12-18 19:05:41,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39179 states. [2019-12-18 19:05:41,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39179 states to 39179 states and 127862 transitions. [2019-12-18 19:05:41,144 INFO L78 Accepts]: Start accepts. Automaton has 39179 states and 127862 transitions. Word has length 13 [2019-12-18 19:05:41,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:41,144 INFO L462 AbstractCegarLoop]: Abstraction has 39179 states and 127862 transitions. [2019-12-18 19:05:41,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:05:41,144 INFO L276 IsEmpty]: Start isEmpty. Operand 39179 states and 127862 transitions. [2019-12-18 19:05:41,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:05:41,148 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:41,148 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:05:41,148 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:05:41,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:41,149 INFO L82 PathProgramCache]: Analyzing trace with hash -789449835, now seen corresponding path program 1 times [2019-12-18 19:05:41,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:41,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147786376] [2019-12-18 19:05:41,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:41,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:41,272 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-18 19:05:41,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147786376] [2019-12-18 19:05:41,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:41,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:05:41,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129031414] [2019-12-18 19:05:41,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:05:41,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:41,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:05:41,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:05:41,275 INFO L87 Difference]: Start difference. First operand 39179 states and 127862 transitions. Second operand 5 states. [2019-12-18 19:05:42,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:42,041 INFO L93 Difference]: Finished difference Result 52446 states and 167747 transitions. [2019-12-18 19:05:42,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 19:05:42,042 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 19:05:42,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:42,124 INFO L225 Difference]: With dead ends: 52446 [2019-12-18 19:05:42,124 INFO L226 Difference]: Without dead ends: 52433 [2019-12-18 19:05:42,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:05:42,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52433 states. [2019-12-18 19:05:43,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52433 to 39607. [2019-12-18 19:05:43,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39607 states. [2019-12-18 19:05:43,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39607 states to 39607 states and 129076 transitions. [2019-12-18 19:05:43,260 INFO L78 Accepts]: Start accepts. Automaton has 39607 states and 129076 transitions. Word has length 19 [2019-12-18 19:05:43,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:43,260 INFO L462 AbstractCegarLoop]: Abstraction has 39607 states and 129076 transitions. [2019-12-18 19:05:43,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:05:43,261 INFO L276 IsEmpty]: Start isEmpty. Operand 39607 states and 129076 transitions. [2019-12-18 19:05:43,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:05:43,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:43,274 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] [2019-12-18 19:05:43,274 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:05:43,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:43,275 INFO L82 PathProgramCache]: Analyzing trace with hash -2013302827, now seen corresponding path program 1 times [2019-12-18 19:05:43,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:43,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135988911] [2019-12-18 19:05:43,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:43,324 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-18 19:05:43,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135988911] [2019-12-18 19:05:43,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:43,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:05:43,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643332270] [2019-12-18 19:05:43,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:05:43,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:43,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:05:43,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:05:43,329 INFO L87 Difference]: Start difference. First operand 39607 states and 129076 transitions. Second operand 4 states. [2019-12-18 19:05:43,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:43,372 INFO L93 Difference]: Finished difference Result 7467 states and 20456 transitions. [2019-12-18 19:05:43,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 19:05:43,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 19:05:43,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:43,395 INFO L225 Difference]: With dead ends: 7467 [2019-12-18 19:05:43,396 INFO L226 Difference]: Without dead ends: 7467 [2019-12-18 19:05:43,398 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-18 19:05:43,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7467 states. [2019-12-18 19:05:43,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7467 to 7355. [2019-12-18 19:05:43,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7355 states. [2019-12-18 19:05:43,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7355 states to 7355 states and 20136 transitions. [2019-12-18 19:05:43,494 INFO L78 Accepts]: Start accepts. Automaton has 7355 states and 20136 transitions. Word has length 25 [2019-12-18 19:05:43,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:43,495 INFO L462 AbstractCegarLoop]: Abstraction has 7355 states and 20136 transitions. [2019-12-18 19:05:43,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:05:43,495 INFO L276 IsEmpty]: Start isEmpty. Operand 7355 states and 20136 transitions. [2019-12-18 19:05:43,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 19:05:43,506 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:43,506 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] [2019-12-18 19:05:43,506 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:05:43,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:43,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1439896358, now seen corresponding path program 1 times [2019-12-18 19:05:43,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:43,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441742992] [2019-12-18 19:05:43,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:43,579 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-18 19:05:43,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441742992] [2019-12-18 19:05:43,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:43,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 19:05:43,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733248058] [2019-12-18 19:05:43,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:05:43,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:43,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:05:43,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:05:43,582 INFO L87 Difference]: Start difference. First operand 7355 states and 20136 transitions. Second operand 5 states. [2019-12-18 19:05:43,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:43,619 INFO L93 Difference]: Finished difference Result 5312 states and 15268 transitions. [2019-12-18 19:05:43,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:05:43,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 19:05:43,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:43,628 INFO L225 Difference]: With dead ends: 5312 [2019-12-18 19:05:43,628 INFO L226 Difference]: Without dead ends: 5312 [2019-12-18 19:05:43,628 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-18 19:05:43,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5312 states. [2019-12-18 19:05:43,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5312 to 4948. [2019-12-18 19:05:43,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4948 states. [2019-12-18 19:05:43,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4948 states to 4948 states and 14284 transitions. [2019-12-18 19:05:43,698 INFO L78 Accepts]: Start accepts. Automaton has 4948 states and 14284 transitions. Word has length 37 [2019-12-18 19:05:43,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:43,698 INFO L462 AbstractCegarLoop]: Abstraction has 4948 states and 14284 transitions. [2019-12-18 19:05:43,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:05:43,698 INFO L276 IsEmpty]: Start isEmpty. Operand 4948 states and 14284 transitions. [2019-12-18 19:05:43,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 19:05:43,707 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:43,708 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, 1, 1, 1, 1, 1, 1] [2019-12-18 19:05:43,708 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:05:43,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:43,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1467892093, now seen corresponding path program 1 times [2019-12-18 19:05:43,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:43,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850447709] [2019-12-18 19:05:43,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:43,774 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-18 19:05:43,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850447709] [2019-12-18 19:05:43,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:43,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:05:43,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804692656] [2019-12-18 19:05:43,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:05:43,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:43,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:05:43,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:05:43,777 INFO L87 Difference]: Start difference. First operand 4948 states and 14284 transitions. Second operand 3 states. [2019-12-18 19:05:43,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:43,833 INFO L93 Difference]: Finished difference Result 4957 states and 14297 transitions. [2019-12-18 19:05:43,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:05:43,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 19:05:43,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:43,841 INFO L225 Difference]: With dead ends: 4957 [2019-12-18 19:05:43,841 INFO L226 Difference]: Without dead ends: 4957 [2019-12-18 19:05:43,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-18 19:05:43,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4957 states. [2019-12-18 19:05:43,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4957 to 4953. [2019-12-18 19:05:43,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4953 states. [2019-12-18 19:05:43,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4953 states to 4953 states and 14293 transitions. [2019-12-18 19:05:43,916 INFO L78 Accepts]: Start accepts. Automaton has 4953 states and 14293 transitions. Word has length 65 [2019-12-18 19:05:43,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:43,917 INFO L462 AbstractCegarLoop]: Abstraction has 4953 states and 14293 transitions. [2019-12-18 19:05:43,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:05:43,917 INFO L276 IsEmpty]: Start isEmpty. Operand 4953 states and 14293 transitions. [2019-12-18 19:05:43,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 19:05:43,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:43,924 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, 1, 1, 1, 1, 1, 1] [2019-12-18 19:05:43,924 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:05:43,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:43,925 INFO L82 PathProgramCache]: Analyzing trace with hash 873301269, now seen corresponding path program 1 times [2019-12-18 19:05:43,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:43,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386343332] [2019-12-18 19:05:43,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:44,013 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-18 19:05:44,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386343332] [2019-12-18 19:05:44,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:44,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:05:44,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428831454] [2019-12-18 19:05:44,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:05:44,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:44,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:05:44,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:05:44,016 INFO L87 Difference]: Start difference. First operand 4953 states and 14293 transitions. Second operand 5 states. [2019-12-18 19:05:44,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:44,319 INFO L93 Difference]: Finished difference Result 7544 states and 21558 transitions. [2019-12-18 19:05:44,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:05:44,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 19:05:44,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:44,330 INFO L225 Difference]: With dead ends: 7544 [2019-12-18 19:05:44,330 INFO L226 Difference]: Without dead ends: 7544 [2019-12-18 19:05:44,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:05:44,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7544 states. [2019-12-18 19:05:44,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7544 to 6350. [2019-12-18 19:05:44,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6350 states. [2019-12-18 19:05:44,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6350 states to 6350 states and 18328 transitions. [2019-12-18 19:05:44,422 INFO L78 Accepts]: Start accepts. Automaton has 6350 states and 18328 transitions. Word has length 65 [2019-12-18 19:05:44,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:44,422 INFO L462 AbstractCegarLoop]: Abstraction has 6350 states and 18328 transitions. [2019-12-18 19:05:44,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:05:44,422 INFO L276 IsEmpty]: Start isEmpty. Operand 6350 states and 18328 transitions. [2019-12-18 19:05:44,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 19:05:44,431 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:44,431 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, 1, 1, 1, 1, 1, 1] [2019-12-18 19:05:44,431 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:05:44,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:44,432 INFO L82 PathProgramCache]: Analyzing trace with hash -127580537, now seen corresponding path program 2 times [2019-12-18 19:05:44,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:44,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249518407] [2019-12-18 19:05:44,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:44,534 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-18 19:05:44,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249518407] [2019-12-18 19:05:44,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:44,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 19:05:44,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836029911] [2019-12-18 19:05:44,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 19:05:44,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:44,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 19:05:44,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 19:05:44,536 INFO L87 Difference]: Start difference. First operand 6350 states and 18328 transitions. Second operand 6 states. [2019-12-18 19:05:45,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:45,052 INFO L93 Difference]: Finished difference Result 10883 states and 31208 transitions. [2019-12-18 19:05:45,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 19:05:45,053 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 19:05:45,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:45,067 INFO L225 Difference]: With dead ends: 10883 [2019-12-18 19:05:45,067 INFO L226 Difference]: Without dead ends: 10883 [2019-12-18 19:05:45,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:05:45,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10883 states. [2019-12-18 19:05:45,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10883 to 7012. [2019-12-18 19:05:45,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7012 states. [2019-12-18 19:05:45,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7012 states to 7012 states and 20306 transitions. [2019-12-18 19:05:45,399 INFO L78 Accepts]: Start accepts. Automaton has 7012 states and 20306 transitions. Word has length 65 [2019-12-18 19:05:45,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:45,399 INFO L462 AbstractCegarLoop]: Abstraction has 7012 states and 20306 transitions. [2019-12-18 19:05:45,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 19:05:45,399 INFO L276 IsEmpty]: Start isEmpty. Operand 7012 states and 20306 transitions. [2019-12-18 19:05:45,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 19:05:45,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:45,409 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, 1, 1, 1, 1, 1, 1] [2019-12-18 19:05:45,409 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:05:45,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:45,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1928895531, now seen corresponding path program 3 times [2019-12-18 19:05:45,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:45,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931580311] [2019-12-18 19:05:45,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:45,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:45,520 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-18 19:05:45,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931580311] [2019-12-18 19:05:45,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:45,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:05:45,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384792231] [2019-12-18 19:05:45,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:05:45,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:45,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:05:45,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:05:45,523 INFO L87 Difference]: Start difference. First operand 7012 states and 20306 transitions. Second operand 3 states. [2019-12-18 19:05:45,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:45,583 INFO L93 Difference]: Finished difference Result 7012 states and 20305 transitions. [2019-12-18 19:05:45,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:05:45,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 19:05:45,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:45,594 INFO L225 Difference]: With dead ends: 7012 [2019-12-18 19:05:45,594 INFO L226 Difference]: Without dead ends: 7012 [2019-12-18 19:05:45,594 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-18 19:05:45,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7012 states. [2019-12-18 19:05:45,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7012 to 4682. [2019-12-18 19:05:45,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4682 states. [2019-12-18 19:05:45,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4682 states to 4682 states and 13829 transitions. [2019-12-18 19:05:45,705 INFO L78 Accepts]: Start accepts. Automaton has 4682 states and 13829 transitions. Word has length 65 [2019-12-18 19:05:45,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:45,705 INFO L462 AbstractCegarLoop]: Abstraction has 4682 states and 13829 transitions. [2019-12-18 19:05:45,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:05:45,705 INFO L276 IsEmpty]: Start isEmpty. Operand 4682 states and 13829 transitions. [2019-12-18 19:05:45,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 19:05:45,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:45,714 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:05:45,715 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:05:45,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:45,715 INFO L82 PathProgramCache]: Analyzing trace with hash 796962561, now seen corresponding path program 1 times [2019-12-18 19:05:45,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:45,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126119794] [2019-12-18 19:05:45,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:45,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:45,792 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-18 19:05:45,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126119794] [2019-12-18 19:05:45,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:45,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:05:45,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232365810] [2019-12-18 19:05:45,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:05:45,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:45,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:05:45,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:05:45,794 INFO L87 Difference]: Start difference. First operand 4682 states and 13829 transitions. Second operand 3 states. [2019-12-18 19:05:45,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:45,822 INFO L93 Difference]: Finished difference Result 4186 states and 12061 transitions. [2019-12-18 19:05:45,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:05:45,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 19:05:45,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:45,830 INFO L225 Difference]: With dead ends: 4186 [2019-12-18 19:05:45,831 INFO L226 Difference]: Without dead ends: 4186 [2019-12-18 19:05:45,831 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-18 19:05:45,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4186 states. [2019-12-18 19:05:45,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4186 to 3862. [2019-12-18 19:05:45,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3862 states. [2019-12-18 19:05:45,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3862 states to 3862 states and 11145 transitions. [2019-12-18 19:05:45,915 INFO L78 Accepts]: Start accepts. Automaton has 3862 states and 11145 transitions. Word has length 66 [2019-12-18 19:05:45,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:45,915 INFO L462 AbstractCegarLoop]: Abstraction has 3862 states and 11145 transitions. [2019-12-18 19:05:45,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:05:45,915 INFO L276 IsEmpty]: Start isEmpty. Operand 3862 states and 11145 transitions. [2019-12-18 19:05:45,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 19:05:45,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:45,923 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:05:45,923 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:05:45,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:45,924 INFO L82 PathProgramCache]: Analyzing trace with hash -129319907, now seen corresponding path program 1 times [2019-12-18 19:05:45,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:45,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078347296] [2019-12-18 19:05:45,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:46,031 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-18 19:05:46,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078347296] [2019-12-18 19:05:46,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:46,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:05:46,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351038386] [2019-12-18 19:05:46,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:05:46,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:46,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:05:46,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:05:46,035 INFO L87 Difference]: Start difference. First operand 3862 states and 11145 transitions. Second operand 3 states. [2019-12-18 19:05:46,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:46,057 INFO L93 Difference]: Finished difference Result 3690 states and 10432 transitions. [2019-12-18 19:05:46,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:05:46,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 19:05:46,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:46,063 INFO L225 Difference]: With dead ends: 3690 [2019-12-18 19:05:46,063 INFO L226 Difference]: Without dead ends: 3690 [2019-12-18 19:05:46,068 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-18 19:05:46,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3690 states. [2019-12-18 19:05:46,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3690 to 2988. [2019-12-18 19:05:46,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2988 states. [2019-12-18 19:05:46,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2988 states to 2988 states and 8462 transitions. [2019-12-18 19:05:46,127 INFO L78 Accepts]: Start accepts. Automaton has 2988 states and 8462 transitions. Word has length 67 [2019-12-18 19:05:46,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:46,128 INFO L462 AbstractCegarLoop]: Abstraction has 2988 states and 8462 transitions. [2019-12-18 19:05:46,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:05:46,129 INFO L276 IsEmpty]: Start isEmpty. Operand 2988 states and 8462 transitions. [2019-12-18 19:05:46,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 19:05:46,134 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:46,134 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:05:46,134 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:05:46,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:46,134 INFO L82 PathProgramCache]: Analyzing trace with hash -857460709, now seen corresponding path program 1 times [2019-12-18 19:05:46,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:46,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756892446] [2019-12-18 19:05:46,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:46,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:05:46,434 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-18 19:05:46,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756892446] [2019-12-18 19:05:46,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:05:46,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 19:05:46,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415664279] [2019-12-18 19:05:46,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 19:05:46,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:05:46,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 19:05:46,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:05:46,438 INFO L87 Difference]: Start difference. First operand 2988 states and 8462 transitions. Second operand 14 states. [2019-12-18 19:05:47,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:05:47,160 INFO L93 Difference]: Finished difference Result 6929 states and 19752 transitions. [2019-12-18 19:05:47,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 19:05:47,161 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2019-12-18 19:05:47,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:05:47,175 INFO L225 Difference]: With dead ends: 6929 [2019-12-18 19:05:47,175 INFO L226 Difference]: Without dead ends: 6898 [2019-12-18 19:05:47,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=743, Unknown=0, NotChecked=0, Total=930 [2019-12-18 19:05:47,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6898 states. [2019-12-18 19:05:47,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6898 to 4143. [2019-12-18 19:05:47,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4143 states. [2019-12-18 19:05:47,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4143 states to 4143 states and 11625 transitions. [2019-12-18 19:05:47,284 INFO L78 Accepts]: Start accepts. Automaton has 4143 states and 11625 transitions. Word has length 68 [2019-12-18 19:05:47,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:05:47,285 INFO L462 AbstractCegarLoop]: Abstraction has 4143 states and 11625 transitions. [2019-12-18 19:05:47,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 19:05:47,285 INFO L276 IsEmpty]: Start isEmpty. Operand 4143 states and 11625 transitions. [2019-12-18 19:05:47,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 19:05:47,292 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:05:47,293 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:05:47,293 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:05:47,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:05:47,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1442657587, now seen corresponding path program 2 times [2019-12-18 19:05:47,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:05:47,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587311703] [2019-12-18 19:05:47,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:05:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:05:47,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:05:47,490 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 19:05:47,490 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 19:05:47,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] ULTIMATE.startENTRY-->L803: Formula: (let ((.cse0 (store |v_#valid_58| 0 0))) (and (= v_~z$w_buff1~0_188 0) (= v_~weak$$choice2~0_132 0) (= v_~main$tmp_guard0~0_18 0) (= |v_#NULL.offset_6| 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t2501~0.base_22|) (= |v_ULTIMATE.start_main_~#t2501~0.offset_17| 0) (= v_~z$r_buff0_thd1~0_211 0) (= v_~main$tmp_guard1~0_26 0) (= v_~z~0_153 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t2501~0.base_22| 4)) (= 0 v_~z$r_buff0_thd3~0_107) (= v_~z$read_delayed_var~0.offset_7 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~z$mem_tmp~0_39 0) (= v_~z$r_buff0_thd2~0_110 0) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2501~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2501~0.base_22|) |v_ULTIMATE.start_main_~#t2501~0.offset_17| 0))) (= v_~z$r_buff1_thd1~0_172 0) (= 0 v_~z$flush_delayed~0_55) (= 0 |v_#NULL.base_6|) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2501~0.base_22|) 0) (= v_~y~0_40 0) (= 0 v_~x~0_132) (= |v_#valid_56| (store .cse0 |v_ULTIMATE.start_main_~#t2501~0.base_22| 1)) (= v_~__unbuffered_cnt~0_139 0) (= v_~z$w_buff1_used~0_438 0) (= v_~z$w_buff0~0_198 0) (= v_~z$r_buff1_thd0~0_288 0) (= 0 v_~weak$$choice0~0_34) (= v_~z$w_buff0_used~0_699 0) (= 0 v_~z$r_buff1_thd3~0_190) (= v_~z$r_buff1_thd2~0_178 0) (= v_~z$r_buff0_thd0~0_338 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_59|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_25|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_178, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_25|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_27|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_135|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_42|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_37|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_23|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_44|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_34|, ULTIMATE.start_main_~#t2502~0.offset=|v_ULTIMATE.start_main_~#t2502~0.offset_17|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_338, #length=|v_#length_21|, ULTIMATE.start_main_~#t2501~0.base=|v_ULTIMATE.start_main_~#t2501~0.base_22|, ~z$mem_tmp~0=v_~z$mem_tmp~0_39, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_7|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_27|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_48|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_438, ULTIMATE.start_main_~#t2503~0.base=|v_ULTIMATE.start_main_~#t2503~0.base_19|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_38|, ~z$flush_delayed~0=v_~z$flush_delayed~0_55, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_29|, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_26|, ULTIMATE.start_main_~#t2502~0.base=|v_ULTIMATE.start_main_~#t2502~0.base_21|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_172, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_107, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, ~x~0=v_~x~0_132, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_59|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_71|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_29|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_27|, ~z$w_buff1~0=v_~z$w_buff1~0_188, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_195|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_15|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_23|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_32|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_288, ULTIMATE.start_main_~#t2503~0.offset=|v_ULTIMATE.start_main_~#t2503~0.offset_14|, ~y~0=v_~y~0_40, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_110, ULTIMATE.start_main_~#t2501~0.offset=|v_ULTIMATE.start_main_~#t2501~0.offset_17|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_7|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_17|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_699, ~z$w_buff0~0=v_~z$w_buff0~0_198, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_190, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_39|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_56|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_23|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_44|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_30|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_153, ~weak$$choice2~0=v_~weak$$choice2~0_132, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_211} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_~#t2502~0.offset, ~z$r_buff0_thd0~0, #length, ULTIMATE.start_main_~#t2501~0.base, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t2503~0.base, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t2502~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t2503~0.offset, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t2501~0.offset, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 19:05:47,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0_used~0_115 v_~z$w_buff1_used~0_60) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_7|) (= 0 (mod v_~z$w_buff1_used~0_60 256)) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_9 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_7|) (= v_~z$w_buff0~0_27 v_~z$w_buff1~0_20) (= v_P0Thread1of1ForFork0_~arg.offset_7 |v_P0Thread1of1ForFork0_#in~arg.offset_7|) (= v_P0Thread1of1ForFork0_~arg.base_7 |v_P0Thread1of1ForFork0_#in~arg.base_7|) (= v_~z$w_buff0_used~0_114 1) (= 2 v_~z$w_buff0~0_26)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_27, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_7|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_114, ~z$w_buff0~0=v_~z$w_buff0~0_26, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_9, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_7|, ~z$w_buff1~0=v_~z$w_buff1~0_20, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_7, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_7|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_7} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 19:05:47,497 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L741-->L741-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In966674428 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In966674428 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out966674428|)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In966674428 |P0Thread1of1ForFork0_#t~ite5_Out966674428|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In966674428, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In966674428} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out966674428|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In966674428, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In966674428} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 19:05:47,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L803-1-->L805: Formula: (and (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2502~0.base_9|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2502~0.base_9| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2502~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2502~0.base_9|) |v_ULTIMATE.start_main_~#t2502~0.offset_9| 1)) |v_#memory_int_11|) (not (= |v_ULTIMATE.start_main_~#t2502~0.base_9| 0)) (= 0 |v_ULTIMATE.start_main_~#t2502~0.offset_9|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2502~0.base_9| 1)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2502~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2502~0.offset=|v_ULTIMATE.start_main_~#t2502~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_4|, ULTIMATE.start_main_~#t2502~0.base=|v_ULTIMATE.start_main_~#t2502~0.base_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2502~0.offset, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t2502~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 19:05:47,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L805-1-->L807: Formula: (and (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2503~0.base_13|)) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2503~0.base_13| 1) |v_#valid_38|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2503~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2503~0.base_13|) |v_ULTIMATE.start_main_~#t2503~0.offset_11| 2)) |v_#memory_int_15|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2503~0.base_13| 4)) (= |v_ULTIMATE.start_main_~#t2503~0.offset_11| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2503~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t2503~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t2503~0.base=|v_ULTIMATE.start_main_~#t2503~0.base_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2503~0.offset=|v_ULTIMATE.start_main_~#t2503~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t2503~0.base, #length, ULTIMATE.start_main_~#t2503~0.offset] because there is no mapped edge [2019-12-18 19:05:47,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L760-2-->L760-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In594905031 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In594905031 256)))) (or (and (= ~z~0_In594905031 |P1Thread1of1ForFork1_#t~ite9_Out594905031|) (or .cse0 .cse1)) (and (= ~z$w_buff1~0_In594905031 |P1Thread1of1ForFork1_#t~ite9_Out594905031|) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In594905031, ~z$w_buff1_used~0=~z$w_buff1_used~0_In594905031, ~z$w_buff1~0=~z$w_buff1~0_In594905031, ~z~0=~z~0_In594905031} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out594905031|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In594905031, ~z$w_buff1_used~0=~z$w_buff1_used~0_In594905031, ~z$w_buff1~0=~z$w_buff1~0_In594905031, ~z~0=~z~0_In594905031} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-18 19:05:47,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L760-4-->L761: Formula: (= v_~z~0_37 |v_P1Thread1of1ForFork1_#t~ite9_10|) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_10|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_9|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_13|, ~z~0=v_~z~0_37} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~z~0] because there is no mapped edge [2019-12-18 19:05:47,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L761-->L761-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In447523125 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In447523125 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out447523125| ~z$w_buff0_used~0_In447523125)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out447523125| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In447523125, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In447523125} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In447523125, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out447523125|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In447523125} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 19:05:47,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L780-2-->L780-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In562844553 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In562844553 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out562844553| ~z$w_buff1~0_In562844553) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out562844553| ~z~0_In562844553)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In562844553, ~z$w_buff1_used~0=~z$w_buff1_used~0_In562844553, ~z$w_buff1~0=~z$w_buff1~0_In562844553, ~z~0=~z~0_In562844553} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out562844553|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In562844553, ~z$w_buff1_used~0=~z$w_buff1_used~0_In562844553, ~z$w_buff1~0=~z$w_buff1~0_In562844553, ~z~0=~z~0_In562844553} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 19:05:47,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L780-4-->L781: Formula: (= v_~z~0_41 |v_P2Thread1of1ForFork2_#t~ite15_10|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_10|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_9|, ~z~0=v_~z~0_41, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_15|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~z~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-18 19:05:47,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1471245906 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1471245906 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite17_Out-1471245906|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-1471245906 |P2Thread1of1ForFork2_#t~ite17_Out-1471245906|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1471245906, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1471245906} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1471245906, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1471245906, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-1471245906|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 19:05:47,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L782-->L782-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-177747253 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-177747253 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In-177747253 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-177747253 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite18_Out-177747253| ~z$w_buff1_used~0_In-177747253) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite18_Out-177747253| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-177747253, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-177747253, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-177747253, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-177747253} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-177747253, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-177747253, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-177747253, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-177747253, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-177747253|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-18 19:05:47,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L762-->L762-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In977338344 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In977338344 256))) (.cse2 (= (mod ~z$r_buff1_thd2~0_In977338344 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In977338344 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite12_Out977338344| ~z$w_buff1_used~0_In977338344) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite12_Out977338344| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In977338344, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In977338344, ~z$w_buff1_used~0=~z$w_buff1_used~0_In977338344, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In977338344} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In977338344, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In977338344, ~z$w_buff1_used~0=~z$w_buff1_used~0_In977338344, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out977338344|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In977338344} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 19:05:47,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-311187300 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-311187300 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd3~0_In-311187300 |P2Thread1of1ForFork2_#t~ite19_Out-311187300|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite19_Out-311187300|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-311187300, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-311187300} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-311187300, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-311187300, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-311187300|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-18 19:05:47,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L763-->L763-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1480578119 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In1480578119 256) 0))) (or (and (= ~z$r_buff0_thd2~0_In1480578119 |P1Thread1of1ForFork1_#t~ite13_Out1480578119|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite13_Out1480578119|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1480578119, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1480578119} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1480578119, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1480578119|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1480578119} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 19:05:47,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L764-->L764-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In-1231345574 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1231345574 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1231345574 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-1231345574 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out-1231345574| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$r_buff1_thd2~0_In-1231345574 |P1Thread1of1ForFork1_#t~ite14_Out-1231345574|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1231345574, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1231345574, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1231345574, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1231345574} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1231345574, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1231345574, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1231345574, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1231345574|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1231345574} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 19:05:47,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L764-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~z$r_buff1_thd2~0_130 |v_P1Thread1of1ForFork1_#t~ite14_40|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_40|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_130, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_39|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 19:05:47,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L784-->L784-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In657546518 256))) (.cse1 (= (mod ~z$r_buff1_thd3~0_In657546518 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In657546518 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In657546518 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite20_Out657546518|)) (and (= ~z$r_buff1_thd3~0_In657546518 |P2Thread1of1ForFork2_#t~ite20_Out657546518|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In657546518, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In657546518, ~z$w_buff1_used~0=~z$w_buff1_used~0_In657546518, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In657546518} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In657546518, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out657546518|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In657546518, ~z$w_buff1_used~0=~z$w_buff1_used~0_In657546518, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In657546518} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-18 19:05:47,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L784-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_80 1) v_~__unbuffered_cnt~0_79) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_148 |v_P2Thread1of1ForFork2_#t~ite20_36|)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_35|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_148, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 19:05:47,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1926583025 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In-1926583025 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1926583025 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-1926583025 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out-1926583025| ~z$w_buff1_used~0_In-1926583025)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1926583025| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1926583025, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1926583025, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1926583025, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1926583025} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1926583025|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1926583025, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1926583025, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1926583025, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1926583025} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 19:05:47,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L743-->L744: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1580819079 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1580819079 256)))) (or (and (= 0 ~z$r_buff0_thd1~0_Out1580819079) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In1580819079 ~z$r_buff0_thd1~0_Out1580819079)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1580819079, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1580819079} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1580819079, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1580819079|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1580819079} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 19:05:47,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L744-->L744-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In1427467817 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In1427467817 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd1~0_In1427467817 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1427467817 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out1427467817| ~z$r_buff1_thd1~0_In1427467817) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite8_Out1427467817| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1427467817, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1427467817, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1427467817, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1427467817} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1427467817, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1427467817|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1427467817, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1427467817, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1427467817} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 19:05:47,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L744-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_118 |v_P0Thread1of1ForFork0_#t~ite8_38|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_37|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_118, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 19:05:47,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L807-1-->L813: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 19:05:47,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L813-2-->L813-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite25_Out-929801044| |ULTIMATE.start_main_#t~ite24_Out-929801044|)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-929801044 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-929801044 256)))) (or (and .cse0 (not .cse1) (= ~z$w_buff1~0_In-929801044 |ULTIMATE.start_main_#t~ite24_Out-929801044|) (not .cse2)) (and .cse0 (or .cse1 .cse2) (= ~z~0_In-929801044 |ULTIMATE.start_main_#t~ite24_Out-929801044|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-929801044, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-929801044, ~z$w_buff1~0=~z$w_buff1~0_In-929801044, ~z~0=~z~0_In-929801044} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-929801044, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-929801044|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-929801044, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-929801044|, ~z$w_buff1~0=~z$w_buff1~0_In-929801044, ~z~0=~z~0_In-929801044} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-18 19:05:47,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L814-->L814-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-468280967 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-468280967 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite26_Out-468280967| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite26_Out-468280967| ~z$w_buff0_used~0_In-468280967)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-468280967, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-468280967} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-468280967, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-468280967, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-468280967|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-18 19:05:47,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L815-->L815-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1326276748 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1326276748 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-1326276748 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1326276748 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1326276748 |ULTIMATE.start_main_#t~ite27_Out-1326276748|)) (and (= 0 |ULTIMATE.start_main_#t~ite27_Out-1326276748|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1326276748, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1326276748, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1326276748, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1326276748} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1326276748, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1326276748, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1326276748, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1326276748, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1326276748|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-18 19:05:47,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L816-->L816-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1328464999 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1328464999 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite28_Out1328464999| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite28_Out1328464999| ~z$r_buff0_thd0~0_In1328464999) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1328464999, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1328464999} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1328464999, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1328464999|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1328464999} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-18 19:05:47,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L817-->L817-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1587907543 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1587907543 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1587907543 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1587907543 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite29_Out-1587907543| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite29_Out-1587907543| ~z$r_buff1_thd0~0_In-1587907543)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1587907543, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1587907543, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1587907543, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1587907543} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1587907543, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1587907543|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1587907543, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1587907543, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1587907543} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 19:05:47,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L829-->L830: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_46 256))) (= v_~z$r_buff0_thd0~0_162 v_~z$r_buff0_thd0~0_161)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_162, ~weak$$choice2~0=v_~weak$$choice2~0_46} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_161, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_17|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_7|, ~weak$$choice2~0=v_~weak$$choice2~0_46} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 19:05:47,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L832-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_15 256)) (not (= (mod v_~z$flush_delayed~0_47 256) 0)) (= 0 v_~z$flush_delayed~0_46) (= v_~z$mem_tmp~0_33 v_~z~0_120)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~z$flush_delayed~0=v_~z$flush_delayed~0_47} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_33, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_28|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~z$flush_delayed~0=v_~z$flush_delayed~0_46, ~z~0=v_~z~0_120, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 19:05:47,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 19:05:47,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 07:05:47 BasicIcfg [2019-12-18 19:05:47,627 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 19:05:47,629 INFO L168 Benchmark]: Toolchain (without parser) took 65941.88 ms. Allocated memory was 145.8 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 102.0 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-18 19:05:47,630 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 19:05:47,631 INFO L168 Benchmark]: CACSL2BoogieTranslator took 828.69 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.6 MB in the beginning and 156.6 MB in the end (delta: -55.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-18 19:05:47,631 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.68 ms. Allocated memory is still 203.4 MB. Free memory was 156.6 MB in the beginning and 154.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 19:05:47,632 INFO L168 Benchmark]: Boogie Preprocessor took 41.46 ms. Allocated memory is still 203.4 MB. Free memory was 154.0 MB in the beginning and 151.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 19:05:47,633 INFO L168 Benchmark]: RCFGBuilder took 852.74 ms. Allocated memory is still 203.4 MB. Free memory was 151.5 MB in the beginning and 101.5 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. [2019-12-18 19:05:47,634 INFO L168 Benchmark]: TraceAbstraction took 64133.28 ms. Allocated memory was 203.4 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 101.5 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-18 19:05:47,637 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.22 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 828.69 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.6 MB in the beginning and 156.6 MB in the end (delta: -55.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 80.68 ms. Allocated memory is still 203.4 MB. Free memory was 156.6 MB in the beginning and 154.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.46 ms. Allocated memory is still 203.4 MB. Free memory was 154.0 MB in the beginning and 151.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 852.74 ms. Allocated memory is still 203.4 MB. Free memory was 151.5 MB in the beginning and 101.5 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 64133.28 ms. Allocated memory was 203.4 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 101.5 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.0s, 173 ProgramPointsBefore, 95 ProgramPointsAfterwards, 210 TransitionsBefore, 107 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 29 ChoiceCompositions, 5611 VarBasedMoverChecksPositive, 231 VarBasedMoverChecksNegative, 69 SemBasedMoverChecksPositive, 225 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 79634 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L803] FCALL, FORK 0 pthread_create(&t2501, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L730] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L731] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L732] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L733] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L734] 1 z$r_buff0_thd1 = (_Bool)1 [L737] 1 x = 1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L741] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L805] FCALL, FORK 0 pthread_create(&t2502, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L807] FCALL, FORK 0 pthread_create(&t2503, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L754] 2 x = 2 [L757] 2 y = 1 VAL [__unbuffered_cnt=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=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=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=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L774] 3 y = 2 [L777] 3 z = 1 VAL [__unbuffered_cnt=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=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L780] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=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=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L761] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L781] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L762] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L782] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L763] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L783] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L742] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L813] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L814] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L815] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L816] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L817] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L820] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L821] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L822] 0 z$flush_delayed = weak$$choice2 [L823] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L824] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L824] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L825] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L826] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L826] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L827] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L828] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L830] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L831] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 164 locations, 2 error locations. Result: UNSAFE, OverallTime: 63.8s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 15.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2128 SDtfs, 1960 SDslu, 3688 SDs, 0 SdLazy, 1993 SolverSat, 124 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 18 SyntacticMatches, 9 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162745occurred 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: 23.9s AutomataMinimizationTime, 14 MinimizatonAttempts, 43647 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 650 NumberOfCodeBlocks, 650 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 568 ConstructedInterpolants, 0 QuantifiedInterpolants, 120189 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...