/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:05:00,488 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:05:00,492 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:05:00,509 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:05:00,510 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:05:00,512 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:05:00,513 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:05:00,522 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:05:00,526 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:05:00,529 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:05:00,531 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:05:00,532 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:05:00,532 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:05:00,533 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:05:00,534 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:05:00,536 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:05:00,537 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:05:00,538 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:05:00,540 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:05:00,545 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:05:00,550 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:05:00,551 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:05:00,552 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:05:00,553 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:05:00,555 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:05:00,555 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:05:00,555 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:05:00,556 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:05:00,556 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:05:00,557 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:05:00,557 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:05:00,558 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:05:00,559 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:05:00,559 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:05:00,560 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:05:00,560 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:05:00,561 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:05:00,561 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:05:00,561 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:05:00,562 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:05:00,563 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:05:00,564 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 20:05:00,577 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:05:00,577 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:05:00,578 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:05:00,579 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:05:00,579 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:05:00,579 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:05:00,579 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:05:00,580 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:05:00,580 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:05:00,580 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:05:00,580 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:05:00,580 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:05:00,581 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:05:00,581 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:05:00,581 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:05:00,581 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:05:00,581 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:05:00,582 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:05:00,582 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:05:00,582 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:05:00,582 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:05:00,582 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:05:00,583 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:05:00,583 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:05:00,583 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:05:00,583 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:05:00,583 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:05:00,584 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:05:00,584 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:05:00,584 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:05:00,851 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:05:00,864 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:05:00,867 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:05:00,869 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:05:00,869 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:05:00,870 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.opt.i [2019-12-18 20:05:00,944 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75d35d601/3df55184aba14dffb5decb43e5a9936c/FLAG8e2ecb7ba [2019-12-18 20:05:01,494 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:05:01,495 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_tso.opt.i [2019-12-18 20:05:01,525 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75d35d601/3df55184aba14dffb5decb43e5a9936c/FLAG8e2ecb7ba [2019-12-18 20:05:01,753 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75d35d601/3df55184aba14dffb5decb43e5a9936c [2019-12-18 20:05:01,764 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:05:01,767 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:05:01,768 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:05:01,768 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:05:01,773 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:05:01,774 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:05:01" (1/1) ... [2019-12-18 20:05:01,777 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30191dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:05:01, skipping insertion in model container [2019-12-18 20:05:01,777 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:05:01" (1/1) ... [2019-12-18 20:05:01,787 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:05:01,832 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:05:02,339 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:05:02,361 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:05:02,499 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:05:02,602 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:05:02,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:05:02 WrapperNode [2019-12-18 20:05:02,603 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:05:02,604 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:05:02,604 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:05:02,604 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:05:02,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:05:02" (1/1) ... [2019-12-18 20:05:02,649 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:05:02" (1/1) ... [2019-12-18 20:05:02,686 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:05:02,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:05:02,687 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:05:02,687 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:05:02,696 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:05:02" (1/1) ... [2019-12-18 20:05:02,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:05:02" (1/1) ... [2019-12-18 20:05:02,701 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:05:02" (1/1) ... [2019-12-18 20:05:02,701 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:05:02" (1/1) ... [2019-12-18 20:05:02,713 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:05:02" (1/1) ... [2019-12-18 20:05:02,718 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:05:02" (1/1) ... [2019-12-18 20:05:02,723 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:05:02" (1/1) ... [2019-12-18 20:05:02,732 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:05:02,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:05:02,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:05:02,737 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:05:02,741 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:05:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:05:02,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:05:02,814 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:05:02,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:05:02,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:05:02,815 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:05:02,815 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:05:02,815 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:05:02,815 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:05:02,816 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 20:05:02,816 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 20:05:02,816 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 20:05:02,816 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 20:05:02,816 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:05:02,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:05:02,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:05:02,819 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 20:05:03,720 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:05:03,721 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:05:03,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:05:03 BoogieIcfgContainer [2019-12-18 20:05:03,751 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:05:03,752 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:05:03,752 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:05:03,755 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:05:03,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:05:01" (1/3) ... [2019-12-18 20:05:03,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32bba2c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:05:03, skipping insertion in model container [2019-12-18 20:05:03,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:05:02" (2/3) ... [2019-12-18 20:05:03,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32bba2c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:05:03, skipping insertion in model container [2019-12-18 20:05:03,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:05:03" (3/3) ... [2019-12-18 20:05:03,759 INFO L109 eAbstractionObserver]: Analyzing ICFG mix005_tso.opt.i [2019-12-18 20:05:03,769 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:05:03,770 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:05:03,778 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:05:03,779 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:05:03,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,823 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,823 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,825 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,825 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,827 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,827 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,847 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,848 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,848 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,848 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,848 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,848 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,849 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,849 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,849 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,849 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,849 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,850 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,850 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,850 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,850 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,851 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,851 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,851 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,851 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,851 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,852 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,852 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,852 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,852 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,852 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,852 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,853 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,853 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,853 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,853 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,854 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,854 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,854 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,854 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,854 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,854 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,855 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,855 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,855 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,855 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,855 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,856 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,856 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,856 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,856 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,856 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,856 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,857 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,857 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,857 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,857 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,858 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,858 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,858 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,858 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,858 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,858 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,859 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,859 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,859 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,859 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,859 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,860 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,860 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,860 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,860 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,860 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,861 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,861 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,861 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,861 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,861 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,862 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,862 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,862 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,862 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,862 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,863 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,863 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,863 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,863 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,863 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,863 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,864 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,864 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,864 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,864 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,864 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,865 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,865 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,865 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,865 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,865 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,865 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,866 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,866 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,866 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,866 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,866 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,867 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,867 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,867 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,867 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,867 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,867 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,868 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,868 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,868 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,868 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,868 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,869 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,869 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,869 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,869 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,869 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,870 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,870 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,870 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,870 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,870 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,871 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,871 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,874 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,875 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,879 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,880 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,886 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,887 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,887 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,887 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,887 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,887 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,887 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,888 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,888 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,888 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,888 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,888 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,889 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,889 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,889 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,889 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,889 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,889 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,890 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,890 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,890 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,890 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,890 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,891 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,891 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,891 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,891 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,891 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,891 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,892 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,892 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,892 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,892 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,892 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,893 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,904 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,905 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:05:03,919 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 20:05:03,943 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:05:03,943 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:05:03,943 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:05:03,944 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:05:03,944 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:05:03,944 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:05:03,944 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:05:03,944 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:05:03,966 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 212 places, 255 transitions [2019-12-18 20:05:03,968 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 212 places, 255 transitions [2019-12-18 20:05:04,115 INFO L126 PetriNetUnfolder]: 56/251 cut-off events. [2019-12-18 20:05:04,116 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:05:04,137 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 251 events. 56/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 559 event pairs. 12/205 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-18 20:05:04,168 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 212 places, 255 transitions [2019-12-18 20:05:04,244 INFO L126 PetriNetUnfolder]: 56/251 cut-off events. [2019-12-18 20:05:04,244 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:05:04,254 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 251 events. 56/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 559 event pairs. 12/205 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-18 20:05:04,288 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-18 20:05:04,289 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:05:07,727 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-12-18 20:05:08,157 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-18 20:05:08,307 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-18 20:05:08,633 WARN L192 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-18 20:05:08,785 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-18 20:05:08,815 INFO L206 etLargeBlockEncoding]: Checked pairs total: 148368 [2019-12-18 20:05:08,815 INFO L214 etLargeBlockEncoding]: Total number of compositions: 129 [2019-12-18 20:05:08,818 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 115 places, 135 transitions [2019-12-18 20:05:19,397 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 93038 states. [2019-12-18 20:05:19,399 INFO L276 IsEmpty]: Start isEmpty. Operand 93038 states. [2019-12-18 20:05:19,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 20:05:19,406 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:05:19,407 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:05:19,408 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:05:19,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:05:19,413 INFO L82 PathProgramCache]: Analyzing trace with hash -219848509, now seen corresponding path program 1 times [2019-12-18 20:05:19,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:05:19,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622837094] [2019-12-18 20:05:19,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:05:19,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:05:19,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:05:19,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622837094] [2019-12-18 20:05:19,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:05:19,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:05:19,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430603466] [2019-12-18 20:05:19,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:05:19,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:05:19,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:05:19,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:05:19,776 INFO L87 Difference]: Start difference. First operand 93038 states. Second operand 3 states. [2019-12-18 20:05:21,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:05:21,220 INFO L93 Difference]: Finished difference Result 92046 states and 422416 transitions. [2019-12-18 20:05:21,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:05:21,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 20:05:21,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:05:24,543 INFO L225 Difference]: With dead ends: 92046 [2019-12-18 20:05:24,543 INFO L226 Difference]: Without dead ends: 85710 [2019-12-18 20:05:24,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:05:26,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85710 states. [2019-12-18 20:05:31,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85710 to 85710. [2019-12-18 20:05:31,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85710 states. [2019-12-18 20:05:32,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85710 states to 85710 states and 393088 transitions. [2019-12-18 20:05:32,183 INFO L78 Accepts]: Start accepts. Automaton has 85710 states and 393088 transitions. Word has length 9 [2019-12-18 20:05:32,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:05:32,184 INFO L462 AbstractCegarLoop]: Abstraction has 85710 states and 393088 transitions. [2019-12-18 20:05:32,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:05:32,184 INFO L276 IsEmpty]: Start isEmpty. Operand 85710 states and 393088 transitions. [2019-12-18 20:05:32,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 20:05:32,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:05:32,195 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:05:32,195 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:05:32,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:05:32,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1999056324, now seen corresponding path program 1 times [2019-12-18 20:05:32,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:05:32,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508700262] [2019-12-18 20:05:32,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:05:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:05:32,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:05:32,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508700262] [2019-12-18 20:05:32,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:05:32,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:05:32,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205724479] [2019-12-18 20:05:32,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:05:32,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:05:32,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:05:32,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:05:32,330 INFO L87 Difference]: Start difference. First operand 85710 states and 393088 transitions. Second operand 4 states. [2019-12-18 20:05:36,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:05:36,882 INFO L93 Difference]: Finished difference Result 135910 states and 601052 transitions. [2019-12-18 20:05:36,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:05:36,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 20:05:36,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:05:37,492 INFO L225 Difference]: With dead ends: 135910 [2019-12-18 20:05:37,492 INFO L226 Difference]: Without dead ends: 135838 [2019-12-18 20:05:37,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:05:39,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135838 states. [2019-12-18 20:05:42,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135838 to 132030. [2019-12-18 20:05:42,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132030 states. [2019-12-18 20:05:48,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132030 states to 132030 states and 587252 transitions. [2019-12-18 20:05:48,801 INFO L78 Accepts]: Start accepts. Automaton has 132030 states and 587252 transitions. Word has length 15 [2019-12-18 20:05:48,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:05:48,802 INFO L462 AbstractCegarLoop]: Abstraction has 132030 states and 587252 transitions. [2019-12-18 20:05:48,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:05:48,802 INFO L276 IsEmpty]: Start isEmpty. Operand 132030 states and 587252 transitions. [2019-12-18 20:05:48,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 20:05:48,810 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:05:48,810 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:05:48,810 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:05:48,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:05:48,810 INFO L82 PathProgramCache]: Analyzing trace with hash 960194978, now seen corresponding path program 1 times [2019-12-18 20:05:48,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:05:48,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875652668] [2019-12-18 20:05:48,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:05:48,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:05:48,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:05:48,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875652668] [2019-12-18 20:05:48,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:05:48,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:05:48,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292891182] [2019-12-18 20:05:48,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:05:48,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:05:48,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:05:48,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:05:48,899 INFO L87 Difference]: Start difference. First operand 132030 states and 587252 transitions. Second operand 4 states. [2019-12-18 20:05:51,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:05:51,253 INFO L93 Difference]: Finished difference Result 167330 states and 735532 transitions. [2019-12-18 20:05:51,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:05:51,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-18 20:05:51,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:05:51,794 INFO L225 Difference]: With dead ends: 167330 [2019-12-18 20:05:51,794 INFO L226 Difference]: Without dead ends: 167270 [2019-12-18 20:05:51,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:05:59,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167270 states. [2019-12-18 20:06:01,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167270 to 149078. [2019-12-18 20:06:01,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149078 states. [2019-12-18 20:06:03,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149078 states to 149078 states and 660916 transitions. [2019-12-18 20:06:03,102 INFO L78 Accepts]: Start accepts. Automaton has 149078 states and 660916 transitions. Word has length 18 [2019-12-18 20:06:03,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:06:03,103 INFO L462 AbstractCegarLoop]: Abstraction has 149078 states and 660916 transitions. [2019-12-18 20:06:03,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:06:03,103 INFO L276 IsEmpty]: Start isEmpty. Operand 149078 states and 660916 transitions. [2019-12-18 20:06:03,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 20:06:03,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:06:03,122 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] [2019-12-18 20:06:03,123 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:06:03,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:06:03,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1006978459, now seen corresponding path program 1 times [2019-12-18 20:06:03,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:06:03,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303749549] [2019-12-18 20:06:03,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:06:03,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:06:03,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:06:03,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303749549] [2019-12-18 20:06:03,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:06:03,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:06:03,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119161228] [2019-12-18 20:06:03,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:06:03,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:06:03,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:06:03,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:06:03,185 INFO L87 Difference]: Start difference. First operand 149078 states and 660916 transitions. Second operand 3 states. [2019-12-18 20:06:05,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:06:05,226 INFO L93 Difference]: Finished difference Result 145939 states and 643818 transitions. [2019-12-18 20:06:05,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:06:05,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-18 20:06:05,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:06:05,704 INFO L225 Difference]: With dead ends: 145939 [2019-12-18 20:06:05,705 INFO L226 Difference]: Without dead ends: 145939 [2019-12-18 20:06:05,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:06:13,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145939 states. [2019-12-18 20:06:16,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145939 to 145939. [2019-12-18 20:06:16,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145939 states. [2019-12-18 20:06:18,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145939 states to 145939 states and 643818 transitions. [2019-12-18 20:06:18,023 INFO L78 Accepts]: Start accepts. Automaton has 145939 states and 643818 transitions. Word has length 20 [2019-12-18 20:06:18,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:06:18,024 INFO L462 AbstractCegarLoop]: Abstraction has 145939 states and 643818 transitions. [2019-12-18 20:06:18,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:06:18,024 INFO L276 IsEmpty]: Start isEmpty. Operand 145939 states and 643818 transitions. [2019-12-18 20:06:18,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 20:06:18,041 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:06:18,041 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] [2019-12-18 20:06:18,041 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:06:18,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:06:18,042 INFO L82 PathProgramCache]: Analyzing trace with hash -776205731, now seen corresponding path program 1 times [2019-12-18 20:06:18,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:06:18,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524663625] [2019-12-18 20:06:18,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:06:18,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:06:18,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:06:18,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524663625] [2019-12-18 20:06:18,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:06:18,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:06:18,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841767648] [2019-12-18 20:06:18,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:06:18,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:06:18,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:06:18,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:06:18,118 INFO L87 Difference]: Start difference. First operand 145939 states and 643818 transitions. Second operand 3 states. [2019-12-18 20:06:18,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:06:18,989 INFO L93 Difference]: Finished difference Result 180068 states and 754679 transitions. [2019-12-18 20:06:18,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:06:18,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-18 20:06:18,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:06:25,553 INFO L225 Difference]: With dead ends: 180068 [2019-12-18 20:06:25,554 INFO L226 Difference]: Without dead ends: 146514 [2019-12-18 20:06:25,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:06:27,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146514 states. [2019-12-18 20:06:29,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146514 to 143325. [2019-12-18 20:06:29,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143325 states. [2019-12-18 20:06:30,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143325 states to 143325 states and 597576 transitions. [2019-12-18 20:06:30,042 INFO L78 Accepts]: Start accepts. Automaton has 143325 states and 597576 transitions. Word has length 21 [2019-12-18 20:06:30,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:06:30,043 INFO L462 AbstractCegarLoop]: Abstraction has 143325 states and 597576 transitions. [2019-12-18 20:06:30,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:06:30,043 INFO L276 IsEmpty]: Start isEmpty. Operand 143325 states and 597576 transitions. [2019-12-18 20:06:30,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 20:06:30,056 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:06:30,056 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] [2019-12-18 20:06:30,056 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:06:30,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:06:30,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1300239832, now seen corresponding path program 1 times [2019-12-18 20:06:30,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:06:30,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688556391] [2019-12-18 20:06:30,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:06:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:06:30,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:06:30,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688556391] [2019-12-18 20:06:30,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:06:30,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:06:30,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537799465] [2019-12-18 20:06:30,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:06:30,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:06:30,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:06:30,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:06:30,116 INFO L87 Difference]: Start difference. First operand 143325 states and 597576 transitions. Second operand 3 states. [2019-12-18 20:06:31,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:06:31,765 INFO L93 Difference]: Finished difference Result 143151 states and 596933 transitions. [2019-12-18 20:06:31,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:06:31,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-18 20:06:31,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:06:32,185 INFO L225 Difference]: With dead ends: 143151 [2019-12-18 20:06:32,185 INFO L226 Difference]: Without dead ends: 143151 [2019-12-18 20:06:32,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:06:39,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143151 states. [2019-12-18 20:06:41,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143151 to 143151. [2019-12-18 20:06:41,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143151 states. [2019-12-18 20:06:42,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143151 states to 143151 states and 596933 transitions. [2019-12-18 20:06:42,841 INFO L78 Accepts]: Start accepts. Automaton has 143151 states and 596933 transitions. Word has length 21 [2019-12-18 20:06:42,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:06:42,841 INFO L462 AbstractCegarLoop]: Abstraction has 143151 states and 596933 transitions. [2019-12-18 20:06:42,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:06:42,841 INFO L276 IsEmpty]: Start isEmpty. Operand 143151 states and 596933 transitions. [2019-12-18 20:06:42,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 20:06:42,866 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:06:42,866 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] [2019-12-18 20:06:42,866 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:06:42,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:06:42,867 INFO L82 PathProgramCache]: Analyzing trace with hash -338694234, now seen corresponding path program 1 times [2019-12-18 20:06:42,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:06:42,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381488150] [2019-12-18 20:06:42,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:06:42,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:06:42,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:06:42,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381488150] [2019-12-18 20:06:42,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:06:42,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:06:42,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672136516] [2019-12-18 20:06:42,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:06:42,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:06:42,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:06:42,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:06:42,939 INFO L87 Difference]: Start difference. First operand 143151 states and 596933 transitions. Second operand 4 states. [2019-12-18 20:06:43,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:06:43,896 INFO L93 Difference]: Finished difference Result 210250 states and 827736 transitions. [2019-12-18 20:06:43,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:06:43,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-18 20:06:43,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:06:50,015 INFO L225 Difference]: With dead ends: 210250 [2019-12-18 20:06:50,015 INFO L226 Difference]: Without dead ends: 79302 [2019-12-18 20:06:50,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:06:50,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79302 states. [2019-12-18 20:06:51,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79302 to 78186. [2019-12-18 20:06:51,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78186 states. [2019-12-18 20:06:52,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78186 states to 78186 states and 272476 transitions. [2019-12-18 20:06:52,059 INFO L78 Accepts]: Start accepts. Automaton has 78186 states and 272476 transitions. Word has length 22 [2019-12-18 20:06:52,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:06:52,059 INFO L462 AbstractCegarLoop]: Abstraction has 78186 states and 272476 transitions. [2019-12-18 20:06:52,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:06:52,059 INFO L276 IsEmpty]: Start isEmpty. Operand 78186 states and 272476 transitions. [2019-12-18 20:06:52,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 20:06:52,068 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:06:52,068 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] [2019-12-18 20:06:52,068 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:06:52,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:06:52,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1675693570, now seen corresponding path program 2 times [2019-12-18 20:06:52,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:06:52,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772550019] [2019-12-18 20:06:52,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:06:52,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:06:52,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:06:52,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772550019] [2019-12-18 20:06:52,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:06:52,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:06:52,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298432954] [2019-12-18 20:06:52,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:06:52,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:06:52,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:06:52,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:06:52,113 INFO L87 Difference]: Start difference. First operand 78186 states and 272476 transitions. Second operand 3 states. [2019-12-18 20:06:52,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:06:52,381 INFO L93 Difference]: Finished difference Result 73900 states and 255147 transitions. [2019-12-18 20:06:52,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:06:52,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-18 20:06:52,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:06:52,525 INFO L225 Difference]: With dead ends: 73900 [2019-12-18 20:06:52,526 INFO L226 Difference]: Without dead ends: 73684 [2019-12-18 20:06:52,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:06:53,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73684 states. [2019-12-18 20:06:54,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73684 to 73468. [2019-12-18 20:06:54,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73468 states. [2019-12-18 20:06:54,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73468 states to 73468 states and 253875 transitions. [2019-12-18 20:06:54,770 INFO L78 Accepts]: Start accepts. Automaton has 73468 states and 253875 transitions. Word has length 22 [2019-12-18 20:06:54,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:06:54,770 INFO L462 AbstractCegarLoop]: Abstraction has 73468 states and 253875 transitions. [2019-12-18 20:06:54,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:06:54,770 INFO L276 IsEmpty]: Start isEmpty. Operand 73468 states and 253875 transitions. [2019-12-18 20:06:54,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 20:06:54,782 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:06:54,782 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:06:54,782 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:06:54,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:06:54,783 INFO L82 PathProgramCache]: Analyzing trace with hash 2098624475, now seen corresponding path program 1 times [2019-12-18 20:06:54,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:06:54,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319293228] [2019-12-18 20:06:54,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:06:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:06:54,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:06:54,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319293228] [2019-12-18 20:06:54,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:06:54,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:06:54,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330816914] [2019-12-18 20:06:54,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:06:54,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:06:54,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:06:54,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:06:54,850 INFO L87 Difference]: Start difference. First operand 73468 states and 253875 transitions. Second operand 5 states. [2019-12-18 20:06:56,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:06:56,259 INFO L93 Difference]: Finished difference Result 87478 states and 296814 transitions. [2019-12-18 20:06:56,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:06:56,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-18 20:06:56,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:06:56,437 INFO L225 Difference]: With dead ends: 87478 [2019-12-18 20:06:56,438 INFO L226 Difference]: Without dead ends: 85842 [2019-12-18 20:06:56,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:06:57,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85842 states. [2019-12-18 20:06:58,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85842 to 71222. [2019-12-18 20:06:58,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71222 states. [2019-12-18 20:06:58,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71222 states to 71222 states and 245537 transitions. [2019-12-18 20:06:58,978 INFO L78 Accepts]: Start accepts. Automaton has 71222 states and 245537 transitions. Word has length 24 [2019-12-18 20:06:58,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:06:58,978 INFO L462 AbstractCegarLoop]: Abstraction has 71222 states and 245537 transitions. [2019-12-18 20:06:58,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:06:58,978 INFO L276 IsEmpty]: Start isEmpty. Operand 71222 states and 245537 transitions. [2019-12-18 20:06:59,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-18 20:06:59,047 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:06:59,047 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] [2019-12-18 20:06:59,047 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:06:59,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:06:59,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1881257346, now seen corresponding path program 1 times [2019-12-18 20:06:59,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:06:59,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960989788] [2019-12-18 20:06:59,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:06:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:06:59,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:06:59,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960989788] [2019-12-18 20:06:59,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:06:59,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:06:59,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080075941] [2019-12-18 20:06:59,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:06:59,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:06:59,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:06:59,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:06:59,120 INFO L87 Difference]: Start difference. First operand 71222 states and 245537 transitions. Second operand 3 states. [2019-12-18 20:06:59,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:06:59,369 INFO L93 Difference]: Finished difference Result 71222 states and 242269 transitions. [2019-12-18 20:06:59,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:06:59,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-12-18 20:06:59,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:06:59,512 INFO L225 Difference]: With dead ends: 71222 [2019-12-18 20:06:59,512 INFO L226 Difference]: Without dead ends: 71222 [2019-12-18 20:06:59,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:07:00,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71222 states. [2019-12-18 20:07:01,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71222 to 71046. [2019-12-18 20:07:01,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71046 states. [2019-12-18 20:07:01,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71046 states to 71046 states and 241801 transitions. [2019-12-18 20:07:01,837 INFO L78 Accepts]: Start accepts. Automaton has 71046 states and 241801 transitions. Word has length 36 [2019-12-18 20:07:01,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:07:01,837 INFO L462 AbstractCegarLoop]: Abstraction has 71046 states and 241801 transitions. [2019-12-18 20:07:01,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:07:01,837 INFO L276 IsEmpty]: Start isEmpty. Operand 71046 states and 241801 transitions. [2019-12-18 20:07:01,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 20:07:01,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:07:01,902 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:07:01,902 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:07:01,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:07:01,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1678028845, now seen corresponding path program 1 times [2019-12-18 20:07:01,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:07:01,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691461721] [2019-12-18 20:07:01,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:07:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:07:02,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:07:02,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691461721] [2019-12-18 20:07:02,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:07:02,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 20:07:02,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761844833] [2019-12-18 20:07:02,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 20:07:02,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:07:02,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 20:07:02,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:07:02,029 INFO L87 Difference]: Start difference. First operand 71046 states and 241801 transitions. Second operand 9 states. [2019-12-18 20:07:04,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:07:04,289 INFO L93 Difference]: Finished difference Result 172806 states and 593056 transitions. [2019-12-18 20:07:04,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 20:07:04,289 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2019-12-18 20:07:04,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:07:04,589 INFO L225 Difference]: With dead ends: 172806 [2019-12-18 20:07:04,589 INFO L226 Difference]: Without dead ends: 144716 [2019-12-18 20:07:04,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2019-12-18 20:07:05,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144716 states. [2019-12-18 20:07:07,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144716 to 104724. [2019-12-18 20:07:07,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104724 states. [2019-12-18 20:07:09,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104724 states to 104724 states and 363296 transitions. [2019-12-18 20:07:09,150 INFO L78 Accepts]: Start accepts. Automaton has 104724 states and 363296 transitions. Word has length 37 [2019-12-18 20:07:09,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:07:09,150 INFO L462 AbstractCegarLoop]: Abstraction has 104724 states and 363296 transitions. [2019-12-18 20:07:09,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 20:07:09,150 INFO L276 IsEmpty]: Start isEmpty. Operand 104724 states and 363296 transitions. [2019-12-18 20:07:09,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 20:07:09,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:07:09,265 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:07:09,265 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:07:09,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:07:09,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1355430725, now seen corresponding path program 2 times [2019-12-18 20:07:09,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:07:09,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359102855] [2019-12-18 20:07:09,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:07:09,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:07:09,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:07:09,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359102855] [2019-12-18 20:07:09,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:07:09,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:07:09,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062383366] [2019-12-18 20:07:09,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 20:07:09,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:07:09,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 20:07:09,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:07:09,473 INFO L87 Difference]: Start difference. First operand 104724 states and 363296 transitions. Second operand 10 states. [2019-12-18 20:07:11,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:07:11,787 INFO L93 Difference]: Finished difference Result 146698 states and 515074 transitions. [2019-12-18 20:07:11,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 20:07:11,787 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2019-12-18 20:07:11,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:07:12,983 INFO L225 Difference]: With dead ends: 146698 [2019-12-18 20:07:12,983 INFO L226 Difference]: Without dead ends: 137050 [2019-12-18 20:07:12,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2019-12-18 20:07:14,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137050 states. [2019-12-18 20:07:16,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137050 to 108540. [2019-12-18 20:07:16,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108540 states. [2019-12-18 20:07:16,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108540 states to 108540 states and 377388 transitions. [2019-12-18 20:07:16,342 INFO L78 Accepts]: Start accepts. Automaton has 108540 states and 377388 transitions. Word has length 37 [2019-12-18 20:07:16,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:07:16,342 INFO L462 AbstractCegarLoop]: Abstraction has 108540 states and 377388 transitions. [2019-12-18 20:07:16,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 20:07:16,342 INFO L276 IsEmpty]: Start isEmpty. Operand 108540 states and 377388 transitions. [2019-12-18 20:07:16,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 20:07:16,448 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:07:16,448 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:07:16,448 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:07:16,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:07:16,448 INFO L82 PathProgramCache]: Analyzing trace with hash -830829175, now seen corresponding path program 3 times [2019-12-18 20:07:16,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:07:16,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435386457] [2019-12-18 20:07:16,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:07:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:07:16,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:07:16,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435386457] [2019-12-18 20:07:16,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:07:16,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:07:16,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227687980] [2019-12-18 20:07:16,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 20:07:16,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:07:16,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 20:07:16,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-18 20:07:16,626 INFO L87 Difference]: Start difference. First operand 108540 states and 377388 transitions. Second operand 10 states. [2019-12-18 20:07:19,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:07:19,475 INFO L93 Difference]: Finished difference Result 154590 states and 538154 transitions. [2019-12-18 20:07:19,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 20:07:19,475 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2019-12-18 20:07:19,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:07:19,788 INFO L225 Difference]: With dead ends: 154590 [2019-12-18 20:07:19,788 INFO L226 Difference]: Without dead ends: 148382 [2019-12-18 20:07:19,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=184, Invalid=518, Unknown=0, NotChecked=0, Total=702 [2019-12-18 20:07:21,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148382 states. [2019-12-18 20:07:27,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148382 to 106608. [2019-12-18 20:07:27,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106608 states. [2019-12-18 20:07:27,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106608 states to 106608 states and 370310 transitions. [2019-12-18 20:07:27,680 INFO L78 Accepts]: Start accepts. Automaton has 106608 states and 370310 transitions. Word has length 37 [2019-12-18 20:07:27,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:07:27,681 INFO L462 AbstractCegarLoop]: Abstraction has 106608 states and 370310 transitions. [2019-12-18 20:07:27,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 20:07:27,681 INFO L276 IsEmpty]: Start isEmpty. Operand 106608 states and 370310 transitions. [2019-12-18 20:07:27,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 20:07:27,782 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:07:27,782 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:07:27,782 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:07:27,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:07:27,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1733296365, now seen corresponding path program 4 times [2019-12-18 20:07:27,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:07:27,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341542942] [2019-12-18 20:07:27,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:07:27,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:07:27,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:07:27,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341542942] [2019-12-18 20:07:27,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:07:27,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:07:27,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799767384] [2019-12-18 20:07:27,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:07:27,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:07:27,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:07:27,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:07:27,857 INFO L87 Difference]: Start difference. First operand 106608 states and 370310 transitions. Second operand 5 states. [2019-12-18 20:07:29,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:07:29,293 INFO L93 Difference]: Finished difference Result 142580 states and 496562 transitions. [2019-12-18 20:07:29,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:07:29,294 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 20:07:29,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:07:29,595 INFO L225 Difference]: With dead ends: 142580 [2019-12-18 20:07:29,595 INFO L226 Difference]: Without dead ends: 134320 [2019-12-18 20:07:29,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:07:30,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134320 states. [2019-12-18 20:07:35,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134320 to 107320. [2019-12-18 20:07:35,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107320 states. [2019-12-18 20:07:36,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107320 states to 107320 states and 372406 transitions. [2019-12-18 20:07:36,080 INFO L78 Accepts]: Start accepts. Automaton has 107320 states and 372406 transitions. Word has length 37 [2019-12-18 20:07:36,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:07:36,080 INFO L462 AbstractCegarLoop]: Abstraction has 107320 states and 372406 transitions. [2019-12-18 20:07:36,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:07:36,080 INFO L276 IsEmpty]: Start isEmpty. Operand 107320 states and 372406 transitions. [2019-12-18 20:07:36,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 20:07:36,181 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:07:36,182 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:07:36,182 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:07:36,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:07:36,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1364615503, now seen corresponding path program 5 times [2019-12-18 20:07:36,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:07:36,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712007111] [2019-12-18 20:07:36,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:07:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:07:36,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:07:36,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712007111] [2019-12-18 20:07:36,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:07:36,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:07:36,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426389983] [2019-12-18 20:07:36,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:07:36,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:07:36,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:07:36,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:07:36,835 INFO L87 Difference]: Start difference. First operand 107320 states and 372406 transitions. Second operand 7 states. [2019-12-18 20:07:38,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:07:38,283 INFO L93 Difference]: Finished difference Result 211054 states and 725928 transitions. [2019-12-18 20:07:38,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 20:07:38,284 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-12-18 20:07:38,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:07:38,721 INFO L225 Difference]: With dead ends: 211054 [2019-12-18 20:07:38,722 INFO L226 Difference]: Without dead ends: 192118 [2019-12-18 20:07:38,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-12-18 20:07:40,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192118 states. [2019-12-18 20:07:47,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192118 to 118334. [2019-12-18 20:07:47,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118334 states. [2019-12-18 20:07:48,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118334 states to 118334 states and 408858 transitions. [2019-12-18 20:07:48,376 INFO L78 Accepts]: Start accepts. Automaton has 118334 states and 408858 transitions. Word has length 37 [2019-12-18 20:07:48,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:07:48,376 INFO L462 AbstractCegarLoop]: Abstraction has 118334 states and 408858 transitions. [2019-12-18 20:07:48,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:07:48,377 INFO L276 IsEmpty]: Start isEmpty. Operand 118334 states and 408858 transitions. [2019-12-18 20:07:48,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-18 20:07:48,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:07:48,516 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] [2019-12-18 20:07:48,516 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:07:48,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:07:48,517 INFO L82 PathProgramCache]: Analyzing trace with hash -335825104, now seen corresponding path program 1 times [2019-12-18 20:07:48,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:07:48,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143832888] [2019-12-18 20:07:48,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:07:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:07:48,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:07:48,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143832888] [2019-12-18 20:07:48,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:07:48,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:07:48,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473322100] [2019-12-18 20:07:48,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:07:48,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:07:48,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:07:48,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:07:48,624 INFO L87 Difference]: Start difference. First operand 118334 states and 408858 transitions. Second operand 5 states. [2019-12-18 20:07:48,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:07:48,913 INFO L93 Difference]: Finished difference Result 69677 states and 232694 transitions. [2019-12-18 20:07:48,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:07:48,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-12-18 20:07:48,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:07:49,039 INFO L225 Difference]: With dead ends: 69677 [2019-12-18 20:07:49,039 INFO L226 Difference]: Without dead ends: 62855 [2019-12-18 20:07:49,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:07:49,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62855 states. [2019-12-18 20:07:50,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62855 to 62633. [2019-12-18 20:07:50,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62633 states. [2019-12-18 20:07:51,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62633 states to 62633 states and 211072 transitions. [2019-12-18 20:07:51,056 INFO L78 Accepts]: Start accepts. Automaton has 62633 states and 211072 transitions. Word has length 38 [2019-12-18 20:07:51,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:07:51,056 INFO L462 AbstractCegarLoop]: Abstraction has 62633 states and 211072 transitions. [2019-12-18 20:07:51,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:07:51,056 INFO L276 IsEmpty]: Start isEmpty. Operand 62633 states and 211072 transitions. [2019-12-18 20:07:51,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 20:07:51,114 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:07:51,114 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-18 20:07:51,114 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:07:51,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:07:51,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1018558760, now seen corresponding path program 1 times [2019-12-18 20:07:51,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:07:51,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140770651] [2019-12-18 20:07:51,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:07:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:07:51,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:07:51,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140770651] [2019-12-18 20:07:51,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:07:51,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:07:51,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996986227] [2019-12-18 20:07:51,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:07:51,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:07:51,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:07:51,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:07:51,209 INFO L87 Difference]: Start difference. First operand 62633 states and 211072 transitions. Second operand 6 states. [2019-12-18 20:07:51,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:07:51,342 INFO L93 Difference]: Finished difference Result 11729 states and 33009 transitions. [2019-12-18 20:07:51,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:07:51,342 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-18 20:07:51,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:07:51,360 INFO L225 Difference]: With dead ends: 11729 [2019-12-18 20:07:51,360 INFO L226 Difference]: Without dead ends: 8219 [2019-12-18 20:07:51,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:07:51,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8219 states. [2019-12-18 20:07:51,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8219 to 7973. [2019-12-18 20:07:51,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7973 states. [2019-12-18 20:07:51,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7973 states to 7973 states and 20163 transitions. [2019-12-18 20:07:51,510 INFO L78 Accepts]: Start accepts. Automaton has 7973 states and 20163 transitions. Word has length 39 [2019-12-18 20:07:51,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:07:51,510 INFO L462 AbstractCegarLoop]: Abstraction has 7973 states and 20163 transitions. [2019-12-18 20:07:51,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:07:51,510 INFO L276 IsEmpty]: Start isEmpty. Operand 7973 states and 20163 transitions. [2019-12-18 20:07:51,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 20:07:51,522 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:07:51,522 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:07:51,522 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:07:51,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:07:51,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1807974181, now seen corresponding path program 1 times [2019-12-18 20:07:51,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:07:51,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692732157] [2019-12-18 20:07:51,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:07:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:07:51,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:07:51,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692732157] [2019-12-18 20:07:51,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:07:51,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:07:51,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314545286] [2019-12-18 20:07:51,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:07:51,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:07:51,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:07:51,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:07:51,611 INFO L87 Difference]: Start difference. First operand 7973 states and 20163 transitions. Second operand 4 states. [2019-12-18 20:07:51,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:07:51,660 INFO L93 Difference]: Finished difference Result 8935 states and 22358 transitions. [2019-12-18 20:07:51,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:07:51,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-18 20:07:51,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:07:51,674 INFO L225 Difference]: With dead ends: 8935 [2019-12-18 20:07:51,674 INFO L226 Difference]: Without dead ends: 7695 [2019-12-18 20:07:51,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:07:51,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7695 states. [2019-12-18 20:07:51,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7695 to 7677. [2019-12-18 20:07:51,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7677 states. [2019-12-18 20:07:51,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7677 states to 7677 states and 19430 transitions. [2019-12-18 20:07:51,806 INFO L78 Accepts]: Start accepts. Automaton has 7677 states and 19430 transitions. Word has length 50 [2019-12-18 20:07:51,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:07:51,807 INFO L462 AbstractCegarLoop]: Abstraction has 7677 states and 19430 transitions. [2019-12-18 20:07:51,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:07:51,807 INFO L276 IsEmpty]: Start isEmpty. Operand 7677 states and 19430 transitions. [2019-12-18 20:07:51,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 20:07:51,817 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:07:51,818 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:07:51,818 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:07:51,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:07:51,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1074177589, now seen corresponding path program 2 times [2019-12-18 20:07:51,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:07:51,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784674147] [2019-12-18 20:07:51,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:07:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:07:51,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:07:51,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784674147] [2019-12-18 20:07:51,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:07:51,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:07:51,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872036768] [2019-12-18 20:07:51,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:07:51,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:07:51,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:07:51,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:07:51,939 INFO L87 Difference]: Start difference. First operand 7677 states and 19430 transitions. Second operand 7 states. [2019-12-18 20:07:52,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:07:52,039 INFO L93 Difference]: Finished difference Result 6471 states and 16654 transitions. [2019-12-18 20:07:52,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:07:52,040 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-18 20:07:52,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:07:52,041 INFO L225 Difference]: With dead ends: 6471 [2019-12-18 20:07:52,041 INFO L226 Difference]: Without dead ends: 508 [2019-12-18 20:07:52,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:07:52,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2019-12-18 20:07:52,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2019-12-18 20:07:52,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2019-12-18 20:07:52,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 1119 transitions. [2019-12-18 20:07:52,048 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 1119 transitions. Word has length 50 [2019-12-18 20:07:52,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:07:52,048 INFO L462 AbstractCegarLoop]: Abstraction has 508 states and 1119 transitions. [2019-12-18 20:07:52,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:07:52,048 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 1119 transitions. [2019-12-18 20:07:52,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:07:52,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:07:52,049 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:07:52,049 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:07:52,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:07:52,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1499988210, now seen corresponding path program 1 times [2019-12-18 20:07:52,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:07:52,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691040566] [2019-12-18 20:07:52,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:07:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:07:52,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 20:07:52,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691040566] [2019-12-18 20:07:52,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:07:52,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 20:07:52,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282786250] [2019-12-18 20:07:52,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:07:52,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:07:52,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:07:52,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:07:52,141 INFO L87 Difference]: Start difference. First operand 508 states and 1119 transitions. Second operand 8 states. [2019-12-18 20:07:52,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:07:52,346 INFO L93 Difference]: Finished difference Result 1039 states and 2246 transitions. [2019-12-18 20:07:52,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 20:07:52,347 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-18 20:07:52,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:07:52,348 INFO L225 Difference]: With dead ends: 1039 [2019-12-18 20:07:52,348 INFO L226 Difference]: Without dead ends: 764 [2019-12-18 20:07:52,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-18 20:07:52,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-12-18 20:07:52,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 608. [2019-12-18 20:07:52,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-12-18 20:07:52,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 1300 transitions. [2019-12-18 20:07:52,356 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 1300 transitions. Word has length 66 [2019-12-18 20:07:52,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:07:52,356 INFO L462 AbstractCegarLoop]: Abstraction has 608 states and 1300 transitions. [2019-12-18 20:07:52,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:07:52,356 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 1300 transitions. [2019-12-18 20:07:52,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:07:52,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:07:52,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] [2019-12-18 20:07:52,357 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:07:52,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:07:52,357 INFO L82 PathProgramCache]: Analyzing trace with hash 719111176, now seen corresponding path program 2 times [2019-12-18 20:07:52,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:07:52,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388733317] [2019-12-18 20:07:52,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:07:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:07:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:07:52,488 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:07:52,488 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:07:52,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1057] [1057] ULTIMATE.startENTRY-->L856: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= 0 v_~__unbuffered_cnt~0_25) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t149~0.base_29|) (= v_~z$r_buff0_thd1~0_10 0) (= 0 v_~z$w_buff1~0_34) (= 0 v_~__unbuffered_p1_EAX~0_15) (= v_~a~0_11 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t149~0.base_29| 1) |v_#valid_72|) (= v_~z$w_buff0_used~0_132 0) (= v_~__unbuffered_p2_EBX~0_14 0) (= 0 v_~z$r_buff1_thd0~0_21) (= v_~z$r_buff0_thd4~0_77 0) (= v_~z$read_delayed~0_6 0) (= v_~z$r_buff1_thd2~0_9 0) (= v_~z$r_buff0_thd0~0_21 0) (= v_~z$r_buff0_thd2~0_10 0) (= v_~z$r_buff0_thd3~0_54 0) (= 0 v_~z$r_buff1_thd4~0_38) (= |v_ULTIMATE.start_main_~#t149~0.offset_21| 0) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$flush_delayed~0_17) (= 0 v_~weak$$choice2~0_36) (= v_~x~0_17 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~z$w_buff1_used~0_70) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p2_EAX~0_13) (= 0 v_~weak$$choice0~0_11) (= (select .cse0 |v_ULTIMATE.start_main_~#t149~0.base_29|) 0) (= v_~z$r_buff1_thd1~0_9 0) (= v_~z$read_delayed_var~0.base_7 0) (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t149~0.base_29| 4) |v_#length_31|) (= (store |v_#memory_int_32| |v_ULTIMATE.start_main_~#t149~0.base_29| (store (select |v_#memory_int_32| |v_ULTIMATE.start_main_~#t149~0.base_29|) |v_ULTIMATE.start_main_~#t149~0.offset_21| 0)) |v_#memory_int_31|) (= 0 v_~z$r_buff1_thd3~0_27) (= v_~main$tmp_guard1~0_14 0) (= 0 v_~__unbuffered_p3_EBX~0_14) (= |v_#NULL.offset_4| 0) (= v_~z$mem_tmp~0_12 0) (= 0 v_~__unbuffered_p3_EAX~0_13) (= v_~y~0_11 0) (= 0 v_~z$w_buff0~0_39) (= v_~main$tmp_guard0~0_11 0) (= v_~z~0_29 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_32|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ULTIMATE.start_main_~#t151~0.offset=|v_ULTIMATE.start_main_~#t151~0.offset_17|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_9, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_19|, ~a~0=v_~a~0_11, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_77, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_13, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_13, ULTIMATE.start_main_~#t150~0.base=|v_ULTIMATE.start_main_~#t150~0.base_21|, ~z$mem_tmp~0=v_~z$mem_tmp~0_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_70, ~z$flush_delayed~0=v_~z$flush_delayed~0_17, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_11|, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_11|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_9, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25, ~x~0=v_~x~0_17, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_38, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_8|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_34, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t152~0.base=|v_ULTIMATE.start_main_~#t152~0.base_21|, ULTIMATE.start_main_~#t150~0.offset=|v_ULTIMATE.start_main_~#t150~0.offset_17|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_21, ULTIMATE.start_main_~#t149~0.base=|v_ULTIMATE.start_main_~#t149~0.base_29|, ~y~0=v_~y~0_11, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_10, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_132, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_13|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_11|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_14|, ULTIMATE.start_main_~#t152~0.offset=|v_ULTIMATE.start_main_~#t152~0.offset_17|, ULTIMATE.start_main_~#t151~0.base=|v_ULTIMATE.start_main_~#t151~0.base_20|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, ULTIMATE.start_main_~#t149~0.offset=|v_ULTIMATE.start_main_~#t149~0.offset_21|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_31|, ~z~0=v_~z~0_29, ~weak$$choice2~0=v_~weak$$choice2~0_36, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t151~0.offset, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t150~0.base, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t152~0.base, ULTIMATE.start_main_~#t150~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t149~0.base, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t152~0.offset, ULTIMATE.start_main_~#t151~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~#t149~0.offset, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 20:07:52,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] L856-1-->L858: Formula: (and (= (store |v_#valid_45| |v_ULTIMATE.start_main_~#t150~0.base_11| 1) |v_#valid_44|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t150~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t150~0.base_11|) |v_ULTIMATE.start_main_~#t150~0.offset_10| 1)) |v_#memory_int_19|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t150~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t150~0.offset_10|) (= (select |v_#valid_45| |v_ULTIMATE.start_main_~#t150~0.base_11|) 0) (not (= |v_ULTIMATE.start_main_~#t150~0.base_11| 0)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t150~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_20|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t150~0.offset=|v_ULTIMATE.start_main_~#t150~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_19|, #length=|v_#length_19|, ULTIMATE.start_main_~#t150~0.base=|v_ULTIMATE.start_main_~#t150~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t150~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t150~0.base] because there is no mapped edge [2019-12-18 20:07:52,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L858-1-->L860: Formula: (and (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t151~0.base_12| 1)) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t151~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t151~0.base_12|) |v_ULTIMATE.start_main_~#t151~0.offset_11| 2)) |v_#memory_int_21|) (not (= 0 |v_ULTIMATE.start_main_~#t151~0.base_12|)) (= (select |v_#valid_49| |v_ULTIMATE.start_main_~#t151~0.base_12|) 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t151~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t151~0.offset_11|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t151~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t151~0.base=|v_ULTIMATE.start_main_~#t151~0.base_12|, ULTIMATE.start_main_~#t151~0.offset=|v_ULTIMATE.start_main_~#t151~0.offset_11|, #valid=|v_#valid_48|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_21|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t151~0.base, ULTIMATE.start_main_~#t151~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-12-18 20:07:52,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] L860-1-->L862: Formula: (and (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t152~0.base_13| 1)) (= 0 (select |v_#valid_51| |v_ULTIMATE.start_main_~#t152~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t152~0.offset_11|) (not (= 0 |v_ULTIMATE.start_main_~#t152~0.base_13|)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t152~0.base_13|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t152~0.base_13| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t152~0.base_13|) |v_ULTIMATE.start_main_~#t152~0.offset_11| 3)) |v_#memory_int_23|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t152~0.base_13| 4) |v_#length_23|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t152~0.offset=|v_ULTIMATE.start_main_~#t152~0.offset_11|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_23|, #length=|v_#length_23|, ULTIMATE.start_main_~#t152~0.base=|v_ULTIMATE.start_main_~#t152~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t152~0.offset, ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, #length, ULTIMATE.start_main_~#t152~0.base] because there is no mapped edge [2019-12-18 20:07:52,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [907] [907] P3ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0~0_23 v_~z$w_buff1~0_18) (= 1 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_5|) (= v_~z$w_buff0_used~0_91 1) (= v_P3Thread1of1ForFork2_~arg.base_5 |v_P3Thread1of1ForFork2_#in~arg.base_5|) (= 1 v_~z$w_buff0~0_22) (= v_~z$w_buff0_used~0_92 v_~z$w_buff1_used~0_51) (= 0 (mod v_~z$w_buff1_used~0_51 256)) (= |v_P3Thread1of1ForFork2_#in~arg.offset_5| v_P3Thread1of1ForFork2_~arg.offset_5) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_7 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_5|)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_23, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_7, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_5, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_91, ~z$w_buff0~0=v_~z$w_buff0~0_22, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_51, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, ~z$w_buff1~0=v_~z$w_buff1~0_18, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_5|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_5, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-18 20:07:52,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L818-2-->L818-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-954474035 256))) (.cse0 (= |P3Thread1of1ForFork2_#t~ite28_Out-954474035| |P3Thread1of1ForFork2_#t~ite29_Out-954474035|)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-954474035 256)))) (or (and .cse0 (= |P3Thread1of1ForFork2_#t~ite28_Out-954474035| ~z$w_buff1~0_In-954474035) (or .cse1 .cse2)) (and (not .cse1) (= |P3Thread1of1ForFork2_#t~ite28_Out-954474035| ~z$w_buff0~0_In-954474035) .cse0 (not .cse2)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-954474035, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-954474035, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-954474035, ~z$w_buff1~0=~z$w_buff1~0_In-954474035} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-954474035|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-954474035|, ~z$w_buff0~0=~z$w_buff0~0_In-954474035, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-954474035, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-954474035, ~z$w_buff1~0=~z$w_buff1~0_In-954474035} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-18 20:07:52,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L823-->L824: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_29 256))) (= v_~z$r_buff0_thd4~0_51 v_~z$r_buff0_thd4~0_50)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_8|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_29} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-18 20:07:52,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L826-->L826-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-681531560 256) 0))) (or (and (not .cse0) (= ~z$mem_tmp~0_In-681531560 |P3Thread1of1ForFork2_#t~ite48_Out-681531560|)) (and .cse0 (= ~z~0_In-681531560 |P3Thread1of1ForFork2_#t~ite48_Out-681531560|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-681531560, ~z$flush_delayed~0=~z$flush_delayed~0_In-681531560, ~z~0=~z~0_In-681531560} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-681531560, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out-681531560|, ~z$flush_delayed~0=~z$flush_delayed~0_In-681531560, ~z~0=~z~0_In-681531560} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-18 20:07:52,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1024] [1024] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= v_P0Thread1of1ForFork3_~arg.base_4 |v_P0Thread1of1ForFork3_#in~arg.base_4|) (= 1 v_~a~0_6) (= |v_P0Thread1of1ForFork3_#in~arg.offset_4| v_P0Thread1of1ForFork3_~arg.offset_4) (= |v_P0Thread1of1ForFork3_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= 1 v_~x~0_8)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_4|} OutVars{~a~0=v_~a~0_6, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_4|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_4, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_5|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_4, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_4|, ~x~0=v_~x~0_8} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-18 20:07:52,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] P1ENTRY-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_4|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_4|) (= 2 v_~x~0_7) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~__unbuffered_p1_EAX~0_7 v_~y~0_5)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_4|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~y~0=v_~y~0_5} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_4|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_5, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-18 20:07:52,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-521552564 256) 0))) (or (and (= ~z$mem_tmp~0_In-521552564 |P2Thread1of1ForFork1_#t~ite25_Out-521552564|) (not .cse0)) (and (= |P2Thread1of1ForFork1_#t~ite25_Out-521552564| ~z~0_In-521552564) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-521552564, ~z$flush_delayed~0=~z$flush_delayed~0_In-521552564, ~z~0=~z~0_In-521552564} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-521552564, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out-521552564|, ~z$flush_delayed~0=~z$flush_delayed~0_In-521552564, ~z~0=~z~0_In-521552564} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-18 20:07:52,536 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L834-->L834-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In-1277022036 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1277022036 256)))) (or (and (= ~z$w_buff0_used~0_In-1277022036 |P3Thread1of1ForFork2_#t~ite51_Out-1277022036|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P3Thread1of1ForFork2_#t~ite51_Out-1277022036|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1277022036, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1277022036} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out-1277022036|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1277022036, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1277022036} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-18 20:07:52,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L835-->L835-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In476432550 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In476432550 256))) (.cse1 (= (mod ~z$r_buff0_thd4~0_In476432550 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In476432550 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork2_#t~ite52_Out476432550|)) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In476432550 |P3Thread1of1ForFork2_#t~ite52_Out476432550|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In476432550, ~z$w_buff0_used~0=~z$w_buff0_used~0_In476432550, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In476432550, ~z$w_buff1_used~0=~z$w_buff1_used~0_In476432550} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out476432550|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In476432550, ~z$w_buff0_used~0=~z$w_buff0_used~0_In476432550, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In476432550, ~z$w_buff1_used~0=~z$w_buff1_used~0_In476432550} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-18 20:07:52,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L836-->L837: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-657340744 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-657340744 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out-657340744 ~z$r_buff0_thd4~0_In-657340744)) (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd4~0_Out-657340744)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-657340744, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-657340744} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out-657340744|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-657340744, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-657340744} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-18 20:07:52,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L837-->L837-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1499320639 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In-1499320639 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1499320639 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-1499320639 256)))) (or (and (= ~z$r_buff1_thd4~0_In-1499320639 |P3Thread1of1ForFork2_#t~ite54_Out-1499320639|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork2_#t~ite54_Out-1499320639|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1499320639, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1499320639, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1499320639, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1499320639} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-1499320639|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1499320639, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1499320639, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1499320639, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1499320639} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-18 20:07:52,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1027] [1027] L837-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#t~ite54_8| v_~z$r_buff1_thd4~0_32) (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_7|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_32, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 20:07:52,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L788-2-->P2EXIT: Formula: (and (= 0 v_~z$flush_delayed~0_13) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= v_~z~0_23 |v_P2Thread1of1ForFork1_#t~ite25_8|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~z~0=v_~z~0_23, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 20:07:52,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [908] [908] L866-->L868-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= 0 (mod v_~z$r_buff0_thd0~0_14 256)) (= 0 (mod v_~z$w_buff0_used~0_93 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 20:07:52,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L868-2-->L868-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In52944691 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In52944691 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite59_Out52944691| |ULTIMATE.start_main_#t~ite60_Out52944691|))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite59_Out52944691| ~z$w_buff1~0_In52944691) .cse2) (and (= ~z~0_In52944691 |ULTIMATE.start_main_#t~ite59_Out52944691|) (or .cse0 .cse1) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In52944691, ~z$w_buff1_used~0=~z$w_buff1_used~0_In52944691, ~z$w_buff1~0=~z$w_buff1~0_In52944691, ~z~0=~z~0_In52944691} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out52944691|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In52944691, ~z$w_buff1_used~0=~z$w_buff1_used~0_In52944691, ~z$w_buff1~0=~z$w_buff1~0_In52944691, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out52944691|, ~z~0=~z~0_In52944691} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-18 20:07:52,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L869-->L869-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1094273190 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1094273190 256)))) (or (and (= ~z$w_buff0_used~0_In1094273190 |ULTIMATE.start_main_#t~ite61_Out1094273190|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite61_Out1094273190|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1094273190, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1094273190} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1094273190, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1094273190|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1094273190} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-18 20:07:52,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L870-->L870-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1094211064 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1094211064 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1094211064 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-1094211064 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite62_Out-1094211064| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite62_Out-1094211064| ~z$w_buff1_used~0_In-1094211064)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1094211064, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1094211064, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1094211064, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1094211064} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1094211064|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1094211064, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1094211064, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1094211064, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1094211064} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-18 20:07:52,542 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L871-->L871-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1050454553 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1050454553 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In1050454553 |ULTIMATE.start_main_#t~ite63_Out1050454553|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite63_Out1050454553|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1050454553, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1050454553} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1050454553|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1050454553, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1050454553} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-18 20:07:52,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L872-->L872-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1937208316 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In1937208316 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In1937208316 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1937208316 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite64_Out1937208316| ~z$r_buff1_thd0~0_In1937208316)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite64_Out1937208316| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1937208316, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1937208316, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1937208316, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1937208316} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1937208316, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1937208316, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1937208316, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1937208316, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out1937208316|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-18 20:07:52,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1044] [1044] L872-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p3_EAX~0_7) (= |v_ULTIMATE.start_main_#t~ite64_11| v_~z$r_buff1_thd0~0_15) (= v_~main$tmp_guard1~0_8 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= 0 v_~__unbuffered_p1_EAX~0_9) (= v_~__unbuffered_p2_EBX~0_8 0) (= v_~__unbuffered_p2_EAX~0_7 1) (= 0 v_~__unbuffered_p3_EBX~0_8) (= v_~x~0_11 2)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~x~0=v_~x~0_11, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_11|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_15, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~x~0=v_~x~0_11, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_10|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 20:07:52,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:07:52 BasicIcfg [2019-12-18 20:07:52,652 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:07:52,654 INFO L168 Benchmark]: Toolchain (without parser) took 170888.45 ms. Allocated memory was 144.7 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 100.6 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-18 20:07:52,655 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 20:07:52,655 INFO L168 Benchmark]: CACSL2BoogieTranslator took 835.52 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 100.4 MB in the beginning and 152.9 MB in the end (delta: -52.6 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-18 20:07:52,656 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.40 ms. Allocated memory is still 202.9 MB. Free memory was 152.9 MB in the beginning and 150.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 20:07:52,656 INFO L168 Benchmark]: Boogie Preprocessor took 45.98 ms. Allocated memory is still 202.9 MB. Free memory was 150.2 MB in the beginning and 147.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 20:07:52,657 INFO L168 Benchmark]: RCFGBuilder took 1013.90 ms. Allocated memory was 202.9 MB in the beginning and 234.9 MB in the end (delta: 32.0 MB). Free memory was 147.5 MB in the beginning and 205.7 MB in the end (delta: -58.2 MB). Peak memory consumption was 66.2 MB. Max. memory is 7.1 GB. [2019-12-18 20:07:52,658 INFO L168 Benchmark]: TraceAbstraction took 168900.82 ms. Allocated memory was 234.9 MB in the beginning and 3.9 GB in the end (delta: 3.6 GB). Free memory was 205.7 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-18 20:07:52,661 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.20 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 835.52 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 100.4 MB in the beginning and 152.9 MB in the end (delta: -52.6 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 82.40 ms. Allocated memory is still 202.9 MB. Free memory was 152.9 MB in the beginning and 150.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.98 ms. Allocated memory is still 202.9 MB. Free memory was 150.2 MB in the beginning and 147.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1013.90 ms. Allocated memory was 202.9 MB in the beginning and 234.9 MB in the end (delta: 32.0 MB). Free memory was 147.5 MB in the beginning and 205.7 MB in the end (delta: -58.2 MB). Peak memory consumption was 66.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 168900.82 ms. Allocated memory was 234.9 MB in the beginning and 3.9 GB in the end (delta: 3.6 GB). Free memory was 205.7 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.8s, 212 ProgramPointsBefore, 115 ProgramPointsAfterwards, 255 TransitionsBefore, 135 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 47 ConcurrentYvCompositions, 28 ChoiceCompositions, 10757 VarBasedMoverChecksPositive, 248 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 148368 CheckedPairsTotal, 129 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L856] FCALL, FORK 0 pthread_create(&t149, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] FCALL, FORK 0 pthread_create(&t150, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] FCALL, FORK 0 pthread_create(&t151, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] FCALL, FORK 0 pthread_create(&t152, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L807] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L808] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L809] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L810] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L811] 4 z$r_buff0_thd4 = (_Bool)1 [L814] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L815] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L816] 4 z$flush_delayed = weak$$choice2 [L817] 4 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L819] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L820] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L821] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L822] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L824] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 4 z = z$flush_delayed ? z$mem_tmp : z [L827] 4 z$flush_delayed = (_Bool)0 [L830] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L833] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 1 [L773] 3 __unbuffered_p2_EAX = y [L776] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L777] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L778] 3 z$flush_delayed = weak$$choice2 [L779] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L781] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L782] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L783] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L784] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L786] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L833] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L834] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L835] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L864] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L868] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L869] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L870] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L871] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 200 locations, 2 error locations. Result: UNSAFE, OverallTime: 168.5s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 48.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4859 SDtfs, 7738 SDslu, 11200 SDs, 0 SdLazy, 5357 SolverSat, 200 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 168 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149078occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 101.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 253019 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 702 NumberOfCodeBlocks, 702 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 616 ConstructedInterpolants, 0 QuantifiedInterpolants, 78704 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...