/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix012_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 16:23:14,501 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 16:23:14,504 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 16:23:14,523 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 16:23:14,523 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 16:23:14,526 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 16:23:14,528 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 16:23:14,537 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 16:23:14,542 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 16:23:14,545 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 16:23:14,547 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 16:23:14,548 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 16:23:14,549 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 16:23:14,550 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 16:23:14,553 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 16:23:14,554 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 16:23:14,555 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 16:23:14,556 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 16:23:14,558 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 16:23:14,562 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 16:23:14,563 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 16:23:14,564 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 16:23:14,567 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 16:23:14,568 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 16:23:14,570 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 16:23:14,570 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 16:23:14,571 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 16:23:14,572 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 16:23:14,573 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 16:23:14,575 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 16:23:14,575 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 16:23:14,576 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 16:23:14,577 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 16:23:14,578 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 16:23:14,579 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 16:23:14,579 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 16:23:14,580 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 16:23:14,580 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 16:23:14,580 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 16:23:14,582 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 16:23:14,583 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 16:23:14,584 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 16:23:14,615 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 16:23:14,616 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 16:23:14,617 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 16:23:14,617 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 16:23:14,617 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 16:23:14,618 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 16:23:14,618 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 16:23:14,618 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 16:23:14,618 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 16:23:14,618 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 16:23:14,618 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 16:23:14,619 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 16:23:14,619 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 16:23:14,619 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 16:23:14,619 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 16:23:14,619 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 16:23:14,620 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 16:23:14,620 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 16:23:14,620 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 16:23:14,620 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 16:23:14,620 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 16:23:14,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:23:14,621 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 16:23:14,621 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 16:23:14,621 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 16:23:14,621 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 16:23:14,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 16:23:14,622 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 16:23:14,622 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 16:23:14,888 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 16:23:14,903 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 16:23:14,907 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 16:23:14,908 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 16:23:14,909 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 16:23:14,910 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_rmo.opt.i [2019-12-18 16:23:14,982 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb78946b8/d116dfc0cfad4567b5e24812a60a012c/FLAG1acf84412 [2019-12-18 16:23:15,557 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 16:23:15,558 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_rmo.opt.i [2019-12-18 16:23:15,580 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb78946b8/d116dfc0cfad4567b5e24812a60a012c/FLAG1acf84412 [2019-12-18 16:23:15,811 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb78946b8/d116dfc0cfad4567b5e24812a60a012c [2019-12-18 16:23:15,821 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 16:23:15,823 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 16:23:15,827 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 16:23:15,827 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 16:23:15,831 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 16:23:15,832 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:23:15" (1/1) ... [2019-12-18 16:23:15,835 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71143ccb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:23:15, skipping insertion in model container [2019-12-18 16:23:15,836 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:23:15" (1/1) ... [2019-12-18 16:23:15,845 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 16:23:15,912 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 16:23:16,394 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:23:16,411 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 16:23:16,501 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:23:16,582 INFO L208 MainTranslator]: Completed translation [2019-12-18 16:23:16,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:23:16 WrapperNode [2019-12-18 16:23:16,582 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 16:23:16,583 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 16:23:16,583 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 16:23:16,583 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 16:23:16,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:23:16" (1/1) ... [2019-12-18 16:23:16,611 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:23:16" (1/1) ... [2019-12-18 16:23:16,641 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 16:23:16,642 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 16:23:16,642 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 16:23:16,642 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 16:23:16,649 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:23:16" (1/1) ... [2019-12-18 16:23:16,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:23:16" (1/1) ... [2019-12-18 16:23:16,655 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:23:16" (1/1) ... [2019-12-18 16:23:16,655 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:23:16" (1/1) ... [2019-12-18 16:23:16,667 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:23:16" (1/1) ... [2019-12-18 16:23:16,673 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:23:16" (1/1) ... [2019-12-18 16:23:16,676 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:23:16" (1/1) ... [2019-12-18 16:23:16,682 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 16:23:16,682 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 16:23:16,682 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 16:23:16,682 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 16:23:16,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:23:16" (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 16:23:16,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 16:23:16,746 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 16:23:16,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 16:23:16,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 16:23:16,747 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 16:23:16,747 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 16:23:16,747 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 16:23:16,747 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 16:23:16,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 16:23:16,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 16:23:16,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 16:23:16,750 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 16:23:17,438 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 16:23:17,439 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 16:23:17,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:23:17 BoogieIcfgContainer [2019-12-18 16:23:17,440 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 16:23:17,442 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 16:23:17,442 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 16:23:17,448 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 16:23:17,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 04:23:15" (1/3) ... [2019-12-18 16:23:17,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c32c4a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:23:17, skipping insertion in model container [2019-12-18 16:23:17,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:23:16" (2/3) ... [2019-12-18 16:23:17,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c32c4a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:23:17, skipping insertion in model container [2019-12-18 16:23:17,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:23:17" (3/3) ... [2019-12-18 16:23:17,455 INFO L109 eAbstractionObserver]: Analyzing ICFG mix012_rmo.opt.i [2019-12-18 16:23:17,466 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 16:23:17,467 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 16:23:17,479 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 16:23:17,480 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 16:23:17,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,542 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,543 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,543 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,543 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,544 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,559 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,559 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,608 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,609 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,609 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,632 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,635 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:23:17,651 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 16:23:17,673 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 16:23:17,673 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 16:23:17,673 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 16:23:17,673 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 16:23:17,673 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 16:23:17,674 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 16:23:17,674 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 16:23:17,674 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 16:23:17,691 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-18 16:23:17,693 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-18 16:23:17,774 INFO L126 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-18 16:23:17,774 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:23:17,788 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 16:23:17,808 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-18 16:23:17,861 INFO L126 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-18 16:23:17,861 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:23:17,868 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 16:23:17,884 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 16:23:17,886 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 16:23:22,643 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 16:23:22,749 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 16:23:23,048 INFO L206 etLargeBlockEncoding]: Checked pairs total: 77720 [2019-12-18 16:23:23,049 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-18 16:23:23,053 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-18 16:23:23,568 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8912 states. [2019-12-18 16:23:23,570 INFO L276 IsEmpty]: Start isEmpty. Operand 8912 states. [2019-12-18 16:23:23,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 16:23:23,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:23,577 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 16:23:23,578 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:23,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:23,584 INFO L82 PathProgramCache]: Analyzing trace with hash 795178, now seen corresponding path program 1 times [2019-12-18 16:23:23,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:23,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773955858] [2019-12-18 16:23:23,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:23,844 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 16:23:23,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773955858] [2019-12-18 16:23:23,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:23,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:23:23,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976093540] [2019-12-18 16:23:23,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:23:23,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:23,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:23:23,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:23:23,869 INFO L87 Difference]: Start difference. First operand 8912 states. Second operand 3 states. [2019-12-18 16:23:24,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:24,170 INFO L93 Difference]: Finished difference Result 8760 states and 28314 transitions. [2019-12-18 16:23:24,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:23:24,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 16:23:24,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:24,259 INFO L225 Difference]: With dead ends: 8760 [2019-12-18 16:23:24,259 INFO L226 Difference]: Without dead ends: 7798 [2019-12-18 16:23:24,261 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 16:23:24,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7798 states. [2019-12-18 16:23:24,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7798 to 7798. [2019-12-18 16:23:24,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7798 states. [2019-12-18 16:23:24,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7798 states to 7798 states and 25120 transitions. [2019-12-18 16:23:24,700 INFO L78 Accepts]: Start accepts. Automaton has 7798 states and 25120 transitions. Word has length 3 [2019-12-18 16:23:24,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:24,701 INFO L462 AbstractCegarLoop]: Abstraction has 7798 states and 25120 transitions. [2019-12-18 16:23:24,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:23:24,701 INFO L276 IsEmpty]: Start isEmpty. Operand 7798 states and 25120 transitions. [2019-12-18 16:23:24,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 16:23:24,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:24,709 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:23:24,709 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:24,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:24,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1406163788, now seen corresponding path program 1 times [2019-12-18 16:23:24,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:24,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449075389] [2019-12-18 16:23:24,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:24,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:24,829 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 16:23:24,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449075389] [2019-12-18 16:23:24,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:24,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:23:24,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799356824] [2019-12-18 16:23:24,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:23:24,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:24,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:23:24,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:23:24,833 INFO L87 Difference]: Start difference. First operand 7798 states and 25120 transitions. Second operand 3 states. [2019-12-18 16:23:24,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:24,872 INFO L93 Difference]: Finished difference Result 1232 states and 2767 transitions. [2019-12-18 16:23:24,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:23:24,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 16:23:24,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:24,879 INFO L225 Difference]: With dead ends: 1232 [2019-12-18 16:23:24,879 INFO L226 Difference]: Without dead ends: 1232 [2019-12-18 16:23:24,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:23:24,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-12-18 16:23:24,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2019-12-18 16:23:24,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2019-12-18 16:23:24,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 2767 transitions. [2019-12-18 16:23:24,919 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 2767 transitions. Word has length 11 [2019-12-18 16:23:24,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:24,919 INFO L462 AbstractCegarLoop]: Abstraction has 1232 states and 2767 transitions. [2019-12-18 16:23:24,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:23:24,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 2767 transitions. [2019-12-18 16:23:24,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 16:23:24,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:24,925 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:23:24,926 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:24,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:24,926 INFO L82 PathProgramCache]: Analyzing trace with hash 540130104, now seen corresponding path program 1 times [2019-12-18 16:23:24,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:24,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954249987] [2019-12-18 16:23:24,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:25,078 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 16:23:25,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954249987] [2019-12-18 16:23:25,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:25,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:23:25,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041304449] [2019-12-18 16:23:25,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:23:25,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:25,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:23:25,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:23:25,081 INFO L87 Difference]: Start difference. First operand 1232 states and 2767 transitions. Second operand 5 states. [2019-12-18 16:23:25,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:25,389 INFO L93 Difference]: Finished difference Result 1829 states and 4038 transitions. [2019-12-18 16:23:25,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 16:23:25,390 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 16:23:25,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:25,398 INFO L225 Difference]: With dead ends: 1829 [2019-12-18 16:23:25,398 INFO L226 Difference]: Without dead ends: 1829 [2019-12-18 16:23:25,399 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 16:23:25,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2019-12-18 16:23:25,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1572. [2019-12-18 16:23:25,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-12-18 16:23:25,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 3508 transitions. [2019-12-18 16:23:25,447 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 3508 transitions. Word has length 14 [2019-12-18 16:23:25,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:25,448 INFO L462 AbstractCegarLoop]: Abstraction has 1572 states and 3508 transitions. [2019-12-18 16:23:25,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:23:25,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 3508 transitions. [2019-12-18 16:23:25,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 16:23:25,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:25,451 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:23:25,451 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:25,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:25,452 INFO L82 PathProgramCache]: Analyzing trace with hash 603755618, now seen corresponding path program 1 times [2019-12-18 16:23:25,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:25,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422109047] [2019-12-18 16:23:25,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:25,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:25,653 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 16:23:25,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422109047] [2019-12-18 16:23:25,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:25,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:23:25,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87818446] [2019-12-18 16:23:25,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:23:25,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:25,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:23:25,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:23:25,655 INFO L87 Difference]: Start difference. First operand 1572 states and 3508 transitions. Second operand 7 states. [2019-12-18 16:23:26,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:26,268 INFO L93 Difference]: Finished difference Result 2218 states and 4789 transitions. [2019-12-18 16:23:26,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 16:23:26,268 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-12-18 16:23:26,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:26,278 INFO L225 Difference]: With dead ends: 2218 [2019-12-18 16:23:26,279 INFO L226 Difference]: Without dead ends: 2218 [2019-12-18 16:23:26,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:23:26,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2019-12-18 16:23:26,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 1705. [2019-12-18 16:23:26,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1705 states. [2019-12-18 16:23:26,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 3772 transitions. [2019-12-18 16:23:26,321 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 3772 transitions. Word has length 24 [2019-12-18 16:23:26,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:26,322 INFO L462 AbstractCegarLoop]: Abstraction has 1705 states and 3772 transitions. [2019-12-18 16:23:26,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:23:26,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 3772 transitions. [2019-12-18 16:23:26,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 16:23:26,325 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:26,325 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 16:23:26,325 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:26,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:26,326 INFO L82 PathProgramCache]: Analyzing trace with hash 461887986, now seen corresponding path program 1 times [2019-12-18 16:23:26,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:26,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082360251] [2019-12-18 16:23:26,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:26,378 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 16:23:26,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082360251] [2019-12-18 16:23:26,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:26,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:23:26,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260707732] [2019-12-18 16:23:26,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:23:26,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:26,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:23:26,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:23:26,380 INFO L87 Difference]: Start difference. First operand 1705 states and 3772 transitions. Second operand 3 states. [2019-12-18 16:23:26,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:26,392 INFO L93 Difference]: Finished difference Result 1704 states and 3770 transitions. [2019-12-18 16:23:26,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:23:26,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-18 16:23:26,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:26,401 INFO L225 Difference]: With dead ends: 1704 [2019-12-18 16:23:26,402 INFO L226 Difference]: Without dead ends: 1704 [2019-12-18 16:23:26,402 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 16:23:26,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1704 states. [2019-12-18 16:23:26,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1704 to 1704. [2019-12-18 16:23:26,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2019-12-18 16:23:26,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 3770 transitions. [2019-12-18 16:23:26,438 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 3770 transitions. Word has length 26 [2019-12-18 16:23:26,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:26,438 INFO L462 AbstractCegarLoop]: Abstraction has 1704 states and 3770 transitions. [2019-12-18 16:23:26,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:23:26,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 3770 transitions. [2019-12-18 16:23:26,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 16:23:26,441 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:26,441 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 16:23:26,441 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:26,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:26,441 INFO L82 PathProgramCache]: Analyzing trace with hash -691470702, now seen corresponding path program 1 times [2019-12-18 16:23:26,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:26,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516352847] [2019-12-18 16:23:26,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:26,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:26,492 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 16:23:26,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516352847] [2019-12-18 16:23:26,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:26,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:23:26,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868945313] [2019-12-18 16:23:26,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:23:26,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:26,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:23:26,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:23:26,494 INFO L87 Difference]: Start difference. First operand 1704 states and 3770 transitions. Second operand 4 states. [2019-12-18 16:23:26,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:26,519 INFO L93 Difference]: Finished difference Result 2700 states and 6022 transitions. [2019-12-18 16:23:26,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:23:26,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-18 16:23:26,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:26,526 INFO L225 Difference]: With dead ends: 2700 [2019-12-18 16:23:26,526 INFO L226 Difference]: Without dead ends: 1250 [2019-12-18 16:23:26,526 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 16:23:26,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2019-12-18 16:23:26,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1233. [2019-12-18 16:23:26,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1233 states. [2019-12-18 16:23:26,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 2691 transitions. [2019-12-18 16:23:26,551 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 2691 transitions. Word has length 27 [2019-12-18 16:23:26,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:26,552 INFO L462 AbstractCegarLoop]: Abstraction has 1233 states and 2691 transitions. [2019-12-18 16:23:26,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:23:26,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 2691 transitions. [2019-12-18 16:23:26,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 16:23:26,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:26,554 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 16:23:26,554 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:26,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:26,555 INFO L82 PathProgramCache]: Analyzing trace with hash -250638352, now seen corresponding path program 2 times [2019-12-18 16:23:26,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:26,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783200138] [2019-12-18 16:23:26,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:26,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 16:23:26,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783200138] [2019-12-18 16:23:26,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:26,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:23:26,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448834549] [2019-12-18 16:23:26,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:23:26,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:26,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:23:26,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:23:26,624 INFO L87 Difference]: Start difference. First operand 1233 states and 2691 transitions. Second operand 5 states. [2019-12-18 16:23:27,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:27,057 INFO L93 Difference]: Finished difference Result 1899 states and 4075 transitions. [2019-12-18 16:23:27,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 16:23:27,057 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 16:23:27,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:27,067 INFO L225 Difference]: With dead ends: 1899 [2019-12-18 16:23:27,067 INFO L226 Difference]: Without dead ends: 1899 [2019-12-18 16:23:27,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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 16:23:27,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2019-12-18 16:23:27,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1704. [2019-12-18 16:23:27,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2019-12-18 16:23:27,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 3701 transitions. [2019-12-18 16:23:27,103 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 3701 transitions. Word has length 27 [2019-12-18 16:23:27,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:27,104 INFO L462 AbstractCegarLoop]: Abstraction has 1704 states and 3701 transitions. [2019-12-18 16:23:27,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:23:27,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 3701 transitions. [2019-12-18 16:23:27,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 16:23:27,107 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:27,107 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:23:27,107 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:27,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:27,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1889347286, now seen corresponding path program 1 times [2019-12-18 16:23:27,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:27,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405350705] [2019-12-18 16:23:27,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:27,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:27,145 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 16:23:27,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405350705] [2019-12-18 16:23:27,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:27,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:23:27,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952532689] [2019-12-18 16:23:27,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:23:27,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:27,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:23:27,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:23:27,147 INFO L87 Difference]: Start difference. First operand 1704 states and 3701 transitions. Second operand 4 states. [2019-12-18 16:23:27,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:27,165 INFO L93 Difference]: Finished difference Result 921 states and 1892 transitions. [2019-12-18 16:23:27,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:23:27,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-18 16:23:27,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:27,169 INFO L225 Difference]: With dead ends: 921 [2019-12-18 16:23:27,169 INFO L226 Difference]: Without dead ends: 824 [2019-12-18 16:23:27,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:23:27,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2019-12-18 16:23:27,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 782. [2019-12-18 16:23:27,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-12-18 16:23:27,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1664 transitions. [2019-12-18 16:23:27,185 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1664 transitions. Word has length 28 [2019-12-18 16:23:27,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:27,185 INFO L462 AbstractCegarLoop]: Abstraction has 782 states and 1664 transitions. [2019-12-18 16:23:27,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:23:27,185 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1664 transitions. [2019-12-18 16:23:27,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 16:23:27,188 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:27,188 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:23:27,189 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:27,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:27,189 INFO L82 PathProgramCache]: Analyzing trace with hash -317989854, now seen corresponding path program 1 times [2019-12-18 16:23:27,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:27,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294019728] [2019-12-18 16:23:27,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:27,306 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 16:23:27,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294019728] [2019-12-18 16:23:27,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:27,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:23:27,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669747065] [2019-12-18 16:23:27,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:23:27,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:27,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:23:27,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:23:27,312 INFO L87 Difference]: Start difference. First operand 782 states and 1664 transitions. Second operand 7 states. [2019-12-18 16:23:27,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:27,549 INFO L93 Difference]: Finished difference Result 1342 states and 2781 transitions. [2019-12-18 16:23:27,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 16:23:27,549 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-18 16:23:27,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:27,553 INFO L225 Difference]: With dead ends: 1342 [2019-12-18 16:23:27,553 INFO L226 Difference]: Without dead ends: 903 [2019-12-18 16:23:27,553 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 16:23:27,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-12-18 16:23:27,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 773. [2019-12-18 16:23:27,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2019-12-18 16:23:27,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1630 transitions. [2019-12-18 16:23:27,570 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1630 transitions. Word has length 50 [2019-12-18 16:23:27,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:27,570 INFO L462 AbstractCegarLoop]: Abstraction has 773 states and 1630 transitions. [2019-12-18 16:23:27,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:23:27,571 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1630 transitions. [2019-12-18 16:23:27,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 16:23:27,573 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:27,573 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:23:27,573 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:27,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:27,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1216040192, now seen corresponding path program 2 times [2019-12-18 16:23:27,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:27,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044350352] [2019-12-18 16:23:27,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:27,696 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 16:23:27,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044350352] [2019-12-18 16:23:27,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:27,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:23:27,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323312645] [2019-12-18 16:23:27,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:23:27,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:27,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:23:27,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:23:27,698 INFO L87 Difference]: Start difference. First operand 773 states and 1630 transitions. Second operand 7 states. [2019-12-18 16:23:28,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:28,332 INFO L93 Difference]: Finished difference Result 1033 states and 2141 transitions. [2019-12-18 16:23:28,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 16:23:28,333 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-18 16:23:28,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:28,335 INFO L225 Difference]: With dead ends: 1033 [2019-12-18 16:23:28,335 INFO L226 Difference]: Without dead ends: 1027 [2019-12-18 16:23:28,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-18 16:23:28,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2019-12-18 16:23:28,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 827. [2019-12-18 16:23:28,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2019-12-18 16:23:28,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1729 transitions. [2019-12-18 16:23:28,352 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1729 transitions. Word has length 50 [2019-12-18 16:23:28,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:28,352 INFO L462 AbstractCegarLoop]: Abstraction has 827 states and 1729 transitions. [2019-12-18 16:23:28,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:23:28,352 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1729 transitions. [2019-12-18 16:23:28,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 16:23:28,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:28,355 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:23:28,355 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:28,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:28,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1826446246, now seen corresponding path program 3 times [2019-12-18 16:23:28,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:28,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528500927] [2019-12-18 16:23:28,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:28,426 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 16:23:28,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528500927] [2019-12-18 16:23:28,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:28,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:23:28,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070903297] [2019-12-18 16:23:28,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:23:28,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:28,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:23:28,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:23:28,429 INFO L87 Difference]: Start difference. First operand 827 states and 1729 transitions. Second operand 3 states. [2019-12-18 16:23:28,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:28,475 INFO L93 Difference]: Finished difference Result 1100 states and 2305 transitions. [2019-12-18 16:23:28,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:23:28,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-18 16:23:28,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:28,478 INFO L225 Difference]: With dead ends: 1100 [2019-12-18 16:23:28,478 INFO L226 Difference]: Without dead ends: 1100 [2019-12-18 16:23:28,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 16:23:28,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100 states. [2019-12-18 16:23:28,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100 to 884. [2019-12-18 16:23:28,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 884 states. [2019-12-18 16:23:28,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1865 transitions. [2019-12-18 16:23:28,500 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1865 transitions. Word has length 50 [2019-12-18 16:23:28,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:28,502 INFO L462 AbstractCegarLoop]: Abstraction has 884 states and 1865 transitions. [2019-12-18 16:23:28,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:23:28,502 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1865 transitions. [2019-12-18 16:23:28,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 16:23:28,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:28,504 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:23:28,505 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:28,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:28,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1408508718, now seen corresponding path program 1 times [2019-12-18 16:23:28,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:28,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99339913] [2019-12-18 16:23:28,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:28,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:23:28,592 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 16:23:28,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99339913] [2019-12-18 16:23:28,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:23:28,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:23:28,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294518510] [2019-12-18 16:23:28,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:23:28,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:23:28,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:23:28,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:23:28,594 INFO L87 Difference]: Start difference. First operand 884 states and 1865 transitions. Second operand 3 states. [2019-12-18 16:23:28,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:23:28,606 INFO L93 Difference]: Finished difference Result 883 states and 1863 transitions. [2019-12-18 16:23:28,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:23:28,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 16:23:28,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:23:28,609 INFO L225 Difference]: With dead ends: 883 [2019-12-18 16:23:28,609 INFO L226 Difference]: Without dead ends: 883 [2019-12-18 16:23:28,610 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 16:23:28,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2019-12-18 16:23:28,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 789. [2019-12-18 16:23:28,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-12-18 16:23:28,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1685 transitions. [2019-12-18 16:23:28,625 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1685 transitions. Word has length 51 [2019-12-18 16:23:28,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:23:28,626 INFO L462 AbstractCegarLoop]: Abstraction has 789 states and 1685 transitions. [2019-12-18 16:23:28,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:23:28,626 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1685 transitions. [2019-12-18 16:23:28,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 16:23:28,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:23:28,629 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:23:28,629 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:23:28,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:23:28,630 INFO L82 PathProgramCache]: Analyzing trace with hash 355104308, now seen corresponding path program 1 times [2019-12-18 16:23:28,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:23:28,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987813326] [2019-12-18 16:23:28,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:23:28,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:23:28,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:23:28,839 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 16:23:28,839 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 16:23:28,843 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L799: Formula: (let ((.cse0 (store |v_#valid_63| 0 0))) (and (= 0 v_~y$r_buff0_thd2~0_418) (= v_~main$tmp_guard0~0_19 0) (= 0 v_~__unbuffered_cnt~0_61) (= v_~y$r_buff0_thd0~0_150 0) (= v_~y$r_buff1_thd1~0_136 0) (= 0 v_~y$w_buff0~0_517) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t315~0.base_27| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t315~0.base_27|) |v_ULTIMATE.start_main_~#t315~0.offset_19| 0))) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd2~0_265) (= v_~weak$$choice2~0_161 0) (= 0 v_~y$read_delayed_var~0.base_5) (= 0 v_~y$flush_delayed~0_39) (= v_~__unbuffered_p1_EBX~0_45 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t315~0.base_27| 4)) (< 0 |v_#StackHeapBarrier_15|) (= |v_#valid_61| (store .cse0 |v_ULTIMATE.start_main_~#t315~0.base_27| 1)) (= v_~y$r_buff0_thd1~0_219 0) (= 0 v_~y$read_delayed_var~0.offset_5) (= v_~y$w_buff1~0_303 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t315~0.base_27|) 0) (= 0 |v_#NULL.base_6|) (= v_~y$r_buff1_thd0~0_161 0) (= 0 v_~weak$$choice0~0_24) (= 0 v_~__unbuffered_p0_EAX~0_105) (= v_~main$tmp_guard1~0_47 0) (= v_~x~0_99 0) (= 0 |v_ULTIMATE.start_main_~#t315~0.offset_19|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t315~0.base_27|) (= v_~y~0_150 0) (= v_~y$w_buff1_used~0_497 0) (= v_~y$w_buff0_used~0_750 0) (= v_~y$mem_tmp~0_25 0) (= 0 v_~__unbuffered_p1_EAX~0_50))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t315~0.offset=|v_ULTIMATE.start_main_~#t315~0.offset_19|, ULTIMATE.start_main_~#t316~0.base=|v_ULTIMATE.start_main_~#t316~0.base_28|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_750, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_47, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_38|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_87|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_136, ~y$mem_tmp~0=v_~y$mem_tmp~0_25, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_105, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_50, ~y$w_buff0~0=v_~y$w_buff0~0_517, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, #length=|v_#length_17|, ~y~0=v_~y~0_150, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_45, ULTIMATE.start_main_~#t315~0.base=|v_ULTIMATE.start_main_~#t315~0.base_27|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ULTIMATE.start_main_~#t316~0.offset=|v_ULTIMATE.start_main_~#t316~0.offset_20|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_265, ~weak$$choice0~0=v_~weak$$choice0~0_24, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_28|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~y$w_buff1~0=v_~y$w_buff1~0_303, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_30|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_150, #valid=|v_#valid_61|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_418, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_161, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_161, ~x~0=v_~x~0_99, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_497} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t315~0.offset, ULTIMATE.start_main_~#t316~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~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_~#t315~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t316~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~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_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 16:23:28,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L799-1-->L801: Formula: (and (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t316~0.base_10| 1)) (= |v_ULTIMATE.start_main_~#t316~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t316~0.base_10|)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t316~0.base_10| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t316~0.base_10|) |v_ULTIMATE.start_main_~#t316~0.offset_9| 1)) |v_#memory_int_5|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t316~0.base_10| 4)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t316~0.base_10|) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t316~0.base_10|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t316~0.base=|v_ULTIMATE.start_main_~#t316~0.base_10|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t316~0.offset=|v_ULTIMATE.start_main_~#t316~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t316~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t316~0.offset] because there is no mapped edge [2019-12-18 16:23:28,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L4-->L740: Formula: (and (= ~y$r_buff1_thd0~0_Out1175957506 ~y$r_buff0_thd0~0_In1175957506) (= ~y$r_buff0_thd1~0_In1175957506 ~y$r_buff1_thd1~0_Out1175957506) (= ~__unbuffered_p0_EAX~0_Out1175957506 ~x~0_In1175957506) (= ~y$r_buff0_thd1~0_Out1175957506 1) (= ~y$r_buff1_thd2~0_Out1175957506 ~y$r_buff0_thd2~0_In1175957506) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1175957506 0))) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1175957506, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1175957506, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1175957506, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1175957506, ~x~0=~x~0_In1175957506} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out1175957506, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out1175957506, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out1175957506, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1175957506, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1175957506, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1175957506, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1175957506, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1175957506, ~x~0=~x~0_In1175957506} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 16:23:28,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L741-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In530807715 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In530807715 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out530807715|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In530807715 |P0Thread1of1ForFork0_#t~ite5_Out530807715|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In530807715, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In530807715} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out530807715|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In530807715, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In530807715} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 16:23:28,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In88739730 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In88739730 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In88739730 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In88739730 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out88739730|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite6_Out88739730| ~y$w_buff1_used~0_In88739730) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In88739730, ~y$w_buff0_used~0=~y$w_buff0_used~0_In88739730, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In88739730, ~y$w_buff1_used~0=~y$w_buff1_used~0_In88739730} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out88739730|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In88739730, ~y$w_buff0_used~0=~y$w_buff0_used~0_In88739730, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In88739730, ~y$w_buff1_used~0=~y$w_buff1_used~0_In88739730} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 16:23:28,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L743-->L744: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In506116464 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In506116464 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd1~0_Out506116464 0)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_Out506116464 ~y$r_buff0_thd1~0_In506116464)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In506116464, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In506116464} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In506116464, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out506116464|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out506116464} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 16:23:28,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In1332088701 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1332088701 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1332088701 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In1332088701 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1332088701|)) (and (or .cse1 .cse0) (= ~y$r_buff1_thd1~0_In1332088701 |P0Thread1of1ForFork0_#t~ite8_Out1332088701|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1332088701, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1332088701, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1332088701, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1332088701} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1332088701, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1332088701, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1332088701|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1332088701, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1332088701} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 16:23:28,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L744-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 16:23:28,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L766-->L766-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In145371802 256)))) (or (and (= ~y$w_buff1~0_In145371802 |P1Thread1of1ForFork1_#t~ite17_Out145371802|) (= |P1Thread1of1ForFork1_#t~ite18_Out145371802| |P1Thread1of1ForFork1_#t~ite17_Out145371802|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In145371802 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In145371802 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In145371802 256)) (and (= 0 (mod ~y$w_buff1_used~0_In145371802 256)) .cse1)))) (and (= |P1Thread1of1ForFork1_#t~ite17_In145371802| |P1Thread1of1ForFork1_#t~ite17_Out145371802|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite18_Out145371802| ~y$w_buff1~0_In145371802)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In145371802, ~y$w_buff1~0=~y$w_buff1~0_In145371802, ~y$w_buff0_used~0=~y$w_buff0_used~0_In145371802, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In145371802, ~weak$$choice2~0=~weak$$choice2~0_In145371802, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In145371802|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In145371802} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In145371802, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out145371802|, ~y$w_buff1~0=~y$w_buff1~0_In145371802, ~y$w_buff0_used~0=~y$w_buff0_used~0_In145371802, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In145371802, ~weak$$choice2~0=~weak$$choice2~0_In145371802, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out145371802|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In145371802} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-18 16:23:28,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L767-->L767-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In937479601 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In937479601 256)))) (or (= (mod ~y$w_buff0_used~0_In937479601 256) 0) (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In937479601 256))) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In937479601 256))))) (= |P1Thread1of1ForFork1_#t~ite21_Out937479601| |P1Thread1of1ForFork1_#t~ite20_Out937479601|) (= ~y$w_buff0_used~0_In937479601 |P1Thread1of1ForFork1_#t~ite20_Out937479601|) .cse1) (and (not .cse1) (= ~y$w_buff0_used~0_In937479601 |P1Thread1of1ForFork1_#t~ite21_Out937479601|) (= |P1Thread1of1ForFork1_#t~ite20_In937479601| |P1Thread1of1ForFork1_#t~ite20_Out937479601|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In937479601, ~y$w_buff0_used~0=~y$w_buff0_used~0_In937479601, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In937479601|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In937479601, ~weak$$choice2~0=~weak$$choice2~0_In937479601, ~y$w_buff1_used~0=~y$w_buff1_used~0_In937479601} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In937479601, ~y$w_buff0_used~0=~y$w_buff0_used~0_In937479601, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out937479601|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In937479601, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out937479601|, ~weak$$choice2~0=~weak$$choice2~0_In937479601, ~y$w_buff1_used~0=~y$w_buff1_used~0_In937479601} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 16:23:28,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L768-->L768-8: Formula: (let ((.cse3 (= (mod ~weak$$choice2~0_In-174153286 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-174153286 256) 0)) (.cse4 (= (mod ~y$r_buff1_thd2~0_In-174153286 256) 0)) (.cse6 (= 0 (mod ~y$r_buff0_thd2~0_In-174153286 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-174153286 256))) (.cse5 (= |P1Thread1of1ForFork1_#t~ite23_Out-174153286| |P1Thread1of1ForFork1_#t~ite24_Out-174153286|))) (or (let ((.cse1 (not .cse6))) (and (or (not .cse0) .cse1) (not .cse2) (= |P1Thread1of1ForFork1_#t~ite22_Out-174153286| 0) .cse3 (or .cse1 (not .cse4)) (= |P1Thread1of1ForFork1_#t~ite22_Out-174153286| |P1Thread1of1ForFork1_#t~ite23_Out-174153286|) .cse5)) (and (= |P1Thread1of1ForFork1_#t~ite22_In-174153286| |P1Thread1of1ForFork1_#t~ite22_Out-174153286|) (or (and (not .cse3) (= ~y$w_buff1_used~0_In-174153286 |P1Thread1of1ForFork1_#t~ite24_Out-174153286|) (= |P1Thread1of1ForFork1_#t~ite23_Out-174153286| |P1Thread1of1ForFork1_#t~ite23_In-174153286|)) (and .cse3 (or (and .cse0 .cse6) (and .cse4 .cse6) .cse2) (= ~y$w_buff1_used~0_In-174153286 |P1Thread1of1ForFork1_#t~ite23_Out-174153286|) .cse5))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-174153286, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-174153286, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-174153286, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-174153286|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-174153286|, ~weak$$choice2~0=~weak$$choice2~0_In-174153286, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-174153286} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-174153286, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-174153286, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-174153286, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-174153286|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-174153286|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-174153286|, ~weak$$choice2~0=~weak$$choice2~0_In-174153286, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-174153286} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-18 16:23:28,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L768-8-->L770: Formula: (and (= v_~y$w_buff1_used~0_417 |v_P1Thread1of1ForFork1_#t~ite24_25|) (not (= 0 (mod v_~weak$$choice2~0_105 256))) (= v_~y$r_buff0_thd2~0_320 v_~y$r_buff0_thd2~0_319)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_320, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_25|, ~weak$$choice2~0=v_~weak$$choice2~0_105} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_319, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_22|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_24|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_20|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_35|, ~weak$$choice2~0=v_~weak$$choice2~0_105, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_28|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_32|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_417} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 16:23:28,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L770-->L770-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In464660952 256)))) (or (let ((.cse0 (not (= 0 (mod ~y$r_buff0_thd2~0_In464660952 256))))) (and (= |P1Thread1of1ForFork1_#t~ite30_Out464660952| |P1Thread1of1ForFork1_#t~ite29_Out464660952|) (= |P1Thread1of1ForFork1_#t~ite29_Out464660952| |P1Thread1of1ForFork1_#t~ite28_Out464660952|) (or (not (= 0 (mod ~y$w_buff1_used~0_In464660952 256))) .cse0) (not (= (mod ~y$w_buff0_used~0_In464660952 256) 0)) (or (not (= (mod ~y$r_buff1_thd2~0_In464660952 256) 0)) .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite28_Out464660952|) .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite29_In464660952| |P1Thread1of1ForFork1_#t~ite29_Out464660952|) (= |P1Thread1of1ForFork1_#t~ite28_In464660952| |P1Thread1of1ForFork1_#t~ite28_Out464660952|) (= |P1Thread1of1ForFork1_#t~ite30_Out464660952| ~y$r_buff1_thd2~0_In464660952)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In464660952, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In464660952|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In464660952, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In464660952, ~weak$$choice2~0=~weak$$choice2~0_In464660952, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In464660952|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In464660952} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In464660952, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out464660952|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out464660952|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In464660952, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In464660952, ~weak$$choice2~0=~weak$$choice2~0_In464660952, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out464660952|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In464660952} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 16:23:28,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L772-->L776: Formula: (and (= v_~y~0_43 v_~y$mem_tmp~0_8) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_8, ~y$flush_delayed~0=v_~y$flush_delayed~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_8, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-18 16:23:28,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L776-2-->L776-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite33_Out-437703854| |P1Thread1of1ForFork1_#t~ite32_Out-437703854|)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-437703854 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-437703854 256) 0))) (or (and .cse0 (not .cse1) (not .cse2) (= ~y$w_buff1~0_In-437703854 |P1Thread1of1ForFork1_#t~ite32_Out-437703854|)) (and .cse0 (= ~y~0_In-437703854 |P1Thread1of1ForFork1_#t~ite32_Out-437703854|) (or .cse1 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-437703854, ~y$w_buff1~0=~y$w_buff1~0_In-437703854, ~y~0=~y~0_In-437703854, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-437703854} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-437703854, ~y$w_buff1~0=~y$w_buff1~0_In-437703854, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-437703854|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-437703854|, ~y~0=~y~0_In-437703854, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-437703854} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-18 16:23:28,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1874938709 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1874938709 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out1874938709| ~y$w_buff0_used~0_In1874938709) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out1874938709|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1874938709, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1874938709} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1874938709, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1874938709, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1874938709|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 16:23:28,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L778-->L778-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-420399245 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-420399245 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-420399245 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-420399245 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out-420399245| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite35_Out-420399245| ~y$w_buff1_used~0_In-420399245)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-420399245, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-420399245, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-420399245, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-420399245} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-420399245, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-420399245, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-420399245, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-420399245|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-420399245} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 16:23:28,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-106252717 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-106252717 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out-106252717| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out-106252717| ~y$r_buff0_thd2~0_In-106252717) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-106252717, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-106252717} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-106252717, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-106252717, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-106252717|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 16:23:28,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L780-->L780-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-1799326259 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-1799326259 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1799326259 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1799326259 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-1799326259 |P1Thread1of1ForFork1_#t~ite37_Out-1799326259|) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out-1799326259| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1799326259, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1799326259, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1799326259, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1799326259} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1799326259, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1799326259, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1799326259, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1799326259|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1799326259} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 16:23:28,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L780-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_174 |v_P1Thread1of1ForFork1_#t~ite37_34|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_34|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_174, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_33|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 16:23:28,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L801-1-->L807: Formula: (and (= 2 v_~__unbuffered_cnt~0_18) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 16:23:28,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L807-2-->L807-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-325947634 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-325947634 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-325947634| ~y$w_buff1~0_In-325947634) (not .cse1)) (and (or .cse1 .cse0) (= ~y~0_In-325947634 |ULTIMATE.start_main_#t~ite40_Out-325947634|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-325947634, ~y~0=~y~0_In-325947634, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-325947634, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-325947634} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-325947634|, ~y$w_buff1~0=~y$w_buff1~0_In-325947634, ~y~0=~y~0_In-325947634, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-325947634, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-325947634} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 16:23:28,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L807-4-->L808: Formula: (= v_~y~0_34 |v_ULTIMATE.start_main_#t~ite40_14|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~y~0=v_~y~0_34} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-18 16:23:28,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In538516642 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In538516642 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In538516642 |ULTIMATE.start_main_#t~ite42_Out538516642|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out538516642| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In538516642, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In538516642} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In538516642, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In538516642, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out538516642|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 16:23:28,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In2143192557 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In2143192557 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In2143192557 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In2143192557 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In2143192557 |ULTIMATE.start_main_#t~ite43_Out2143192557|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out2143192557|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2143192557, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2143192557, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2143192557, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2143192557} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2143192557, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2143192557, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out2143192557|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2143192557, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2143192557} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 16:23:28,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-102945475 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-102945475 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-102945475|) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In-102945475 |ULTIMATE.start_main_#t~ite44_Out-102945475|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-102945475, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-102945475} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-102945475, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-102945475, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-102945475|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 16:23:28,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L811-->L811-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In941823643 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In941823643 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In941823643 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In941823643 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out941823643| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out941823643| ~y$r_buff1_thd0~0_In941823643)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In941823643, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In941823643, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In941823643, ~y$w_buff1_used~0=~y$w_buff1_used~0_In941823643} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In941823643, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In941823643, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In941823643, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out941823643|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In941823643} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 16:23:28,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L811-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_28 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~main$tmp_guard1~0_28 0) (= 1 v_~__unbuffered_p1_EAX~0_37) (= v_~__unbuffered_p1_EBX~0_29 0) (= 0 v_~__unbuffered_p0_EAX~0_76) (= v_~y$r_buff1_thd0~0_112 |v_ULTIMATE.start_main_#t~ite45_56|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_56|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_112, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_55|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 16:23:28,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 04:23:28 BasicIcfg [2019-12-18 16:23:28,970 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 16:23:28,972 INFO L168 Benchmark]: Toolchain (without parser) took 13149.38 ms. Allocated memory was 143.1 MB in the beginning and 402.1 MB in the end (delta: 259.0 MB). Free memory was 99.4 MB in the beginning and 100.9 MB in the end (delta: -1.5 MB). Peak memory consumption was 257.5 MB. Max. memory is 7.1 GB. [2019-12-18 16:23:28,973 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 143.1 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 16:23:28,976 INFO L168 Benchmark]: CACSL2BoogieTranslator took 755.50 ms. Allocated memory was 143.1 MB in the beginning and 200.8 MB in the end (delta: 57.7 MB). Free memory was 99.2 MB in the beginning and 153.1 MB in the end (delta: -53.9 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2019-12-18 16:23:28,977 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.42 ms. Allocated memory is still 200.8 MB. Free memory was 153.1 MB in the beginning and 150.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 16:23:28,977 INFO L168 Benchmark]: Boogie Preprocessor took 40.22 ms. Allocated memory is still 200.8 MB. Free memory was 150.3 MB in the beginning and 148.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 16:23:28,978 INFO L168 Benchmark]: RCFGBuilder took 758.31 ms. Allocated memory is still 200.8 MB. Free memory was 148.2 MB in the beginning and 103.1 MB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. [2019-12-18 16:23:28,978 INFO L168 Benchmark]: TraceAbstraction took 11528.06 ms. Allocated memory was 200.8 MB in the beginning and 402.1 MB in the end (delta: 201.3 MB). Free memory was 103.1 MB in the beginning and 100.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 203.5 MB. Max. memory is 7.1 GB. [2019-12-18 16:23:28,987 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.51 ms. Allocated memory is still 143.1 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 755.50 ms. Allocated memory was 143.1 MB in the beginning and 200.8 MB in the end (delta: 57.7 MB). Free memory was 99.2 MB in the beginning and 153.1 MB in the end (delta: -53.9 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.42 ms. Allocated memory is still 200.8 MB. Free memory was 153.1 MB in the beginning and 150.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.22 ms. Allocated memory is still 200.8 MB. Free memory was 150.3 MB in the beginning and 148.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 758.31 ms. Allocated memory is still 200.8 MB. Free memory was 148.2 MB in the beginning and 103.1 MB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11528.06 ms. Allocated memory was 200.8 MB in the beginning and 402.1 MB in the end (delta: 201.3 MB). Free memory was 103.1 MB in the beginning and 100.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 203.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.3s, 148 ProgramPointsBefore, 75 ProgramPointsAfterwards, 182 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 30 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 28 ChoiceCompositions, 4966 VarBasedMoverChecksPositive, 278 VarBasedMoverChecksNegative, 167 SemBasedMoverChecksPositive, 218 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 77720 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L799] FCALL, FORK 0 pthread_create(&t315, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L726] 1 y$w_buff1 = y$w_buff0 [L727] 1 y$w_buff0 = 1 [L728] 1 y$w_buff1_used = y$w_buff0_used [L729] 1 y$w_buff0_used = (_Bool)1 [L801] FCALL, FORK 0 pthread_create(&t316, ((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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) 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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 x = 1 [L757] 2 __unbuffered_p1_EAX = x [L760] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L761] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L762] 2 y$flush_delayed = weak$$choice2 [L763] 2 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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L764] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L765] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __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_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L766] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L767] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L770] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] 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=1, __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=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] 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) [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] 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 [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L807] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __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=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L808] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L809] 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 [L810] 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, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.1s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1448 SDtfs, 1258 SDslu, 2633 SDs, 0 SdLazy, 1751 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 18 SyntacticMatches, 8 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8912occurred 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.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 1664 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 349 ConstructedInterpolants, 0 QuantifiedInterpolants, 42430 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...