/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi004_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 22:03:43,486 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 22:03:43,489 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 22:03:43,508 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 22:03:43,508 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 22:03:43,511 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 22:03:43,513 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 22:03:43,522 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 22:03:43,526 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 22:03:43,529 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 22:03:43,531 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 22:03:43,533 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 22:03:43,533 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 22:03:43,535 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 22:03:43,537 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 22:03:43,539 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 22:03:43,540 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 22:03:43,541 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 22:03:43,542 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 22:03:43,547 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 22:03:43,551 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 22:03:43,555 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 22:03:43,556 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 22:03:43,557 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 22:03:43,559 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 22:03:43,559 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 22:03:43,560 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 22:03:43,561 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 22:03:43,562 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 22:03:43,565 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 22:03:43,565 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 22:03:43,567 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 22:03:43,567 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 22:03:43,569 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 22:03:43,570 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 22:03:43,570 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 22:03:43,571 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 22:03:43,571 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 22:03:43,571 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 22:03:43,572 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 22:03:43,574 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 22:03:43,574 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 22:03:43,606 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 22:03:43,606 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 22:03:43,611 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 22:03:43,611 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 22:03:43,611 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 22:03:43,611 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 22:03:43,612 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 22:03:43,612 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 22:03:43,612 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 22:03:43,612 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 22:03:43,612 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 22:03:43,613 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 22:03:43,614 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 22:03:43,614 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 22:03:43,614 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 22:03:43,614 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 22:03:43,615 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 22:03:43,615 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 22:03:43,615 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 22:03:43,615 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 22:03:43,615 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 22:03:43,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:03:43,616 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 22:03:43,616 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 22:03:43,616 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 22:03:43,617 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 22:03:43,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 22:03:43,617 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 22:03:43,617 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 22:03:43,617 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 22:03:43,903 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 22:03:43,916 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 22:03:43,919 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 22:03:43,921 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 22:03:43,921 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 22:03:43,922 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi004_pso.opt.i [2019-12-18 22:03:43,981 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4248a59e/41b703e80ddc4800bc8790249d50a458/FLAG50e280a69 [2019-12-18 22:03:44,496 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 22:03:44,497 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi004_pso.opt.i [2019-12-18 22:03:44,519 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4248a59e/41b703e80ddc4800bc8790249d50a458/FLAG50e280a69 [2019-12-18 22:03:44,811 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4248a59e/41b703e80ddc4800bc8790249d50a458 [2019-12-18 22:03:44,819 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 22:03:44,821 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 22:03:44,822 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 22:03:44,822 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 22:03:44,825 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 22:03:44,826 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:03:44" (1/1) ... [2019-12-18 22:03:44,829 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73e76b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:44, skipping insertion in model container [2019-12-18 22:03:44,829 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:03:44" (1/1) ... [2019-12-18 22:03:44,837 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 22:03:44,879 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 22:03:45,358 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:03:45,378 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 22:03:45,470 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:03:45,546 INFO L208 MainTranslator]: Completed translation [2019-12-18 22:03:45,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:45 WrapperNode [2019-12-18 22:03:45,546 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 22:03:45,547 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 22:03:45,547 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 22:03:45,547 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 22:03:45,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:45" (1/1) ... [2019-12-18 22:03:45,579 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:45" (1/1) ... [2019-12-18 22:03:45,608 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 22:03:45,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 22:03:45,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 22:03:45,609 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 22:03:45,619 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:45" (1/1) ... [2019-12-18 22:03:45,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:45" (1/1) ... [2019-12-18 22:03:45,624 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:45" (1/1) ... [2019-12-18 22:03:45,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:45" (1/1) ... [2019-12-18 22:03:45,638 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:45" (1/1) ... [2019-12-18 22:03:45,647 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:45" (1/1) ... [2019-12-18 22:03:45,652 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:45" (1/1) ... [2019-12-18 22:03:45,660 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 22:03:45,661 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 22:03:45,661 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 22:03:45,661 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 22:03:45,662 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:45" (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 22:03:45,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 22:03:45,725 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 22:03:45,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 22:03:45,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 22:03:45,725 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 22:03:45,726 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 22:03:45,726 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 22:03:45,726 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 22:03:45,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 22:03:45,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 22:03:45,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 22:03:45,728 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 22:03:46,418 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 22:03:46,419 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 22:03:46,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:03:46 BoogieIcfgContainer [2019-12-18 22:03:46,420 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 22:03:46,422 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 22:03:46,422 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 22:03:46,425 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 22:03:46,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:03:44" (1/3) ... [2019-12-18 22:03:46,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51966b37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:03:46, skipping insertion in model container [2019-12-18 22:03:46,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:45" (2/3) ... [2019-12-18 22:03:46,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51966b37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:03:46, skipping insertion in model container [2019-12-18 22:03:46,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:03:46" (3/3) ... [2019-12-18 22:03:46,431 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi004_pso.opt.i [2019-12-18 22:03:46,442 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 22:03:46,442 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 22:03:46,455 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 22:03:46,457 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 22:03:46,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,514 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,515 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,523 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,548 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,548 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,548 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,549 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,549 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,573 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,574 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,574 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,580 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,597 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:46,619 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 22:03:46,640 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 22:03:46,640 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 22:03:46,641 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 22:03:46,641 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 22:03:46,641 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 22:03:46,641 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 22:03:46,641 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 22:03:46,641 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 22:03:46,661 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 165 transitions [2019-12-18 22:03:46,663 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-18 22:03:46,760 INFO L126 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-18 22:03:46,760 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:03:46,778 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 6/132 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-18 22:03:46,796 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-18 22:03:46,872 INFO L126 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-18 22:03:46,872 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:03:46,880 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 6/132 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-18 22:03:46,896 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-18 22:03:46,897 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 22:03:49,766 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 22:03:49,878 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 22:03:49,928 INFO L206 etLargeBlockEncoding]: Checked pairs total: 41237 [2019-12-18 22:03:49,928 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-18 22:03:49,932 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 69 places, 81 transitions [2019-12-18 22:03:50,340 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 7504 states. [2019-12-18 22:03:50,343 INFO L276 IsEmpty]: Start isEmpty. Operand 7504 states. [2019-12-18 22:03:50,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 22:03:50,352 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:50,353 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 22:03:50,354 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:50,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:50,362 INFO L82 PathProgramCache]: Analyzing trace with hash 676926397, now seen corresponding path program 1 times [2019-12-18 22:03:50,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:50,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269646310] [2019-12-18 22:03:50,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:50,583 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 22:03:50,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269646310] [2019-12-18 22:03:50,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:50,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:03:50,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283530681] [2019-12-18 22:03:50,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:03:50,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:50,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:03:50,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:03:50,607 INFO L87 Difference]: Start difference. First operand 7504 states. Second operand 3 states. [2019-12-18 22:03:50,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:50,822 INFO L93 Difference]: Finished difference Result 6863 states and 23135 transitions. [2019-12-18 22:03:50,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:03:50,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 22:03:50,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:50,901 INFO L225 Difference]: With dead ends: 6863 [2019-12-18 22:03:50,901 INFO L226 Difference]: Without dead ends: 6460 [2019-12-18 22:03:50,902 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 22:03:50,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6460 states. [2019-12-18 22:03:51,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6460 to 6460. [2019-12-18 22:03:51,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6460 states. [2019-12-18 22:03:51,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6460 states to 6460 states and 21739 transitions. [2019-12-18 22:03:51,295 INFO L78 Accepts]: Start accepts. Automaton has 6460 states and 21739 transitions. Word has length 5 [2019-12-18 22:03:51,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:51,296 INFO L462 AbstractCegarLoop]: Abstraction has 6460 states and 21739 transitions. [2019-12-18 22:03:51,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:03:51,297 INFO L276 IsEmpty]: Start isEmpty. Operand 6460 states and 21739 transitions. [2019-12-18 22:03:51,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 22:03:51,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:51,313 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:03:51,313 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:51,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:51,316 INFO L82 PathProgramCache]: Analyzing trace with hash 982245482, now seen corresponding path program 1 times [2019-12-18 22:03:51,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:51,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363255538] [2019-12-18 22:03:51,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:51,532 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 22:03:51,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363255538] [2019-12-18 22:03:51,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:51,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:03:51,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203429326] [2019-12-18 22:03:51,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:03:51,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:51,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:03:51,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:03:51,536 INFO L87 Difference]: Start difference. First operand 6460 states and 21739 transitions. Second operand 4 states. [2019-12-18 22:03:51,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:51,600 INFO L93 Difference]: Finished difference Result 1711 states and 4581 transitions. [2019-12-18 22:03:51,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:03:51,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 22:03:51,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:51,609 INFO L225 Difference]: With dead ends: 1711 [2019-12-18 22:03:51,610 INFO L226 Difference]: Without dead ends: 1308 [2019-12-18 22:03:51,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:03:51,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2019-12-18 22:03:51,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1308. [2019-12-18 22:03:51,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1308 states. [2019-12-18 22:03:51,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 3245 transitions. [2019-12-18 22:03:51,650 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 3245 transitions. Word has length 11 [2019-12-18 22:03:51,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:51,651 INFO L462 AbstractCegarLoop]: Abstraction has 1308 states and 3245 transitions. [2019-12-18 22:03:51,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:03:51,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 3245 transitions. [2019-12-18 22:03:51,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:03:51,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:51,653 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:03:51,653 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:51,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:51,653 INFO L82 PathProgramCache]: Analyzing trace with hash -2066710524, now seen corresponding path program 1 times [2019-12-18 22:03:51,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:51,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517548412] [2019-12-18 22:03:51,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:51,725 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 22:03:51,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517548412] [2019-12-18 22:03:51,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:51,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:03:51,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865244308] [2019-12-18 22:03:51,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:03:51,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:51,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:03:51,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:03:51,729 INFO L87 Difference]: Start difference. First operand 1308 states and 3245 transitions. Second operand 3 states. [2019-12-18 22:03:51,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:51,812 INFO L93 Difference]: Finished difference Result 2018 states and 5064 transitions. [2019-12-18 22:03:51,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:03:51,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 22:03:51,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:51,825 INFO L225 Difference]: With dead ends: 2018 [2019-12-18 22:03:51,825 INFO L226 Difference]: Without dead ends: 2018 [2019-12-18 22:03:51,826 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 22:03:51,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2018 states. [2019-12-18 22:03:51,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2018 to 1522. [2019-12-18 22:03:51,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1522 states. [2019-12-18 22:03:51,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 3832 transitions. [2019-12-18 22:03:51,883 INFO L78 Accepts]: Start accepts. Automaton has 1522 states and 3832 transitions. Word has length 14 [2019-12-18 22:03:51,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:51,886 INFO L462 AbstractCegarLoop]: Abstraction has 1522 states and 3832 transitions. [2019-12-18 22:03:51,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:03:51,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 3832 transitions. [2019-12-18 22:03:51,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:03:51,888 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:51,888 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:03:51,888 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:51,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:51,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1979542058, now seen corresponding path program 1 times [2019-12-18 22:03:51,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:51,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455803141] [2019-12-18 22:03:51,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:52,008 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 22:03:52,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455803141] [2019-12-18 22:03:52,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:52,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:03:52,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054840663] [2019-12-18 22:03:52,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:03:52,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:52,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:03:52,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:03:52,012 INFO L87 Difference]: Start difference. First operand 1522 states and 3832 transitions. Second operand 4 states. [2019-12-18 22:03:52,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:52,168 INFO L93 Difference]: Finished difference Result 1966 states and 4792 transitions. [2019-12-18 22:03:52,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:03:52,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 22:03:52,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:52,179 INFO L225 Difference]: With dead ends: 1966 [2019-12-18 22:03:52,179 INFO L226 Difference]: Without dead ends: 1951 [2019-12-18 22:03:52,180 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 22:03:52,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1951 states. [2019-12-18 22:03:52,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1951 to 1811. [2019-12-18 22:03:52,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1811 states. [2019-12-18 22:03:52,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 4446 transitions. [2019-12-18 22:03:52,225 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 4446 transitions. Word has length 14 [2019-12-18 22:03:52,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:52,225 INFO L462 AbstractCegarLoop]: Abstraction has 1811 states and 4446 transitions. [2019-12-18 22:03:52,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:03:52,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 4446 transitions. [2019-12-18 22:03:52,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 22:03:52,226 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:52,226 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:03:52,227 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:52,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:52,227 INFO L82 PathProgramCache]: Analyzing trace with hash 952302064, now seen corresponding path program 1 times [2019-12-18 22:03:52,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:52,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362031300] [2019-12-18 22:03:52,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:52,268 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 22:03:52,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362031300] [2019-12-18 22:03:52,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:52,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:03:52,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825345070] [2019-12-18 22:03:52,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:03:52,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:52,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:03:52,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:03:52,271 INFO L87 Difference]: Start difference. First operand 1811 states and 4446 transitions. Second operand 4 states. [2019-12-18 22:03:52,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:52,410 INFO L93 Difference]: Finished difference Result 2207 states and 5302 transitions. [2019-12-18 22:03:52,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:03:52,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 22:03:52,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:52,423 INFO L225 Difference]: With dead ends: 2207 [2019-12-18 22:03:52,423 INFO L226 Difference]: Without dead ends: 2186 [2019-12-18 22:03:52,423 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 22:03:52,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2186 states. [2019-12-18 22:03:52,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2186 to 1841. [2019-12-18 22:03:52,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1841 states. [2019-12-18 22:03:52,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 4487 transitions. [2019-12-18 22:03:52,467 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 4487 transitions. Word has length 14 [2019-12-18 22:03:52,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:52,468 INFO L462 AbstractCegarLoop]: Abstraction has 1841 states and 4487 transitions. [2019-12-18 22:03:52,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:03:52,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 4487 transitions. [2019-12-18 22:03:52,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 22:03:52,471 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:52,471 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] [2019-12-18 22:03:52,471 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:52,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:52,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1556475985, now seen corresponding path program 1 times [2019-12-18 22:03:52,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:52,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663898966] [2019-12-18 22:03:52,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:52,524 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 22:03:52,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663898966] [2019-12-18 22:03:52,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:52,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:03:52,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417623110] [2019-12-18 22:03:52,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:03:52,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:52,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:03:52,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:03:52,526 INFO L87 Difference]: Start difference. First operand 1841 states and 4487 transitions. Second operand 3 states. [2019-12-18 22:03:52,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:52,583 INFO L93 Difference]: Finished difference Result 2407 states and 5592 transitions. [2019-12-18 22:03:52,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:03:52,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-18 22:03:52,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:52,597 INFO L225 Difference]: With dead ends: 2407 [2019-12-18 22:03:52,597 INFO L226 Difference]: Without dead ends: 2407 [2019-12-18 22:03:52,597 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 22:03:52,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2407 states. [2019-12-18 22:03:52,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2407 to 1781. [2019-12-18 22:03:52,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1781 states. [2019-12-18 22:03:52,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1781 states and 4074 transitions. [2019-12-18 22:03:52,679 INFO L78 Accepts]: Start accepts. Automaton has 1781 states and 4074 transitions. Word has length 26 [2019-12-18 22:03:52,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:52,680 INFO L462 AbstractCegarLoop]: Abstraction has 1781 states and 4074 transitions. [2019-12-18 22:03:52,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:03:52,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 4074 transitions. [2019-12-18 22:03:52,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 22:03:52,683 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:52,683 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] [2019-12-18 22:03:52,684 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:52,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:52,684 INFO L82 PathProgramCache]: Analyzing trace with hash 118725068, now seen corresponding path program 1 times [2019-12-18 22:03:52,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:52,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976456112] [2019-12-18 22:03:52,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:52,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:52,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 22:03:52,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976456112] [2019-12-18 22:03:52,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:52,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:03:52,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143398661] [2019-12-18 22:03:52,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:03:52,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:52,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:03:52,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:03:52,795 INFO L87 Difference]: Start difference. First operand 1781 states and 4074 transitions. Second operand 5 states. [2019-12-18 22:03:52,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:52,983 INFO L93 Difference]: Finished difference Result 2318 states and 5306 transitions. [2019-12-18 22:03:52,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:03:52,983 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 22:03:52,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:52,991 INFO L225 Difference]: With dead ends: 2318 [2019-12-18 22:03:52,991 INFO L226 Difference]: Without dead ends: 2316 [2019-12-18 22:03:52,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:03:52,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2316 states. [2019-12-18 22:03:53,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2316 to 1877. [2019-12-18 22:03:53,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1877 states. [2019-12-18 22:03:53,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 4306 transitions. [2019-12-18 22:03:53,034 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 4306 transitions. Word has length 26 [2019-12-18 22:03:53,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:53,034 INFO L462 AbstractCegarLoop]: Abstraction has 1877 states and 4306 transitions. [2019-12-18 22:03:53,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:03:53,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 4306 transitions. [2019-12-18 22:03:53,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 22:03:53,038 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:53,038 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] [2019-12-18 22:03:53,038 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:53,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:53,039 INFO L82 PathProgramCache]: Analyzing trace with hash -895166994, now seen corresponding path program 1 times [2019-12-18 22:03:53,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:53,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447139934] [2019-12-18 22:03:53,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:53,121 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 22:03:53,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447139934] [2019-12-18 22:03:53,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:53,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:03:53,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622770147] [2019-12-18 22:03:53,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:03:53,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:53,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:03:53,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:03:53,127 INFO L87 Difference]: Start difference. First operand 1877 states and 4306 transitions. Second operand 5 states. [2019-12-18 22:03:53,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:53,497 INFO L93 Difference]: Finished difference Result 2696 states and 6095 transitions. [2019-12-18 22:03:53,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:03:53,497 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 22:03:53,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:53,504 INFO L225 Difference]: With dead ends: 2696 [2019-12-18 22:03:53,504 INFO L226 Difference]: Without dead ends: 2696 [2019-12-18 22:03:53,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 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 22:03:53,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2696 states. [2019-12-18 22:03:53,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2696 to 2233. [2019-12-18 22:03:53,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2233 states. [2019-12-18 22:03:53,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2233 states to 2233 states and 5066 transitions. [2019-12-18 22:03:53,550 INFO L78 Accepts]: Start accepts. Automaton has 2233 states and 5066 transitions. Word has length 26 [2019-12-18 22:03:53,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:53,550 INFO L462 AbstractCegarLoop]: Abstraction has 2233 states and 5066 transitions. [2019-12-18 22:03:53,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:03:53,551 INFO L276 IsEmpty]: Start isEmpty. Operand 2233 states and 5066 transitions. [2019-12-18 22:03:53,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 22:03:53,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:53,555 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] [2019-12-18 22:03:53,555 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:53,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:53,555 INFO L82 PathProgramCache]: Analyzing trace with hash -945954291, now seen corresponding path program 1 times [2019-12-18 22:03:53,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:53,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705467764] [2019-12-18 22:03:53,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:53,621 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 22:03:53,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705467764] [2019-12-18 22:03:53,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:53,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:03:53,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594880483] [2019-12-18 22:03:53,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:03:53,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:53,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:03:53,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:03:53,623 INFO L87 Difference]: Start difference. First operand 2233 states and 5066 transitions. Second operand 5 states. [2019-12-18 22:03:53,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:53,897 INFO L93 Difference]: Finished difference Result 2732 states and 6194 transitions. [2019-12-18 22:03:53,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:03:53,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 22:03:53,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:53,904 INFO L225 Difference]: With dead ends: 2732 [2019-12-18 22:03:53,904 INFO L226 Difference]: Without dead ends: 2730 [2019-12-18 22:03:53,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:03:53,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2730 states. [2019-12-18 22:03:53,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2730 to 2206. [2019-12-18 22:03:53,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2206 states. [2019-12-18 22:03:53,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2206 states to 2206 states and 4981 transitions. [2019-12-18 22:03:53,954 INFO L78 Accepts]: Start accepts. Automaton has 2206 states and 4981 transitions. Word has length 27 [2019-12-18 22:03:53,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:53,955 INFO L462 AbstractCegarLoop]: Abstraction has 2206 states and 4981 transitions. [2019-12-18 22:03:53,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:03:53,955 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 4981 transitions. [2019-12-18 22:03:53,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 22:03:53,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:53,960 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] [2019-12-18 22:03:53,960 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:53,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:53,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1929035231, now seen corresponding path program 1 times [2019-12-18 22:03:53,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:53,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724856349] [2019-12-18 22:03:53,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:54,029 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 22:03:54,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724856349] [2019-12-18 22:03:54,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:54,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:03:54,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53488870] [2019-12-18 22:03:54,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:03:54,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:54,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:03:54,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:03:54,032 INFO L87 Difference]: Start difference. First operand 2206 states and 4981 transitions. Second operand 5 states. [2019-12-18 22:03:54,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:54,090 INFO L93 Difference]: Finished difference Result 1268 states and 2647 transitions. [2019-12-18 22:03:54,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:03:54,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 22:03:54,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:54,093 INFO L225 Difference]: With dead ends: 1268 [2019-12-18 22:03:54,094 INFO L226 Difference]: Without dead ends: 1125 [2019-12-18 22:03:54,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:03:54,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2019-12-18 22:03:54,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 981. [2019-12-18 22:03:54,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 981 states. [2019-12-18 22:03:54,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 2051 transitions. [2019-12-18 22:03:54,113 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 2051 transitions. Word has length 27 [2019-12-18 22:03:54,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:54,114 INFO L462 AbstractCegarLoop]: Abstraction has 981 states and 2051 transitions. [2019-12-18 22:03:54,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:03:54,114 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 2051 transitions. [2019-12-18 22:03:54,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 22:03:54,117 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:54,117 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] [2019-12-18 22:03:54,117 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:54,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:54,118 INFO L82 PathProgramCache]: Analyzing trace with hash 464634158, now seen corresponding path program 1 times [2019-12-18 22:03:54,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:54,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817043998] [2019-12-18 22:03:54,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:54,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:54,169 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 22:03:54,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817043998] [2019-12-18 22:03:54,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:54,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:03:54,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958682955] [2019-12-18 22:03:54,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:03:54,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:54,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:03:54,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:03:54,172 INFO L87 Difference]: Start difference. First operand 981 states and 2051 transitions. Second operand 4 states. [2019-12-18 22:03:54,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:54,192 INFO L93 Difference]: Finished difference Result 1723 states and 3617 transitions. [2019-12-18 22:03:54,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:03:54,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-18 22:03:54,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:54,194 INFO L225 Difference]: With dead ends: 1723 [2019-12-18 22:03:54,194 INFO L226 Difference]: Without dead ends: 770 [2019-12-18 22:03:54,195 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 22:03:54,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2019-12-18 22:03:54,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 770. [2019-12-18 22:03:54,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2019-12-18 22:03:54,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1614 transitions. [2019-12-18 22:03:54,209 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1614 transitions. Word has length 41 [2019-12-18 22:03:54,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:54,209 INFO L462 AbstractCegarLoop]: Abstraction has 770 states and 1614 transitions. [2019-12-18 22:03:54,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:03:54,209 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1614 transitions. [2019-12-18 22:03:54,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 22:03:54,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:54,212 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] [2019-12-18 22:03:54,212 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:54,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:54,213 INFO L82 PathProgramCache]: Analyzing trace with hash 602720702, now seen corresponding path program 2 times [2019-12-18 22:03:54,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:54,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043640373] [2019-12-18 22:03:54,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:54,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:54,309 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 22:03:54,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043640373] [2019-12-18 22:03:54,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:54,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:03:54,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858474413] [2019-12-18 22:03:54,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:03:54,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:54,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:03:54,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:03:54,312 INFO L87 Difference]: Start difference. First operand 770 states and 1614 transitions. Second operand 7 states. [2019-12-18 22:03:54,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:54,496 INFO L93 Difference]: Finished difference Result 1263 states and 2581 transitions. [2019-12-18 22:03:54,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 22:03:54,497 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-18 22:03:54,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:54,500 INFO L225 Difference]: With dead ends: 1263 [2019-12-18 22:03:54,501 INFO L226 Difference]: Without dead ends: 827 [2019-12-18 22:03:54,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:03:54,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2019-12-18 22:03:54,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 783. [2019-12-18 22:03:54,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-12-18 22:03:54,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1614 transitions. [2019-12-18 22:03:54,517 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1614 transitions. Word has length 41 [2019-12-18 22:03:54,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:54,518 INFO L462 AbstractCegarLoop]: Abstraction has 783 states and 1614 transitions. [2019-12-18 22:03:54,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:03:54,518 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1614 transitions. [2019-12-18 22:03:54,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 22:03:54,520 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:54,520 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] [2019-12-18 22:03:54,521 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:54,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:54,521 INFO L82 PathProgramCache]: Analyzing trace with hash 261585982, now seen corresponding path program 3 times [2019-12-18 22:03:54,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:54,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277597596] [2019-12-18 22:03:54,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:54,638 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 22:03:54,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277597596] [2019-12-18 22:03:54,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:54,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:03:54,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291454849] [2019-12-18 22:03:54,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:03:54,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:54,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:03:54,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:03:54,640 INFO L87 Difference]: Start difference. First operand 783 states and 1614 transitions. Second operand 6 states. [2019-12-18 22:03:55,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:55,065 INFO L93 Difference]: Finished difference Result 913 states and 1857 transitions. [2019-12-18 22:03:55,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:03:55,066 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 22:03:55,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:55,069 INFO L225 Difference]: With dead ends: 913 [2019-12-18 22:03:55,069 INFO L226 Difference]: Without dead ends: 913 [2019-12-18 22:03:55,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:03:55,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2019-12-18 22:03:55,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 813. [2019-12-18 22:03:55,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-12-18 22:03:55,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1669 transitions. [2019-12-18 22:03:55,090 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1669 transitions. Word has length 41 [2019-12-18 22:03:55,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:55,090 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1669 transitions. [2019-12-18 22:03:55,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:03:55,090 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1669 transitions. [2019-12-18 22:03:55,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 22:03:55,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:55,095 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] [2019-12-18 22:03:55,095 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:55,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:55,095 INFO L82 PathProgramCache]: Analyzing trace with hash -645645490, now seen corresponding path program 4 times [2019-12-18 22:03:55,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:55,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64672044] [2019-12-18 22:03:55,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:55,188 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 22:03:55,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64672044] [2019-12-18 22:03:55,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:55,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:03:55,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840375638] [2019-12-18 22:03:55,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:03:55,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:55,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:03:55,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:03:55,191 INFO L87 Difference]: Start difference. First operand 813 states and 1669 transitions. Second operand 3 states. [2019-12-18 22:03:55,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:55,203 INFO L93 Difference]: Finished difference Result 811 states and 1664 transitions. [2019-12-18 22:03:55,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:03:55,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-18 22:03:55,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:55,206 INFO L225 Difference]: With dead ends: 811 [2019-12-18 22:03:55,206 INFO L226 Difference]: Without dead ends: 811 [2019-12-18 22:03:55,207 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 22:03:55,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-12-18 22:03:55,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 670. [2019-12-18 22:03:55,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-12-18 22:03:55,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1397 transitions. [2019-12-18 22:03:55,223 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1397 transitions. Word has length 41 [2019-12-18 22:03:55,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:03:55,223 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 1397 transitions. [2019-12-18 22:03:55,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:03:55,223 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1397 transitions. [2019-12-18 22:03:55,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 22:03:55,226 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:55,226 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:03:55,226 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:55,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:55,226 INFO L82 PathProgramCache]: Analyzing trace with hash -866328177, now seen corresponding path program 1 times [2019-12-18 22:03:55,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:55,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210397937] [2019-12-18 22:03:55,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:03:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:03:55,384 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 22:03:55,385 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 22:03:55,389 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$w_buff0~0_26) (= 0 v_~y$read_delayed_var~0.base_6) (= v_~main$tmp_guard0~0_10 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1655~0.base_19| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1655~0.base_19|) |v_ULTIMATE.start_main_~#t1655~0.offset_17| 0)) |v_#memory_int_11|) (= 0 v_~__unbuffered_p1_EAX~0_13) (= 0 v_~__unbuffered_p0_EAX~0_13) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~y$r_buff1_thd1~0_37) (= 0 v_~y$r_buff1_thd0~0_20) (= 0 v_~__unbuffered_cnt~0_15) (= |v_#NULL.offset_6| 0) (= 0 |v_ULTIMATE.start_main_~#t1655~0.offset_17|) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd2~0_26 0) (= 0 v_~y$w_buff0_used~0_93) (= v_~y$w_buff1_used~0_54 0) (= v_~x~0_10 0) (= 0 v_~y$w_buff1~0_21) (= v_~y$r_buff0_thd0~0_22 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1655~0.base_19|) 0) (= 0 v_~y$flush_delayed~0_13) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1655~0.base_19| 4)) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~y~0_22 0) (= 0 v_~weak$$choice0~0_7) (= v_~y$r_buff0_thd1~0_65 0) (= 0 v_~y$r_buff1_thd2~0_17) (= 0 v_~z~0_8) (= v_~y$mem_tmp~0_10 0) (= v_~__unbuffered_p1_EBX~0_13 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~main$tmp_guard1~0_12 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1655~0.base_19|) (= (store .cse0 |v_ULTIMATE.start_main_~#t1655~0.base_19| 1) |v_#valid_38|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_93, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_7|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_37, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, ~y$w_buff0~0=v_~y$w_buff0~0_26, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_65, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, #length=|v_#length_13|, ~y~0=v_~y~0_22, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_18|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_10|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_10|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_10|, ULTIMATE.start_main_~#t1656~0.base=|v_ULTIMATE.start_main_~#t1656~0.base_22|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1655~0.base=|v_ULTIMATE.start_main_~#t1655~0.base_19|, ~y$w_buff1~0=v_~y$w_buff1~0_21, ULTIMATE.start_main_~#t1656~0.offset=|v_ULTIMATE.start_main_~#t1656~0.offset_17|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_22, #valid=|v_#valid_38|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_26, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1655~0.offset=|v_ULTIMATE.start_main_~#t1655~0.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~z~0=v_~z~0_8, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_20, ~x~0=v_~x~0_10, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_54} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t1656~0.base, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t1655~0.base, ~y$w_buff1~0, ULTIMATE.start_main_~#t1656~0.offset, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_~#t1655~0.offset, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 22:03:55,390 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L802-1-->L804: Formula: (and (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1656~0.base_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1656~0.base_9|)) (= (store |v_#valid_20| |v_ULTIMATE.start_main_~#t1656~0.base_9| 1) |v_#valid_19|) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1656~0.base_9| 4) |v_#length_9|) (= |v_ULTIMATE.start_main_~#t1656~0.offset_8| 0) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1656~0.base_9| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1656~0.base_9|) |v_ULTIMATE.start_main_~#t1656~0.offset_8| 1))) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t1656~0.base_9|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, ULTIMATE.start_main_~#t1656~0.offset=|v_ULTIMATE.start_main_~#t1656~0.offset_8|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1656~0.base=|v_ULTIMATE.start_main_~#t1656~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1656~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1656~0.base] because there is no mapped edge [2019-12-18 22:03:55,391 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L5-->L779: Formula: (and (= v_~y$r_buff0_thd1~0_53 v_~y$r_buff1_thd1~0_28) (= v_~y$r_buff0_thd2~0_21 v_~y$r_buff1_thd2~0_11) (= v_~__unbuffered_p1_EBX~0_5 v_~x~0_5) (= v_~y$r_buff0_thd0~0_17 v_~y$r_buff1_thd0~0_11) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8)) (= v_~__unbuffered_p1_EAX~0_5 v_~z~0_4) (= 1 v_~z~0_4) (= v_~y$r_buff0_thd2~0_20 1)) InVars {P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_53, ~x~0=v_~x~0_5} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_11, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_28, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_5, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_5, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_20, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_53, ~z~0=v_~z~0_4, ~x~0=v_~x~0_5, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_11} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 22:03:55,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In776859373 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In776859373 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out776859373| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out776859373| ~y$w_buff0_used~0_In776859373)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In776859373, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In776859373} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In776859373, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In776859373, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out776859373|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 22:03:55,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1092603951 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1092603951 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1092603951 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-1092603951 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-1092603951|)) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1092603951 |P1Thread1of1ForFork0_#t~ite29_Out-1092603951|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1092603951, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1092603951, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1092603951, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1092603951} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1092603951, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1092603951, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1092603951, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1092603951|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1092603951} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 22:03:55,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L782-->L783: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1422285263 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1422285263 256)))) (or (and (= ~y$r_buff0_thd2~0_In1422285263 ~y$r_buff0_thd2~0_Out1422285263) (or .cse0 .cse1)) (and (= 0 ~y$r_buff0_thd2~0_Out1422285263) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1422285263, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1422285263} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1422285263, P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1422285263|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1422285263} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 22:03:55,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L742-->L742-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-381055827 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite17_In-381055827| |P0Thread1of1ForFork1_#t~ite17_Out-381055827|) (= ~y$w_buff1_used~0_In-381055827 |P0Thread1of1ForFork1_#t~ite18_Out-381055827|)) (and (= ~y$w_buff1_used~0_In-381055827 |P0Thread1of1ForFork1_#t~ite17_Out-381055827|) .cse0 (= |P0Thread1of1ForFork1_#t~ite17_Out-381055827| |P0Thread1of1ForFork1_#t~ite18_Out-381055827|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-381055827 256)))) (or (= (mod ~y$w_buff0_used~0_In-381055827 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In-381055827 256)) .cse1) (and (= (mod ~y$r_buff1_thd1~0_In-381055827 256) 0) .cse1)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-381055827, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-381055827, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-381055827, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_In-381055827|, ~weak$$choice2~0=~weak$$choice2~0_In-381055827, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-381055827} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-381055827, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-381055827, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-381055827, P0Thread1of1ForFork1_#t~ite18=|P0Thread1of1ForFork1_#t~ite18_Out-381055827|, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_Out-381055827|, ~weak$$choice2~0=~weak$$choice2~0_In-381055827, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-381055827} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite18, P0Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-18 22:03:55,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L743-->L744: Formula: (and (= v_~y$r_buff0_thd1~0_47 v_~y$r_buff0_thd1~0_46) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_47, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_10|, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_9|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_46, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, P0Thread1of1ForFork1_#t~ite19, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 22:03:55,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [599] [599] L746-->L754: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~y~0_16 v_~y$mem_tmp~0_4) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~y~0=v_~y~0_16} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-18 22:03:55,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L783-->L783-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd2~0_In1472992694 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1472992694 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1472992694 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1472992694 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite31_Out1472992694| ~y$r_buff1_thd2~0_In1472992694) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork0_#t~ite31_Out1472992694| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1472992694, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1472992694, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1472992694, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1472992694} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1472992694, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1472992694, P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1472992694|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1472992694, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1472992694} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 22:03:55,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L783-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 22:03:55,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [581] [581] L808-->L810-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= 0 (mod v_~y$w_buff0_used~0_62 256)) (= (mod v_~y$r_buff0_thd0~0_15 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_62, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_62, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 22:03:55,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L810-2-->L810-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In746291652 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In746291652 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite34_Out746291652| ~y$w_buff1~0_In746291652) (not .cse1)) (and (= ~y~0_In746291652 |ULTIMATE.start_main_#t~ite34_Out746291652|) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In746291652, ~y~0=~y~0_In746291652, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In746291652, ~y$w_buff1_used~0=~y$w_buff1_used~0_In746291652} OutVars{~y$w_buff1~0=~y$w_buff1~0_In746291652, ~y~0=~y~0_In746291652, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In746291652, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out746291652|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In746291652} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 22:03:55,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [569] [569] L810-4-->L811: Formula: (= v_~y~0_13 |v_ULTIMATE.start_main_#t~ite34_7|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ~y~0=v_~y~0_13, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 22:03:55,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1406225912 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1406225912 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite36_Out-1406225912|)) (and (= ~y$w_buff0_used~0_In-1406225912 |ULTIMATE.start_main_#t~ite36_Out-1406225912|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1406225912, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1406225912} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1406225912, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1406225912, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1406225912|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 22:03:55,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L812-->L812-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In688589467 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In688589467 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In688589467 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In688589467 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In688589467 |ULTIMATE.start_main_#t~ite37_Out688589467|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite37_Out688589467|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In688589467, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In688589467, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In688589467, ~y$w_buff1_used~0=~y$w_buff1_used~0_In688589467} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In688589467, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In688589467, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out688589467|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In688589467, ~y$w_buff1_used~0=~y$w_buff1_used~0_In688589467} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 22:03:55,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1152263580 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1152263580 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out1152263580| ~y$r_buff0_thd0~0_In1152263580)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite38_Out1152263580| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1152263580, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1152263580} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1152263580, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1152263580, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1152263580|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 22:03:55,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L814-->L814-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In2044333317 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In2044333317 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In2044333317 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In2044333317 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In2044333317 |ULTIMATE.start_main_#t~ite39_Out2044333317|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite39_Out2044333317|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2044333317, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2044333317, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2044333317, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2044333317} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2044333317, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out2044333317|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2044333317, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2044333317, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2044333317} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 22:03:55,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~__unbuffered_p0_EAX~0_9 0) (= v_~main$tmp_guard1~0_8 0) (= |v_ULTIMATE.start_main_#t~ite39_12| v_~y$r_buff1_thd0~0_15) (= 1 v_~__unbuffered_p1_EAX~0_9) (= 0 v_~__unbuffered_p1_EBX~0_9)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_12|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_15, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 22:03:55,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:03:55 BasicIcfg [2019-12-18 22:03:55,508 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:03:55,510 INFO L168 Benchmark]: Toolchain (without parser) took 10689.44 ms. Allocated memory was 140.0 MB in the beginning and 359.1 MB in the end (delta: 219.2 MB). Free memory was 102.9 MB in the beginning and 227.0 MB in the end (delta: -124.1 MB). Peak memory consumption was 95.0 MB. Max. memory is 7.1 GB. [2019-12-18 22:03:55,511 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 140.0 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 22:03:55,512 INFO L168 Benchmark]: CACSL2BoogieTranslator took 725.00 ms. Allocated memory was 140.0 MB in the beginning and 205.0 MB in the end (delta: 65.0 MB). Free memory was 102.4 MB in the beginning and 158.0 MB in the end (delta: -55.5 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2019-12-18 22:03:55,516 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.28 ms. Allocated memory is still 205.0 MB. Free memory was 158.0 MB in the beginning and 155.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 22:03:55,517 INFO L168 Benchmark]: Boogie Preprocessor took 51.64 ms. Allocated memory is still 205.0 MB. Free memory was 155.3 MB in the beginning and 153.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 22:03:55,519 INFO L168 Benchmark]: RCFGBuilder took 760.04 ms. Allocated memory is still 205.0 MB. Free memory was 153.3 MB in the beginning and 111.7 MB in the end (delta: 41.6 MB). Peak memory consumption was 41.6 MB. Max. memory is 7.1 GB. [2019-12-18 22:03:55,520 INFO L168 Benchmark]: TraceAbstraction took 9086.24 ms. Allocated memory was 205.0 MB in the beginning and 359.1 MB in the end (delta: 154.1 MB). Free memory was 111.0 MB in the beginning and 227.0 MB in the end (delta: -116.0 MB). Peak memory consumption was 38.2 MB. Max. memory is 7.1 GB. [2019-12-18 22:03:55,529 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.18 ms. Allocated memory is still 140.0 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 725.00 ms. Allocated memory was 140.0 MB in the beginning and 205.0 MB in the end (delta: 65.0 MB). Free memory was 102.4 MB in the beginning and 158.0 MB in the end (delta: -55.5 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.28 ms. Allocated memory is still 205.0 MB. Free memory was 158.0 MB in the beginning and 155.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.64 ms. Allocated memory is still 205.0 MB. Free memory was 155.3 MB in the beginning and 153.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 760.04 ms. Allocated memory is still 205.0 MB. Free memory was 153.3 MB in the beginning and 111.7 MB in the end (delta: 41.6 MB). Peak memory consumption was 41.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9086.24 ms. Allocated memory was 205.0 MB in the beginning and 359.1 MB in the end (delta: 154.1 MB). Free memory was 111.0 MB in the beginning and 227.0 MB in the end (delta: -116.0 MB). Peak memory consumption was 38.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 137 ProgramPointsBefore, 69 ProgramPointsAfterwards, 165 TransitionsBefore, 81 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 19 ChoiceCompositions, 4208 VarBasedMoverChecksPositive, 150 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 41237 CheckedPairsTotal, 97 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1655, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t1656, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L759] 2 y$w_buff1 = y$w_buff0 [L760] 2 y$w_buff0 = 1 [L761] 2 y$w_buff1_used = y$w_buff0_used [L762] 2 y$w_buff0_used = (_Bool)1 [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 1 x = 1 [L734] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L735] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L736] 1 y$flush_delayed = weak$$choice2 [L737] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L780] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L781] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L738] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L739] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L741] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L741] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L742] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 131 locations, 2 error locations. Result: UNSAFE, OverallTime: 8.7s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1601 SDtfs, 1431 SDslu, 2638 SDs, 0 SdLazy, 1413 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 21 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7504occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 14 MinimizatonAttempts, 3462 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 396 NumberOfCodeBlocks, 396 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 340 ConstructedInterpolants, 0 QuantifiedInterpolants, 30351 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...