/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix000_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 19:35:22,502 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 19:35:22,504 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 19:35:22,516 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 19:35:22,516 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 19:35:22,518 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 19:35:22,519 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 19:35:22,521 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 19:35:22,522 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 19:35:22,523 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 19:35:22,524 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 19:35:22,525 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 19:35:22,525 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 19:35:22,526 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 19:35:22,527 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 19:35:22,528 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 19:35:22,529 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 19:35:22,530 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 19:35:22,532 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 19:35:22,533 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 19:35:22,535 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 19:35:22,536 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 19:35:22,537 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 19:35:22,537 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 19:35:22,539 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 19:35:22,540 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 19:35:22,540 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 19:35:22,541 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 19:35:22,541 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 19:35:22,542 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 19:35:22,542 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 19:35:22,543 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 19:35:22,544 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 19:35:22,544 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 19:35:22,545 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 19:35:22,546 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 19:35:22,546 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 19:35:22,546 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 19:35:22,547 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 19:35:22,547 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 19:35:22,548 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 19:35:22,549 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 19:35:22,568 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 19:35:22,568 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 19:35:22,570 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 19:35:22,570 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 19:35:22,570 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 19:35:22,571 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 19:35:22,571 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 19:35:22,571 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 19:35:22,571 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 19:35:22,571 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 19:35:22,572 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 19:35:22,573 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 19:35:22,573 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 19:35:22,573 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 19:35:22,574 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 19:35:22,574 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 19:35:22,574 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 19:35:22,574 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 19:35:22,574 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 19:35:22,574 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 19:35:22,575 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 19:35:22,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 19:35:22,575 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 19:35:22,575 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 19:35:22,576 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 19:35:22,576 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 19:35:22,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 19:35:22,576 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 19:35:22,576 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 19:35:22,577 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 19:35:22,578 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 19:35:22,578 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 19:35:22,858 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 19:35:22,875 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 19:35:22,879 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 19:35:22,880 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 19:35:22,881 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 19:35:22,882 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000_pso.oepc.i [2019-12-27 19:35:22,957 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43673f516/8352a79c328e4e928ab13fe2cd075982/FLAG373e629a3 [2019-12-27 19:35:23,506 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 19:35:23,507 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000_pso.oepc.i [2019-12-27 19:35:23,524 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43673f516/8352a79c328e4e928ab13fe2cd075982/FLAG373e629a3 [2019-12-27 19:35:23,770 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43673f516/8352a79c328e4e928ab13fe2cd075982 [2019-12-27 19:35:23,781 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 19:35:23,783 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 19:35:23,784 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 19:35:23,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 19:35:23,788 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 19:35:23,789 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:35:23" (1/1) ... [2019-12-27 19:35:23,792 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55afe5a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:23, skipping insertion in model container [2019-12-27 19:35:23,792 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:35:23" (1/1) ... [2019-12-27 19:35:23,800 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 19:35:23,853 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 19:35:24,258 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:35:24,365 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 19:35:24,443 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:35:24,538 INFO L208 MainTranslator]: Completed translation [2019-12-27 19:35:24,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:24 WrapperNode [2019-12-27 19:35:24,538 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 19:35:24,539 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 19:35:24,539 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 19:35:24,541 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 19:35:24,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:24" (1/1) ... [2019-12-27 19:35:24,571 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:24" (1/1) ... [2019-12-27 19:35:24,608 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 19:35:24,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 19:35:24,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 19:35:24,609 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 19:35:24,618 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:24" (1/1) ... [2019-12-27 19:35:24,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:24" (1/1) ... [2019-12-27 19:35:24,624 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:24" (1/1) ... [2019-12-27 19:35:24,624 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:24" (1/1) ... [2019-12-27 19:35:24,636 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:24" (1/1) ... [2019-12-27 19:35:24,640 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:24" (1/1) ... [2019-12-27 19:35:24,645 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:24" (1/1) ... [2019-12-27 19:35:24,651 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 19:35:24,652 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 19:35:24,652 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 19:35:24,652 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 19:35:24,653 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 19:35:24,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 19:35:24,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 19:35:24,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 19:35:24,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 19:35:24,740 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 19:35:24,741 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 19:35:24,741 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 19:35:24,742 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 19:35:24,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 19:35:24,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 19:35:24,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 19:35:24,745 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 19:35:25,842 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 19:35:25,843 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 19:35:25,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:35:25 BoogieIcfgContainer [2019-12-27 19:35:25,844 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 19:35:25,845 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 19:35:25,846 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 19:35:25,848 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 19:35:25,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:35:23" (1/3) ... [2019-12-27 19:35:25,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c07ea2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:35:25, skipping insertion in model container [2019-12-27 19:35:25,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:35:24" (2/3) ... [2019-12-27 19:35:25,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c07ea2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:35:25, skipping insertion in model container [2019-12-27 19:35:25,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:35:25" (3/3) ... [2019-12-27 19:35:25,852 INFO L109 eAbstractionObserver]: Analyzing ICFG mix000_pso.oepc.i [2019-12-27 19:35:25,863 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 19:35:25,863 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 19:35:25,870 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 19:35:25,871 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 19:35:25,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,919 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,920 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,920 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,921 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,921 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,971 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,972 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:25,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,004 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,007 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,012 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,013 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,017 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:35:26,034 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 19:35:26,055 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:35:26,055 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:35:26,056 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:35:26,056 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:35:26,056 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:35:26,056 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:35:26,056 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:35:26,056 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:35:26,075 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 246 transitions [2019-12-27 19:35:26,077 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 191 places, 246 transitions [2019-12-27 19:35:26,252 INFO L132 PetriNetUnfolder]: 62/244 cut-off events. [2019-12-27 19:35:26,252 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:35:26,271 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 244 events. 62/244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 630 event pairs. 0/180 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-27 19:35:26,297 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 191 places, 246 transitions [2019-12-27 19:35:26,383 INFO L132 PetriNetUnfolder]: 62/244 cut-off events. [2019-12-27 19:35:26,384 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:35:26,398 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 244 events. 62/244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 630 event pairs. 0/180 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-27 19:35:26,432 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 27428 [2019-12-27 19:35:26,433 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 19:35:29,825 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 19:35:29,955 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 19:35:30,013 INFO L206 etLargeBlockEncoding]: Checked pairs total: 156567 [2019-12-27 19:35:30,013 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-27 19:35:30,018 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 116 places, 141 transitions [2019-12-27 19:35:32,017 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 31650 states. [2019-12-27 19:35:32,019 INFO L276 IsEmpty]: Start isEmpty. Operand 31650 states. [2019-12-27 19:35:32,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 19:35:32,025 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:35:32,026 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 19:35:32,026 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:35:32,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:35:32,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1078912, now seen corresponding path program 1 times [2019-12-27 19:35:32,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:35:32,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868768861] [2019-12-27 19:35:32,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:35:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:35:32,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:35:32,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868768861] [2019-12-27 19:35:32,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:35:32,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:35:32,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [976461404] [2019-12-27 19:35:32,266 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:35:32,271 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:35:32,280 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 19:35:32,280 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:35:32,283 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:35:32,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:35:32,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:35:32,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:35:32,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:35:32,297 INFO L87 Difference]: Start difference. First operand 31650 states. Second operand 3 states. [2019-12-27 19:35:33,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:35:33,852 INFO L93 Difference]: Finished difference Result 31498 states and 111612 transitions. [2019-12-27 19:35:33,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:35:33,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 19:35:33,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:35:34,103 INFO L225 Difference]: With dead ends: 31498 [2019-12-27 19:35:34,104 INFO L226 Difference]: Without dead ends: 29342 [2019-12-27 19:35:34,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:35:34,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29342 states. [2019-12-27 19:35:35,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29342 to 29342. [2019-12-27 19:35:35,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29342 states. [2019-12-27 19:35:36,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29342 states to 29342 states and 103886 transitions. [2019-12-27 19:35:36,025 INFO L78 Accepts]: Start accepts. Automaton has 29342 states and 103886 transitions. Word has length 3 [2019-12-27 19:35:36,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:35:36,026 INFO L462 AbstractCegarLoop]: Abstraction has 29342 states and 103886 transitions. [2019-12-27 19:35:36,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:35:36,026 INFO L276 IsEmpty]: Start isEmpty. Operand 29342 states and 103886 transitions. [2019-12-27 19:35:36,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 19:35:36,030 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:35:36,030 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:35:36,030 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:35:36,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:35:36,031 INFO L82 PathProgramCache]: Analyzing trace with hash 559991540, now seen corresponding path program 1 times [2019-12-27 19:35:36,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:35:36,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663676083] [2019-12-27 19:35:36,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:35:36,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:35:36,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:35:36,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663676083] [2019-12-27 19:35:36,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:35:36,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:35:36,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2094470140] [2019-12-27 19:35:36,322 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:35:36,323 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:35:36,327 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 19:35:36,329 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:35:36,330 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:35:36,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:35:36,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:35:36,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:35:36,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:35:36,332 INFO L87 Difference]: Start difference. First operand 29342 states and 103886 transitions. Second operand 3 states. [2019-12-27 19:35:36,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:35:36,413 INFO L93 Difference]: Finished difference Result 3451 states and 8567 transitions. [2019-12-27 19:35:36,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:35:36,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 19:35:36,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:35:36,424 INFO L225 Difference]: With dead ends: 3451 [2019-12-27 19:35:36,424 INFO L226 Difference]: Without dead ends: 3451 [2019-12-27 19:35:36,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:35:36,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3451 states. [2019-12-27 19:35:36,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3451 to 3451. [2019-12-27 19:35:36,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3451 states. [2019-12-27 19:35:36,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3451 states to 3451 states and 8567 transitions. [2019-12-27 19:35:36,531 INFO L78 Accepts]: Start accepts. Automaton has 3451 states and 8567 transitions. Word has length 11 [2019-12-27 19:35:36,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:35:36,531 INFO L462 AbstractCegarLoop]: Abstraction has 3451 states and 8567 transitions. [2019-12-27 19:35:36,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:35:36,532 INFO L276 IsEmpty]: Start isEmpty. Operand 3451 states and 8567 transitions. [2019-12-27 19:35:36,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 19:35:36,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:35:36,540 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:35:36,541 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:35:36,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:35:36,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1482577634, now seen corresponding path program 1 times [2019-12-27 19:35:36,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:35:36,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254362335] [2019-12-27 19:35:36,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:35:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:35:36,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:35:36,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254362335] [2019-12-27 19:35:36,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:35:36,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:35:36,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1476012315] [2019-12-27 19:35:36,686 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:35:36,688 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:35:36,692 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 19:35:36,692 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:35:36,692 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:35:36,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:35:36,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:35:36,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:35:36,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:35:36,693 INFO L87 Difference]: Start difference. First operand 3451 states and 8567 transitions. Second operand 4 states. [2019-12-27 19:35:37,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:35:37,024 INFO L93 Difference]: Finished difference Result 4533 states and 11006 transitions. [2019-12-27 19:35:37,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:35:37,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 19:35:37,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:35:37,037 INFO L225 Difference]: With dead ends: 4533 [2019-12-27 19:35:37,038 INFO L226 Difference]: Without dead ends: 4533 [2019-12-27 19:35:37,038 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-27 19:35:37,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4533 states. [2019-12-27 19:35:37,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4533 to 4465. [2019-12-27 19:35:37,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4465 states. [2019-12-27 19:35:37,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4465 states to 4465 states and 10874 transitions. [2019-12-27 19:35:37,141 INFO L78 Accepts]: Start accepts. Automaton has 4465 states and 10874 transitions. Word has length 14 [2019-12-27 19:35:37,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:35:37,142 INFO L462 AbstractCegarLoop]: Abstraction has 4465 states and 10874 transitions. [2019-12-27 19:35:37,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:35:37,142 INFO L276 IsEmpty]: Start isEmpty. Operand 4465 states and 10874 transitions. [2019-12-27 19:35:37,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 19:35:37,145 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:35:37,145 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:35:37,146 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:35:37,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:35:37,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1284762389, now seen corresponding path program 1 times [2019-12-27 19:35:37,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:35:37,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783073418] [2019-12-27 19:35:37,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:35:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:35:37,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:35:37,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783073418] [2019-12-27 19:35:37,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:35:37,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:35:37,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [850357946] [2019-12-27 19:35:37,226 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:35:37,231 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:35:37,234 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 19:35:37,234 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:35:37,234 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:35:37,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:35:37,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:35:37,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:35:37,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:35:37,235 INFO L87 Difference]: Start difference. First operand 4465 states and 10874 transitions. Second operand 3 states. [2019-12-27 19:35:37,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:35:37,339 INFO L93 Difference]: Finished difference Result 7903 states and 18336 transitions. [2019-12-27 19:35:37,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:35:37,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 19:35:37,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:35:37,362 INFO L225 Difference]: With dead ends: 7903 [2019-12-27 19:35:37,362 INFO L226 Difference]: Without dead ends: 7903 [2019-12-27 19:35:37,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:35:37,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7903 states. [2019-12-27 19:35:37,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7903 to 6842. [2019-12-27 19:35:37,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6842 states. [2019-12-27 19:35:37,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6842 states to 6842 states and 16113 transitions. [2019-12-27 19:35:37,512 INFO L78 Accepts]: Start accepts. Automaton has 6842 states and 16113 transitions. Word has length 15 [2019-12-27 19:35:37,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:35:37,513 INFO L462 AbstractCegarLoop]: Abstraction has 6842 states and 16113 transitions. [2019-12-27 19:35:37,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:35:37,513 INFO L276 IsEmpty]: Start isEmpty. Operand 6842 states and 16113 transitions. [2019-12-27 19:35:37,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 19:35:37,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:35:37,515 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:35:37,515 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:35:37,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:35:37,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1823214846, now seen corresponding path program 1 times [2019-12-27 19:35:37,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:35:37,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001726244] [2019-12-27 19:35:37,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:35:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:35:37,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:35:37,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001726244] [2019-12-27 19:35:37,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:35:37,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:35:37,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [464572956] [2019-12-27 19:35:37,566 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:35:37,570 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:35:37,573 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 17 transitions. [2019-12-27 19:35:37,574 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:35:37,574 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:35:37,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:35:37,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:35:37,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:35:37,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:35:37,576 INFO L87 Difference]: Start difference. First operand 6842 states and 16113 transitions. Second operand 4 states. [2019-12-27 19:35:37,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:35:37,922 INFO L93 Difference]: Finished difference Result 8322 states and 19313 transitions. [2019-12-27 19:35:37,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:35:37,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 19:35:37,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:35:37,938 INFO L225 Difference]: With dead ends: 8322 [2019-12-27 19:35:37,938 INFO L226 Difference]: Without dead ends: 8322 [2019-12-27 19:35:37,939 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-27 19:35:37,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8322 states. [2019-12-27 19:35:38,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8322 to 6895. [2019-12-27 19:35:38,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6895 states. [2019-12-27 19:35:38,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6895 states to 6895 states and 16226 transitions. [2019-12-27 19:35:38,244 INFO L78 Accepts]: Start accepts. Automaton has 6895 states and 16226 transitions. Word has length 17 [2019-12-27 19:35:38,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:35:38,244 INFO L462 AbstractCegarLoop]: Abstraction has 6895 states and 16226 transitions. [2019-12-27 19:35:38,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:35:38,244 INFO L276 IsEmpty]: Start isEmpty. Operand 6895 states and 16226 transitions. [2019-12-27 19:35:38,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 19:35:38,250 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:35:38,250 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-27 19:35:38,250 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:35:38,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:35:38,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1246091973, now seen corresponding path program 1 times [2019-12-27 19:35:38,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:35:38,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193694926] [2019-12-27 19:35:38,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:35:38,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:35:38,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:35:38,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193694926] [2019-12-27 19:35:38,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:35:38,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:35:38,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1290397479] [2019-12-27 19:35:38,326 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:35:38,334 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:35:38,339 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 19:35:38,339 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:35:38,339 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:35:38,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:35:38,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:35:38,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:35:38,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:35:38,340 INFO L87 Difference]: Start difference. First operand 6895 states and 16226 transitions. Second operand 5 states. [2019-12-27 19:35:38,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:35:38,856 INFO L93 Difference]: Finished difference Result 9279 states and 21293 transitions. [2019-12-27 19:35:38,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 19:35:38,856 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 19:35:38,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:35:38,902 INFO L225 Difference]: With dead ends: 9279 [2019-12-27 19:35:38,902 INFO L226 Difference]: Without dead ends: 9279 [2019-12-27 19:35:38,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:35:38,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9279 states. [2019-12-27 19:35:39,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9279 to 8842. [2019-12-27 19:35:39,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8842 states. [2019-12-27 19:35:39,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8842 states to 8842 states and 20427 transitions. [2019-12-27 19:35:39,074 INFO L78 Accepts]: Start accepts. Automaton has 8842 states and 20427 transitions. Word has length 27 [2019-12-27 19:35:39,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:35:39,074 INFO L462 AbstractCegarLoop]: Abstraction has 8842 states and 20427 transitions. [2019-12-27 19:35:39,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:35:39,074 INFO L276 IsEmpty]: Start isEmpty. Operand 8842 states and 20427 transitions. [2019-12-27 19:35:39,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 19:35:39,085 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:35:39,085 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] [2019-12-27 19:35:39,085 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:35:39,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:35:39,086 INFO L82 PathProgramCache]: Analyzing trace with hash -326843675, now seen corresponding path program 1 times [2019-12-27 19:35:39,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:35:39,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595357460] [2019-12-27 19:35:39,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:35:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:35:39,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-27 19:35:39,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595357460] [2019-12-27 19:35:39,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:35:39,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:35:39,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [841145620] [2019-12-27 19:35:39,146 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:35:39,152 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:35:39,158 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 30 transitions. [2019-12-27 19:35:39,158 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:35:39,159 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:35:39,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:35:39,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:35:39,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:35:39,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:35:39,160 INFO L87 Difference]: Start difference. First operand 8842 states and 20427 transitions. Second operand 3 states. [2019-12-27 19:35:39,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:35:39,253 INFO L93 Difference]: Finished difference Result 9983 states and 21907 transitions. [2019-12-27 19:35:39,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:35:39,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-27 19:35:39,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:35:39,271 INFO L225 Difference]: With dead ends: 9983 [2019-12-27 19:35:39,271 INFO L226 Difference]: Without dead ends: 9983 [2019-12-27 19:35:39,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:35:39,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9983 states. [2019-12-27 19:35:39,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9983 to 8811. [2019-12-27 19:35:39,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8811 states. [2019-12-27 19:35:39,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8811 states to 8811 states and 19466 transitions. [2019-12-27 19:35:39,432 INFO L78 Accepts]: Start accepts. Automaton has 8811 states and 19466 transitions. Word has length 30 [2019-12-27 19:35:39,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:35:39,432 INFO L462 AbstractCegarLoop]: Abstraction has 8811 states and 19466 transitions. [2019-12-27 19:35:39,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:35:39,433 INFO L276 IsEmpty]: Start isEmpty. Operand 8811 states and 19466 transitions. [2019-12-27 19:35:39,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 19:35:39,442 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:35:39,442 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] [2019-12-27 19:35:39,442 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:35:39,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:35:39,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1451833890, now seen corresponding path program 1 times [2019-12-27 19:35:39,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:35:39,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107372959] [2019-12-27 19:35:39,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:35:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:35:39,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:35:39,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107372959] [2019-12-27 19:35:39,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:35:39,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:35:39,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1531775216] [2019-12-27 19:35:39,541 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:35:39,547 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:35:40,025 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 33 transitions. [2019-12-27 19:35:40,026 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:35:40,026 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:35:40,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:35:40,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:35:40,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:35:40,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:35:40,027 INFO L87 Difference]: Start difference. First operand 8811 states and 19466 transitions. Second operand 5 states. [2019-12-27 19:35:40,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:35:40,499 INFO L93 Difference]: Finished difference Result 9934 states and 21689 transitions. [2019-12-27 19:35:40,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 19:35:40,499 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-27 19:35:40,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:35:40,514 INFO L225 Difference]: With dead ends: 9934 [2019-12-27 19:35:40,515 INFO L226 Difference]: Without dead ends: 9934 [2019-12-27 19:35:40,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:35:40,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9934 states. [2019-12-27 19:35:40,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9934 to 7897. [2019-12-27 19:35:40,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7897 states. [2019-12-27 19:35:40,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7897 states to 7897 states and 17615 transitions. [2019-12-27 19:35:40,677 INFO L78 Accepts]: Start accepts. Automaton has 7897 states and 17615 transitions. Word has length 33 [2019-12-27 19:35:40,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:35:40,678 INFO L462 AbstractCegarLoop]: Abstraction has 7897 states and 17615 transitions. [2019-12-27 19:35:40,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:35:40,678 INFO L276 IsEmpty]: Start isEmpty. Operand 7897 states and 17615 transitions. [2019-12-27 19:35:40,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 19:35:40,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:35:40,693 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] [2019-12-27 19:35:40,693 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:35:40,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:35:40,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1521082095, now seen corresponding path program 1 times [2019-12-27 19:35:40,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:35:40,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215567210] [2019-12-27 19:35:40,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:35:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:35:40,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:35:40,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215567210] [2019-12-27 19:35:40,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:35:40,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:35:40,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1641513240] [2019-12-27 19:35:40,754 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:35:40,765 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:35:40,781 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 39 transitions. [2019-12-27 19:35:40,781 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:35:40,782 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:35:40,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:35:40,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:35:40,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:35:40,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:35:40,783 INFO L87 Difference]: Start difference. First operand 7897 states and 17615 transitions. Second operand 4 states. [2019-12-27 19:35:40,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:35:40,812 INFO L93 Difference]: Finished difference Result 5532 states and 12270 transitions. [2019-12-27 19:35:40,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 19:35:40,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-27 19:35:40,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:35:40,821 INFO L225 Difference]: With dead ends: 5532 [2019-12-27 19:35:40,822 INFO L226 Difference]: Without dead ends: 5532 [2019-12-27 19:35:40,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:35:40,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5532 states. [2019-12-27 19:35:40,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5532 to 5428. [2019-12-27 19:35:40,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5428 states. [2019-12-27 19:35:40,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5428 states to 5428 states and 12077 transitions. [2019-12-27 19:35:40,919 INFO L78 Accepts]: Start accepts. Automaton has 5428 states and 12077 transitions. Word has length 39 [2019-12-27 19:35:40,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:35:40,919 INFO L462 AbstractCegarLoop]: Abstraction has 5428 states and 12077 transitions. [2019-12-27 19:35:40,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:35:40,920 INFO L276 IsEmpty]: Start isEmpty. Operand 5428 states and 12077 transitions. [2019-12-27 19:35:40,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 19:35:40,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:35:40,935 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:35:40,935 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:35:40,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:35:40,936 INFO L82 PathProgramCache]: Analyzing trace with hash -180233684, now seen corresponding path program 1 times [2019-12-27 19:35:40,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:35:40,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427426523] [2019-12-27 19:35:40,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:35:40,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:35:41,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:35:41,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427426523] [2019-12-27 19:35:41,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:35:41,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:35:41,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [37285112] [2019-12-27 19:35:41,104 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:35:41,132 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:35:41,264 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 167 states and 264 transitions. [2019-12-27 19:35:41,264 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:35:41,400 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 19:35:41,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 19:35:41,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:35:41,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 19:35:41,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-27 19:35:41,401 INFO L87 Difference]: Start difference. First operand 5428 states and 12077 transitions. Second operand 11 states. [2019-12-27 19:35:42,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:35:42,157 INFO L93 Difference]: Finished difference Result 10275 states and 22585 transitions. [2019-12-27 19:35:42,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 19:35:42,157 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2019-12-27 19:35:42,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:35:42,170 INFO L225 Difference]: With dead ends: 10275 [2019-12-27 19:35:42,171 INFO L226 Difference]: Without dead ends: 9146 [2019-12-27 19:35:42,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2019-12-27 19:35:42,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9146 states. [2019-12-27 19:35:42,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9146 to 6812. [2019-12-27 19:35:42,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6812 states. [2019-12-27 19:35:42,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6812 states to 6812 states and 15382 transitions. [2019-12-27 19:35:42,334 INFO L78 Accepts]: Start accepts. Automaton has 6812 states and 15382 transitions. Word has length 68 [2019-12-27 19:35:42,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:35:42,335 INFO L462 AbstractCegarLoop]: Abstraction has 6812 states and 15382 transitions. [2019-12-27 19:35:42,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 19:35:42,335 INFO L276 IsEmpty]: Start isEmpty. Operand 6812 states and 15382 transitions. [2019-12-27 19:35:42,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 19:35:42,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:35:42,357 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:35:42,357 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:35:42,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:35:42,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1054499084, now seen corresponding path program 2 times [2019-12-27 19:35:42,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:35:42,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739241074] [2019-12-27 19:35:42,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:35:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:35:42,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:35:42,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739241074] [2019-12-27 19:35:42,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:35:42,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:35:42,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [103841831] [2019-12-27 19:35:42,511 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:35:42,537 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:35:42,700 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 191 states and 299 transitions. [2019-12-27 19:35:42,700 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:35:42,723 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 19:35:42,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 19:35:42,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:35:42,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 19:35:42,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:35:42,724 INFO L87 Difference]: Start difference. First operand 6812 states and 15382 transitions. Second operand 6 states. [2019-12-27 19:35:42,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:35:42,874 INFO L93 Difference]: Finished difference Result 9900 states and 22320 transitions. [2019-12-27 19:35:42,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:35:42,875 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-27 19:35:42,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:35:42,887 INFO L225 Difference]: With dead ends: 9900 [2019-12-27 19:35:42,888 INFO L226 Difference]: Without dead ends: 8364 [2019-12-27 19:35:42,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:35:42,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8364 states. [2019-12-27 19:35:43,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8364 to 8264. [2019-12-27 19:35:43,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8264 states. [2019-12-27 19:35:43,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8264 states to 8264 states and 18802 transitions. [2019-12-27 19:35:43,104 INFO L78 Accepts]: Start accepts. Automaton has 8264 states and 18802 transitions. Word has length 68 [2019-12-27 19:35:43,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:35:43,105 INFO L462 AbstractCegarLoop]: Abstraction has 8264 states and 18802 transitions. [2019-12-27 19:35:43,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 19:35:43,105 INFO L276 IsEmpty]: Start isEmpty. Operand 8264 states and 18802 transitions. [2019-12-27 19:35:43,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 19:35:43,124 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:35:43,124 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:35:43,124 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:35:43,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:35:43,125 INFO L82 PathProgramCache]: Analyzing trace with hash 283351324, now seen corresponding path program 3 times [2019-12-27 19:35:43,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:35:43,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745940173] [2019-12-27 19:35:43,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:35:43,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:35:43,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:35:43,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745940173] [2019-12-27 19:35:43,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:35:43,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:35:43,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1026991737] [2019-12-27 19:35:43,277 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:35:43,304 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:35:43,392 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 134 states and 198 transitions. [2019-12-27 19:35:43,392 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:35:43,416 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 19:35:43,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:35:43,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:35:43,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:35:43,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:35:43,418 INFO L87 Difference]: Start difference. First operand 8264 states and 18802 transitions. Second operand 9 states. [2019-12-27 19:35:43,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:35:43,931 INFO L93 Difference]: Finished difference Result 12633 states and 28391 transitions. [2019-12-27 19:35:43,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 19:35:43,932 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-12-27 19:35:43,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:35:43,944 INFO L225 Difference]: With dead ends: 12633 [2019-12-27 19:35:43,944 INFO L226 Difference]: Without dead ends: 12150 [2019-12-27 19:35:43,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-27 19:35:43,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12150 states. [2019-12-27 19:35:44,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12150 to 8320. [2019-12-27 19:35:44,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8320 states. [2019-12-27 19:35:44,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8320 states to 8320 states and 18925 transitions. [2019-12-27 19:35:44,073 INFO L78 Accepts]: Start accepts. Automaton has 8320 states and 18925 transitions. Word has length 68 [2019-12-27 19:35:44,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:35:44,074 INFO L462 AbstractCegarLoop]: Abstraction has 8320 states and 18925 transitions. [2019-12-27 19:35:44,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:35:44,074 INFO L276 IsEmpty]: Start isEmpty. Operand 8320 states and 18925 transitions. [2019-12-27 19:35:44,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 19:35:44,100 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:35:44,100 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:35:44,100 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:35:44,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:35:44,101 INFO L82 PathProgramCache]: Analyzing trace with hash 741146474, now seen corresponding path program 4 times [2019-12-27 19:35:44,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:35:44,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636497732] [2019-12-27 19:35:44,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:35:44,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:35:44,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:35:44,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636497732] [2019-12-27 19:35:44,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:35:44,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 19:35:44,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [417646733] [2019-12-27 19:35:44,189 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:35:44,225 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:35:44,455 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 167 states and 264 transitions. [2019-12-27 19:35:44,455 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:35:44,456 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:35:44,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 19:35:44,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:35:44,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 19:35:44,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:35:44,457 INFO L87 Difference]: Start difference. First operand 8320 states and 18925 transitions. Second operand 6 states. [2019-12-27 19:35:44,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:35:44,681 INFO L93 Difference]: Finished difference Result 14353 states and 32381 transitions. [2019-12-27 19:35:44,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 19:35:44,682 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-27 19:35:44,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:35:44,696 INFO L225 Difference]: With dead ends: 14353 [2019-12-27 19:35:44,697 INFO L226 Difference]: Without dead ends: 12179 [2019-12-27 19:35:44,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-27 19:35:44,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12179 states. [2019-12-27 19:35:44,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12179 to 9546. [2019-12-27 19:35:44,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9546 states. [2019-12-27 19:35:44,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9546 states to 9546 states and 21681 transitions. [2019-12-27 19:35:44,853 INFO L78 Accepts]: Start accepts. Automaton has 9546 states and 21681 transitions. Word has length 68 [2019-12-27 19:35:44,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:35:44,853 INFO L462 AbstractCegarLoop]: Abstraction has 9546 states and 21681 transitions. [2019-12-27 19:35:44,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 19:35:44,853 INFO L276 IsEmpty]: Start isEmpty. Operand 9546 states and 21681 transitions. [2019-12-27 19:35:44,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 19:35:44,871 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:35:44,871 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:35:44,871 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:35:44,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:35:44,872 INFO L82 PathProgramCache]: Analyzing trace with hash -439547742, now seen corresponding path program 5 times [2019-12-27 19:35:44,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:35:44,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762972296] [2019-12-27 19:35:44,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:35:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:35:44,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:35:44,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762972296] [2019-12-27 19:35:44,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:35:44,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:35:44,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [441411659] [2019-12-27 19:35:44,945 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:35:44,967 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:35:45,067 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 118 states and 166 transitions. [2019-12-27 19:35:45,068 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:35:45,069 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:35:45,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:35:45,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:35:45,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:35:45,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:35:45,070 INFO L87 Difference]: Start difference. First operand 9546 states and 21681 transitions. Second operand 4 states. [2019-12-27 19:35:45,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:35:45,129 INFO L93 Difference]: Finished difference Result 10263 states and 23212 transitions. [2019-12-27 19:35:45,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 19:35:45,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-12-27 19:35:45,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:35:45,132 INFO L225 Difference]: With dead ends: 10263 [2019-12-27 19:35:45,132 INFO L226 Difference]: Without dead ends: 909 [2019-12-27 19:35:45,133 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-27 19:35:45,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-12-27 19:35:45,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 909. [2019-12-27 19:35:45,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-12-27 19:35:45,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1891 transitions. [2019-12-27 19:35:45,150 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1891 transitions. Word has length 68 [2019-12-27 19:35:45,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:35:45,151 INFO L462 AbstractCegarLoop]: Abstraction has 909 states and 1891 transitions. [2019-12-27 19:35:45,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:35:45,151 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1891 transitions. [2019-12-27 19:35:45,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-27 19:35:45,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:35:45,160 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:35:45,160 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:35:45,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:35:45,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1610368982, now seen corresponding path program 1 times [2019-12-27 19:35:45,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:35:45,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759513278] [2019-12-27 19:35:45,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:35:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:35:45,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:35:45,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759513278] [2019-12-27 19:35:45,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:35:45,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:35:45,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [495792987] [2019-12-27 19:35:45,292 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:35:45,317 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:35:45,490 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 194 states and 304 transitions. [2019-12-27 19:35:45,490 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:35:45,497 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 19:35:45,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:35:45,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:35:45,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:35:45,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:35:45,498 INFO L87 Difference]: Start difference. First operand 909 states and 1891 transitions. Second operand 4 states. [2019-12-27 19:35:45,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:35:45,586 INFO L93 Difference]: Finished difference Result 1030 states and 2133 transitions. [2019-12-27 19:35:45,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 19:35:45,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-27 19:35:45,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:35:45,588 INFO L225 Difference]: With dead ends: 1030 [2019-12-27 19:35:45,588 INFO L226 Difference]: Without dead ends: 1030 [2019-12-27 19:35:45,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:35:45,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2019-12-27 19:35:45,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 942. [2019-12-27 19:35:45,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 942 states. [2019-12-27 19:35:45,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1957 transitions. [2019-12-27 19:35:45,599 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1957 transitions. Word has length 69 [2019-12-27 19:35:45,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:35:45,599 INFO L462 AbstractCegarLoop]: Abstraction has 942 states and 1957 transitions. [2019-12-27 19:35:45,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:35:45,599 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1957 transitions. [2019-12-27 19:35:45,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 19:35:45,601 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:35:45,601 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:35:45,602 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:35:45,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:35:45,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1855866882, now seen corresponding path program 1 times [2019-12-27 19:35:45,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:35:45,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619510144] [2019-12-27 19:35:45,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:35:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:35:45,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:35:45,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619510144] [2019-12-27 19:35:45,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:35:45,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:35:45,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [814245093] [2019-12-27 19:35:45,675 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:35:45,700 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:35:45,882 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 194 states and 302 transitions. [2019-12-27 19:35:45,882 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:35:45,883 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:35:45,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:35:45,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:35:45,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:35:45,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:35:45,884 INFO L87 Difference]: Start difference. First operand 942 states and 1957 transitions. Second operand 3 states. [2019-12-27 19:35:45,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:35:45,895 INFO L93 Difference]: Finished difference Result 942 states and 1956 transitions. [2019-12-27 19:35:45,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:35:45,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-12-27 19:35:45,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:35:45,897 INFO L225 Difference]: With dead ends: 942 [2019-12-27 19:35:45,897 INFO L226 Difference]: Without dead ends: 942 [2019-12-27 19:35:45,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:35:45,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2019-12-27 19:35:45,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 942. [2019-12-27 19:35:45,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 942 states. [2019-12-27 19:35:45,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1956 transitions. [2019-12-27 19:35:45,909 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1956 transitions. Word has length 70 [2019-12-27 19:35:45,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:35:45,909 INFO L462 AbstractCegarLoop]: Abstraction has 942 states and 1956 transitions. [2019-12-27 19:35:45,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:35:45,910 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1956 transitions. [2019-12-27 19:35:45,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-27 19:35:45,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:35:45,912 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:35:45,912 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:35:45,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:35:45,912 INFO L82 PathProgramCache]: Analyzing trace with hash 309404191, now seen corresponding path program 1 times [2019-12-27 19:35:45,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:35:45,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978256605] [2019-12-27 19:35:45,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:35:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:35:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:35:46,024 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 19:35:46,024 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 19:35:46,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_48| 0 0))) (and (= v_~y$w_buff1_used~0_73 0) (= 0 v_~__unbuffered_p0_EAX~0_13) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 v_~y$r_buff1_thd0~0_23) (= v_~main$tmp_guard0~0_9 0) (= 0 v_~__unbuffered_p1_EAX~0_12) (= |v_#NULL.offset_6| 0) (= v_~y$r_buff0_thd1~0_79 0) (= v_~y$read_delayed~0_4 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2~0.base_23| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2~0.base_23|) |v_ULTIMATE.start_main_~#t2~0.offset_18| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_cnt~0_17) (= |v_#valid_46| (store .cse0 |v_ULTIMATE.start_main_~#t2~0.base_23| 1)) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~weak$$choice2~0_36) (= v_~y$r_buff0_thd2~0_63 0) (= v_~y$r_buff0_thd0~0_19 0) (= v_~y$w_buff0_used~0_136 0) (= 0 v_~y$flush_delayed~0_18) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice0~0_11) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t2~0.base_23|) (= |v_ULTIMATE.start_main_~#t2~0.offset_18| 0) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$r_buff1_thd1~0_40) (= v_~y~0_32 0) (= v_~y$mem_tmp~0_14 0) (= v_~main$tmp_guard1~0_14 0) (= v_~__unbuffered_p0_EBX~0_12 0) (= 0 v_~y$w_buff1~0_32) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2~0.base_23| 4)) (= v_~__unbuffered_p1_EBX~0_13 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2~0.base_23|)) (= 0 v_~y$r_buff1_thd2~0_38) (= 0 v_~y$w_buff0~0_34) (= 0 v_~x~0_8))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_19|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_11|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_11|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_13|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_11|, ~y$read_delayed~0=v_~y$read_delayed~0_4, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_40, ~y$mem_tmp~0=v_~y$mem_tmp~0_14, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, ~y$w_buff0~0=v_~y$w_buff0~0_34, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_79, ~y$flush_delayed~0=v_~y$flush_delayed~0_18, #length=|v_#length_17|, ULTIMATE.start_main_~#t3~0.offset=|v_ULTIMATE.start_main_~#t3~0.offset_16|, ~y~0=v_~y~0_32, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_23|, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_9|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_12, ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_18|, ULTIMATE.start_main_~#t3~0.base=|v_ULTIMATE.start_main_~#t3~0.base_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_9|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_38, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_13|, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_19, #valid=|v_#valid_46|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_63, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, ~weak$$choice2~0=v_~weak$$choice2~0_36, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_23, ~x~0=v_~x~0_8, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_73} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ULTIMATE.start_main_#t~ite68, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65, ~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, ULTIMATE.start_main_~#t3~0.offset, ~y~0, ULTIMATE.start_main_~#t2~0.base, ULTIMATE.start_main_#t~nondet62, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t2~0.offset, ULTIMATE.start_main_~#t3~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet61, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ~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, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 19:35:46,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1043] [1043] L5-->L744: Formula: (and (= ~y$r_buff0_thd1~0_In-1407693266 ~y$r_buff1_thd1~0_Out-1407693266) (= ~y$r_buff1_thd2~0_Out-1407693266 ~y$r_buff0_thd2~0_In-1407693266) (= |P0Thread1of1ForFork1_#t~nondet4_In-1407693266| ~weak$$choice2~0_Out-1407693266) (= |P0Thread1of1ForFork1_#t~nondet3_In-1407693266| ~weak$$choice0~0_Out-1407693266) (= 1 ~y$r_buff0_thd1~0_Out-1407693266) (= ~y$mem_tmp~0_Out-1407693266 ~y~0_In-1407693266) (= ~y$r_buff1_thd0~0_Out-1407693266 ~y$r_buff0_thd0~0_In-1407693266) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1407693266)) (= ~weak$$choice2~0_Out-1407693266 ~y$flush_delayed~0_Out-1407693266)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1407693266, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1407693266, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1407693266, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1407693266, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_In-1407693266|, ~y~0=~y~0_In-1407693266, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_In-1407693266|} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1407693266, ~weak$$choice0~0=~weak$$choice0~0_Out-1407693266, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1407693266, ~y$mem_tmp~0=~y$mem_tmp~0_Out-1407693266, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1407693266, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1407693266, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1407693266, ~y$flush_delayed~0=~y$flush_delayed~0_Out-1407693266, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1407693266, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_Out-1407693266|, ~y~0=~y~0_In-1407693266, ~weak$$choice2~0=~weak$$choice2~0_Out-1407693266, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_Out-1407693266|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1407693266} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 19:35:46,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] L818-1-->L820: Formula: (and (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t3~0.base_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t3~0.base_11| 1)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t3~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t3~0.base_11| 0)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t3~0.base_11| 4)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t3~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t3~0.base_11|) |v_ULTIMATE.start_main_~#t3~0.offset_10| 1))) (= |v_ULTIMATE.start_main_~#t3~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t3~0.base=|v_ULTIMATE.start_main_~#t3~0.base_11|, ULTIMATE.start_main_~#t3~0.offset=|v_ULTIMATE.start_main_~#t3~0.offset_10|, #length=|v_#length_9|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t3~0.base, ULTIMATE.start_main_~#t3~0.offset, #length, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-27 19:35:46,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L744-2-->L744-5: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In908809734 256) 0)) (.cse0 (= |P0Thread1of1ForFork1_#t~ite6_Out908809734| |P0Thread1of1ForFork1_#t~ite5_Out908809734|)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In908809734 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite5_Out908809734| ~y$w_buff1~0_In908809734) .cse0 (or .cse1 .cse2)) (and (not .cse2) .cse0 (= |P0Thread1of1ForFork1_#t~ite5_Out908809734| ~y$w_buff0~0_In908809734) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In908809734, ~y$w_buff1~0=~y$w_buff1~0_In908809734, ~y$w_buff0~0=~y$w_buff0~0_In908809734, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In908809734} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out908809734|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In908809734, ~y$w_buff1~0=~y$w_buff1~0_In908809734, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out908809734|, ~y$w_buff0~0=~y$w_buff0~0_In908809734, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In908809734} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5, P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 19:35:46,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L749-->L750: Formula: (and (not (= (mod v_~weak$$choice2~0_28 256) 0)) (= v_~y$r_buff0_thd1~0_49 v_~y$r_buff0_thd1~0_48)) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_9|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_9|, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_8|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_48, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, P0Thread1of1ForFork1_#t~ite19, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 19:35:46,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L752-->L752-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1217959002 256)))) (or (and (= ~y$mem_tmp~0_In-1217959002 |P0Thread1of1ForFork1_#t~ite25_Out-1217959002|) (not .cse0)) (and .cse0 (= |P0Thread1of1ForFork1_#t~ite25_Out-1217959002| ~y~0_In-1217959002)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1217959002, ~y$flush_delayed~0=~y$flush_delayed~0_In-1217959002, ~y~0=~y~0_In-1217959002} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1217959002, P0Thread1of1ForFork1_#t~ite25=|P0Thread1of1ForFork1_#t~ite25_Out-1217959002|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1217959002, ~y~0=~y~0_In-1217959002} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-27 19:35:46,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In443106532 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite54_Out443106532| ~y$mem_tmp~0_In443106532) (not .cse0)) (and .cse0 (= ~y~0_In443106532 |P1Thread1of1ForFork0_#t~ite54_Out443106532|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In443106532, ~y$flush_delayed~0=~y$flush_delayed~0_In443106532, ~y~0=~y~0_In443106532} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In443106532, P1Thread1of1ForFork0_#t~ite54=|P1Thread1of1ForFork0_#t~ite54_Out443106532|, ~y$flush_delayed~0=~y$flush_delayed~0_In443106532, ~y~0=~y~0_In443106532} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-27 19:35:46,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L760-->L760-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-542043040 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-542043040 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite28_Out-542043040| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork1_#t~ite28_Out-542043040| ~y$w_buff0_used~0_In-542043040) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-542043040, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-542043040} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-542043040, P0Thread1of1ForFork1_#t~ite28=|P0Thread1of1ForFork1_#t~ite28_Out-542043040|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-542043040} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 19:35:46,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L761-->L761-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-1289669782 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-1289669782 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-1289669782 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1289669782 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite29_Out-1289669782| ~y$w_buff1_used~0_In-1289669782)) (and (= 0 |P0Thread1of1ForFork1_#t~ite29_Out-1289669782|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1289669782, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1289669782, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1289669782, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1289669782} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1289669782, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1289669782, P0Thread1of1ForFork1_#t~ite29=|P0Thread1of1ForFork1_#t~ite29_Out-1289669782|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1289669782, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1289669782} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-27 19:35:46,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] L762-->L763: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1617872395 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In1617872395 256) 0))) (or (and (not .cse0) (= ~y$r_buff0_thd1~0_Out1617872395 0) (not .cse1)) (and (= ~y$r_buff0_thd1~0_Out1617872395 ~y$r_buff0_thd1~0_In1617872395) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1617872395, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1617872395} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1617872395, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1617872395, P0Thread1of1ForFork1_#t~ite30=|P0Thread1of1ForFork1_#t~ite30_Out1617872395|} AuxVars[] AssignedVars[~y$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 19:35:46,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L763-->L763-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd1~0_In805382199 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In805382199 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In805382199 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In805382199 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite31_Out805382199| ~y$r_buff1_thd1~0_In805382199)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork1_#t~ite31_Out805382199| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In805382199, ~y$w_buff0_used~0=~y$w_buff0_used~0_In805382199, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In805382199, ~y$w_buff1_used~0=~y$w_buff1_used~0_In805382199} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In805382199, ~y$w_buff0_used~0=~y$w_buff0_used~0_In805382199, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In805382199, P0Thread1of1ForFork1_#t~ite31=|P0Thread1of1ForFork1_#t~ite31_Out805382199|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In805382199} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 19:35:46,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L795-2-->L795-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-454680631 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-454680631 256) 0))) (or (and (= ~y$w_buff1~0_In-454680631 |P1Thread1of1ForFork0_#t~ite55_Out-454680631|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y~0_In-454680631 |P1Thread1of1ForFork0_#t~ite55_Out-454680631|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-454680631, ~y$w_buff1~0=~y$w_buff1~0_In-454680631, ~y~0=~y~0_In-454680631, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-454680631} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-454680631, ~y$w_buff1~0=~y$w_buff1~0_In-454680631, P1Thread1of1ForFork0_#t~ite55=|P1Thread1of1ForFork0_#t~ite55_Out-454680631|, ~y~0=~y~0_In-454680631, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-454680631} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite55] because there is no mapped edge [2019-12-27 19:35:46,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L795-4-->L796: Formula: (= v_~y~0_27 |v_P1Thread1of1ForFork0_#t~ite55_8|) InVars {P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_8|} OutVars{P1Thread1of1ForFork0_#t~ite56=|v_P1Thread1of1ForFork0_#t~ite56_7|, P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_7|, ~y~0=v_~y~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite56, P1Thread1of1ForFork0_#t~ite55, ~y~0] because there is no mapped edge [2019-12-27 19:35:46,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1547057895 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1547057895 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite57_Out1547057895| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite57_Out1547057895| ~y$w_buff0_used~0_In1547057895)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1547057895, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1547057895} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1547057895, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1547057895, P1Thread1of1ForFork0_#t~ite57=|P1Thread1of1ForFork0_#t~ite57_Out1547057895|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite57] because there is no mapped edge [2019-12-27 19:35:46,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1011] [1011] L797-->L797-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1163980255 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1163980255 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1163980255 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In-1163980255 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite58_Out-1163980255| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-1163980255 |P1Thread1of1ForFork0_#t~ite58_Out-1163980255|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1163980255, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1163980255, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1163980255, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1163980255} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1163980255, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1163980255, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1163980255, P1Thread1of1ForFork0_#t~ite58=|P1Thread1of1ForFork0_#t~ite58_Out-1163980255|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1163980255} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite58] because there is no mapped edge [2019-12-27 19:35:46,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-869723372 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-869723372 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In-869723372 |P1Thread1of1ForFork0_#t~ite59_Out-869723372|)) (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite59_Out-869723372| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-869723372, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-869723372} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-869723372, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-869723372, P1Thread1of1ForFork0_#t~ite59=|P1Thread1of1ForFork0_#t~ite59_Out-869723372|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite59] because there is no mapped edge [2019-12-27 19:35:46,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1037] [1037] L763-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~y$r_buff1_thd1~0_36 |v_P0Thread1of1ForFork1_#t~ite31_8|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_8|} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_36, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_7|} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 19:35:46,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1619338521 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1619338521 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1619338521 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In1619338521 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite60_Out1619338521| ~y$r_buff1_thd2~0_In1619338521) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite60_Out1619338521| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1619338521, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1619338521, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1619338521, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1619338521} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1619338521, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1619338521, P1Thread1of1ForFork0_#t~ite60=|P1Thread1of1ForFork0_#t~ite60_Out1619338521|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1619338521, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1619338521} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite60] because there is no mapped edge [2019-12-27 19:35:46,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1038] [1038] L799-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= v_~y$r_buff1_thd2~0_34 |v_P1Thread1of1ForFork0_#t~ite60_8|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_34, P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite60, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 19:35:46,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L820-1-->L826: Formula: (and (= v_~__unbuffered_cnt~0_8 2) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet62, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 19:35:46,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L826-2-->L826-5: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-443912344 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-443912344 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite64_Out-443912344| |ULTIMATE.start_main_#t~ite63_Out-443912344|))) (or (and (= ~y~0_In-443912344 |ULTIMATE.start_main_#t~ite63_Out-443912344|) .cse0 (or .cse1 .cse2)) (and (= |ULTIMATE.start_main_#t~ite63_Out-443912344| ~y$w_buff1~0_In-443912344) (not .cse2) (not .cse1) .cse0))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-443912344, ~y~0=~y~0_In-443912344, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-443912344, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-443912344} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-443912344|, ~y$w_buff1~0=~y$w_buff1~0_In-443912344, ~y~0=~y~0_In-443912344, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-443912344, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-443912344|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-443912344} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-27 19:35:46,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1017] [1017] L827-->L827-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2131957640 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-2131957640 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite65_Out-2131957640| ~y$w_buff0_used~0_In-2131957640) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite65_Out-2131957640| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2131957640, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2131957640} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2131957640, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2131957640, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out-2131957640|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-27 19:35:46,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L828-->L828-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1901010337 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1901010337 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In1901010337 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In1901010337 256)))) (or (and (= |ULTIMATE.start_main_#t~ite66_Out1901010337| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In1901010337 |ULTIMATE.start_main_#t~ite66_Out1901010337|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1901010337, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1901010337, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1901010337, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1901010337} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1901010337, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1901010337, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out1901010337|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1901010337, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1901010337} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-27 19:35:46,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In713518112 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In713518112 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite67_Out713518112|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite67_Out713518112| ~y$r_buff0_thd0~0_In713518112) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In713518112, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In713518112} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In713518112, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In713518112, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out713518112|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-27 19:35:46,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L830-->L830-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-2142980500 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-2142980500 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-2142980500 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-2142980500 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In-2142980500 |ULTIMATE.start_main_#t~ite68_Out-2142980500|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite68_Out-2142980500|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2142980500, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2142980500, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2142980500, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2142980500} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2142980500, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2142980500, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out-2142980500|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2142980500, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2142980500} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-27 19:35:46,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1055] [1055] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= 1 v_~__unbuffered_p1_EAX~0_8) (= v_~main$tmp_guard1~0_10 0) (= v_~__unbuffered_p0_EBX~0_8 0) (= v_~__unbuffered_p0_EAX~0_9 1) (= 0 v_~__unbuffered_p1_EBX~0_9) (= |v_ULTIMATE.start_main_#t~ite68_15| v_~y$r_buff1_thd0~0_20)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_15|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_14|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_20, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite68, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 19:35:46,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:35:46 BasicIcfg [2019-12-27 19:35:46,193 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 19:35:46,197 INFO L168 Benchmark]: Toolchain (without parser) took 22413.93 ms. Allocated memory was 137.9 MB in the beginning and 1.1 GB in the end (delta: 938.0 MB). Free memory was 100.9 MB in the beginning and 616.3 MB in the end (delta: -515.4 MB). Peak memory consumption was 422.5 MB. Max. memory is 7.1 GB. [2019-12-27 19:35:46,197 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 137.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 19:35:46,202 INFO L168 Benchmark]: CACSL2BoogieTranslator took 754.57 ms. Allocated memory was 137.9 MB in the beginning and 226.5 MB in the end (delta: 88.6 MB). Free memory was 100.5 MB in the beginning and 190.3 MB in the end (delta: -89.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-27 19:35:46,203 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.04 ms. Allocated memory is still 226.5 MB. Free memory was 190.3 MB in the beginning and 187.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 19:35:46,204 INFO L168 Benchmark]: Boogie Preprocessor took 42.61 ms. Allocated memory is still 226.5 MB. Free memory was 187.6 MB in the beginning and 184.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 19:35:46,204 INFO L168 Benchmark]: RCFGBuilder took 1192.82 ms. Allocated memory is still 226.5 MB. Free memory was 184.9 MB in the beginning and 127.3 MB in the end (delta: 57.6 MB). Peak memory consumption was 57.6 MB. Max. memory is 7.1 GB. [2019-12-27 19:35:46,205 INFO L168 Benchmark]: TraceAbstraction took 20348.16 ms. Allocated memory was 226.5 MB in the beginning and 1.1 GB in the end (delta: 849.3 MB). Free memory was 127.3 MB in the beginning and 616.3 MB in the end (delta: -489.0 MB). Peak memory consumption was 360.3 MB. Max. memory is 7.1 GB. [2019-12-27 19:35:46,209 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.52 ms. Allocated memory is still 137.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 754.57 ms. Allocated memory was 137.9 MB in the beginning and 226.5 MB in the end (delta: 88.6 MB). Free memory was 100.5 MB in the beginning and 190.3 MB in the end (delta: -89.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.04 ms. Allocated memory is still 226.5 MB. Free memory was 190.3 MB in the beginning and 187.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.61 ms. Allocated memory is still 226.5 MB. Free memory was 187.6 MB in the beginning and 184.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1192.82 ms. Allocated memory is still 226.5 MB. Free memory was 184.9 MB in the beginning and 127.3 MB in the end (delta: 57.6 MB). Peak memory consumption was 57.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20348.16 ms. Allocated memory was 226.5 MB in the beginning and 1.1 GB in the end (delta: 849.3 MB). Free memory was 127.3 MB in the beginning and 616.3 MB in the end (delta: -489.0 MB). Peak memory consumption was 360.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 191 ProgramPointsBefore, 116 ProgramPointsAfterwards, 246 TransitionsBefore, 141 TransitionsAfterwards, 27428 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 26 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 53 ConcurrentYvCompositions, 33 ChoiceCompositions, 9313 VarBasedMoverChecksPositive, 294 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 156567 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t2, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L729] 1 y$w_buff1 = y$w_buff0 [L730] 1 y$w_buff0 = 1 [L731] 1 y$w_buff1_used = y$w_buff0_used [L732] 1 y$w_buff0_used = (_Bool)1 [L820] FCALL, FORK 0 pthread_create(&t3, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, 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] [L744] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, 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] [L744] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L745] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, 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] [L745] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L746] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, 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] [L746] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L747] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, 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] [L747] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, 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] [L748] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L750] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, 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] [L750] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, 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] [L752] 1 y = y$flush_delayed ? y$mem_tmp : y [L753] 1 y$flush_delayed = (_Bool)0 [L756] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, 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] [L759] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, 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] [L773] 2 x = 1 [L776] 2 __unbuffered_p1_EAX = x [L779] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 2 y$flush_delayed = weak$$choice2 [L782] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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] [L783] 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=1, __unbuffered_p0_EBX=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] [L783] 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) [L784] 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=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y$w_buff1=0, y$w_buff1_used=0] [L784] 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)) [L785] EXPR 2 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_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))=0, 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] [L785] 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)) [L786] EXPR 2 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_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))=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] [L786] 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)) [L787] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, 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] [L787] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, 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] [L788] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L789] EXPR 2 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_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))=0, 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] [L789] 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)) [L790] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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] [L759] 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) [L760] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L761] 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 [L791] 2 y = y$flush_delayed ? y$mem_tmp : y [L792] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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] [L795] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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] [L796] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L797] 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 [L798] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L826] EXPR 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=1, __unbuffered_p0_EBX=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] [L826] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] 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 [L829] 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, 185 locations, 2 error locations. Result: UNSAFE, OverallTime: 19.9s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3955 SDtfs, 3575 SDslu, 10184 SDs, 0 SdLazy, 2406 SolverSat, 131 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 44 SyntacticMatches, 7 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31650occurred 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: 3.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 15291 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 739 NumberOfCodeBlocks, 739 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 652 ConstructedInterpolants, 0 QuantifiedInterpolants, 102018 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...