/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe009_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:22:30,595 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:22:30,598 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:22:30,616 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:22:30,616 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:22:30,618 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:22:30,620 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:22:30,621 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:22:30,623 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:22:30,624 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:22:30,625 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:22:30,626 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:22:30,626 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:22:30,627 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:22:30,628 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:22:30,629 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:22:30,630 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:22:30,631 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:22:30,633 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:22:30,635 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:22:30,638 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:22:30,639 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:22:30,640 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:22:30,641 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:22:30,643 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:22:30,644 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:22:30,644 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:22:30,645 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:22:30,645 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:22:30,647 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:22:30,648 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:22:30,648 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:22:30,649 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:22:30,650 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:22:30,651 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:22:30,651 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:22:30,652 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:22:30,652 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:22:30,652 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:22:30,653 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:22:30,653 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:22:30,654 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 22:22:30,673 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:22:30,674 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:22:30,676 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:22:30,677 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:22:30,677 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:22:30,677 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:22:30,677 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:22:30,678 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:22:30,678 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:22:30,678 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:22:30,679 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:22:30,679 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:22:30,679 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:22:30,679 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:22:30,679 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:22:30,680 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:22:30,680 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:22:30,680 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:22:30,680 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:22:30,680 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:22:30,681 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:22:30,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:22:30,682 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:22:30,683 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:22:30,683 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:22:30,683 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:22:30,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:22:30,684 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:22:30,684 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:22:30,684 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:22:30,685 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:22:30,685 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:22:30,956 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:22:30,972 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:22:30,975 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:22:30,977 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:22:30,978 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:22:30,978 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe009_rmo.opt.i [2019-12-27 22:22:31,042 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47009a756/94c1e381e9554db8af891d70ee0414de/FLAG520eda608 [2019-12-27 22:22:31,649 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:22:31,650 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe009_rmo.opt.i [2019-12-27 22:22:31,672 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47009a756/94c1e381e9554db8af891d70ee0414de/FLAG520eda608 [2019-12-27 22:22:31,878 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47009a756/94c1e381e9554db8af891d70ee0414de [2019-12-27 22:22:31,887 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:22:31,889 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:22:31,890 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:22:31,890 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:22:31,894 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:22:31,895 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:22:31" (1/1) ... [2019-12-27 22:22:31,898 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fdaac8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:22:31, skipping insertion in model container [2019-12-27 22:22:31,898 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:22:31" (1/1) ... [2019-12-27 22:22:31,906 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:22:31,963 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:22:32,514 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:22:32,531 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:22:32,602 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:22:32,678 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:22:32,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:22:32 WrapperNode [2019-12-27 22:22:32,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:22:32,680 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:22:32,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:22:32,680 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:22:32,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:22:32" (1/1) ... [2019-12-27 22:22:32,711 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:22:32" (1/1) ... [2019-12-27 22:22:32,746 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:22:32,747 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:22:32,747 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:22:32,747 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:22:32,756 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:22:32" (1/1) ... [2019-12-27 22:22:32,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:22:32" (1/1) ... [2019-12-27 22:22:32,763 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:22:32" (1/1) ... [2019-12-27 22:22:32,765 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:22:32" (1/1) ... [2019-12-27 22:22:32,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:22:32" (1/1) ... [2019-12-27 22:22:32,790 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:22:32" (1/1) ... [2019-12-27 22:22:32,794 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:22:32" (1/1) ... [2019-12-27 22:22:32,799 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:22:32,800 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:22:32,800 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:22:32,800 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:22:32,801 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:22:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:22:32,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-27 22:22:32,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:22:32,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:22:32,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:22:32,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:22:32,865 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:22:32,865 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:22:32,865 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:22:32,865 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:22:32,865 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 22:22:32,865 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 22:22:32,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-27 22:22:32,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:22:32,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:22:32,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:22:32,868 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 22:22:33,685 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:22:33,685 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-27 22:22:33,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:22:33 BoogieIcfgContainer [2019-12-27 22:22:33,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:22:33,689 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:22:33,689 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:22:33,692 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:22:33,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:22:31" (1/3) ... [2019-12-27 22:22:33,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dc27f9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:22:33, skipping insertion in model container [2019-12-27 22:22:33,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:22:32" (2/3) ... [2019-12-27 22:22:33,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dc27f9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:22:33, skipping insertion in model container [2019-12-27 22:22:33,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:22:33" (3/3) ... [2019-12-27 22:22:33,696 INFO L109 eAbstractionObserver]: Analyzing ICFG safe009_rmo.opt.i [2019-12-27 22:22:33,707 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:22:33,707 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:22:33,715 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-27 22:22:33,716 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:22:33,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,778 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,778 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,799 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,799 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,848 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,848 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,864 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,874 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,885 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,886 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,887 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,887 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,888 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,888 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,892 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,893 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:22:33,909 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-27 22:22:33,928 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:22:33,928 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:22:33,928 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:22:33,928 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:22:33,928 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:22:33,929 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:22:33,929 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:22:33,929 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:22:33,945 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 192 places, 230 transitions [2019-12-27 22:22:33,947 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 192 places, 230 transitions [2019-12-27 22:22:34,092 INFO L132 PetriNetUnfolder]: 48/227 cut-off events. [2019-12-27 22:22:34,092 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:22:34,113 INFO L76 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 227 events. 48/227 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 453 event pairs. 0/178 useless extension candidates. Maximal degree in co-relation 180. Up to 2 conditions per place. [2019-12-27 22:22:34,137 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 192 places, 230 transitions [2019-12-27 22:22:34,209 INFO L132 PetriNetUnfolder]: 48/227 cut-off events. [2019-12-27 22:22:34,209 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:22:34,222 INFO L76 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 227 events. 48/227 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 453 event pairs. 0/178 useless extension candidates. Maximal degree in co-relation 180. Up to 2 conditions per place. [2019-12-27 22:22:34,248 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19530 [2019-12-27 22:22:34,250 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:22:37,939 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-12-27 22:22:38,320 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2019-12-27 22:22:38,537 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-12-27 22:22:39,078 WARN L192 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 130 [2019-12-27 22:22:39,306 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-12-27 22:22:39,335 INFO L206 etLargeBlockEncoding]: Checked pairs total: 88636 [2019-12-27 22:22:39,335 INFO L214 etLargeBlockEncoding]: Total number of compositions: 138 [2019-12-27 22:22:39,339 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 91 places, 102 transitions [2019-12-27 22:22:53,329 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 104810 states. [2019-12-27 22:22:53,331 INFO L276 IsEmpty]: Start isEmpty. Operand 104810 states. [2019-12-27 22:22:53,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 22:22:53,410 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:53,411 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-27 22:22:53,412 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:53,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:53,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1065077504, now seen corresponding path program 1 times [2019-12-27 22:22:53,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:53,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346127937] [2019-12-27 22:22:53,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:53,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:53,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346127937] [2019-12-27 22:22:53,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:53,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:22:53,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [547921777] [2019-12-27 22:22:53,749 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:53,755 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:53,774 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 19 states and 18 transitions. [2019-12-27 22:22:53,775 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:53,779 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:22:53,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:22:53,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:53,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:22:53,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:22:53,794 INFO L87 Difference]: Start difference. First operand 104810 states. Second operand 3 states. [2019-12-27 22:22:56,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:56,343 INFO L93 Difference]: Finished difference Result 99038 states and 427322 transitions. [2019-12-27 22:22:56,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:22:56,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 22:22:56,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:59,420 INFO L225 Difference]: With dead ends: 99038 [2019-12-27 22:22:59,420 INFO L226 Difference]: Without dead ends: 93266 [2019-12-27 22:22:59,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:23:04,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93266 states. [2019-12-27 22:23:06,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93266 to 93266. [2019-12-27 22:23:06,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93266 states. [2019-12-27 22:23:07,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93266 states to 93266 states and 402362 transitions. [2019-12-27 22:23:07,244 INFO L78 Accepts]: Start accepts. Automaton has 93266 states and 402362 transitions. Word has length 18 [2019-12-27 22:23:07,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:07,245 INFO L462 AbstractCegarLoop]: Abstraction has 93266 states and 402362 transitions. [2019-12-27 22:23:07,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:23:07,245 INFO L276 IsEmpty]: Start isEmpty. Operand 93266 states and 402362 transitions. [2019-12-27 22:23:07,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 22:23:07,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:07,274 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:23:07,274 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:07,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:07,275 INFO L82 PathProgramCache]: Analyzing trace with hash 324321470, now seen corresponding path program 1 times [2019-12-27 22:23:07,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:07,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205459862] [2019-12-27 22:23:07,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:07,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:23:07,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205459862] [2019-12-27 22:23:07,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:07,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:23:07,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [422876681] [2019-12-27 22:23:07,457 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:07,462 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:07,465 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 19 transitions. [2019-12-27 22:23:07,465 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:07,465 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:23:07,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:23:07,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:07,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:23:07,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:23:07,470 INFO L87 Difference]: Start difference. First operand 93266 states and 402362 transitions. Second operand 4 states. [2019-12-27 22:23:07,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:07,747 INFO L93 Difference]: Finished difference Result 27758 states and 98270 transitions. [2019-12-27 22:23:07,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:23:07,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-27 22:23:07,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:07,823 INFO L225 Difference]: With dead ends: 27758 [2019-12-27 22:23:07,823 INFO L226 Difference]: Without dead ends: 21986 [2019-12-27 22:23:07,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:23:07,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21986 states. [2019-12-27 22:23:11,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21986 to 21986. [2019-12-27 22:23:11,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21986 states. [2019-12-27 22:23:11,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21986 states to 21986 states and 74330 transitions. [2019-12-27 22:23:11,731 INFO L78 Accepts]: Start accepts. Automaton has 21986 states and 74330 transitions. Word has length 19 [2019-12-27 22:23:11,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:11,731 INFO L462 AbstractCegarLoop]: Abstraction has 21986 states and 74330 transitions. [2019-12-27 22:23:11,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:23:11,732 INFO L276 IsEmpty]: Start isEmpty. Operand 21986 states and 74330 transitions. [2019-12-27 22:23:11,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 22:23:11,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:11,752 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] [2019-12-27 22:23:11,752 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:11,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:11,753 INFO L82 PathProgramCache]: Analyzing trace with hash -478398487, now seen corresponding path program 1 times [2019-12-27 22:23:11,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:11,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949898680] [2019-12-27 22:23:11,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:11,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:23:11,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949898680] [2019-12-27 22:23:11,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:11,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:23:11,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [78921773] [2019-12-27 22:23:11,875 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:11,881 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:11,889 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 49 transitions. [2019-12-27 22:23:11,889 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:11,892 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:23:11,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:23:11,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:11,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:23:11,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:23:11,893 INFO L87 Difference]: Start difference. First operand 21986 states and 74330 transitions. Second operand 3 states. [2019-12-27 22:23:12,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:12,078 INFO L93 Difference]: Finished difference Result 21662 states and 72918 transitions. [2019-12-27 22:23:12,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:23:12,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-27 22:23:12,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:12,192 INFO L225 Difference]: With dead ends: 21662 [2019-12-27 22:23:12,193 INFO L226 Difference]: Without dead ends: 21662 [2019-12-27 22:23:12,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:23:12,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21662 states. [2019-12-27 22:23:12,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21662 to 21662. [2019-12-27 22:23:12,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21662 states. [2019-12-27 22:23:12,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21662 states to 21662 states and 72918 transitions. [2019-12-27 22:23:12,637 INFO L78 Accepts]: Start accepts. Automaton has 21662 states and 72918 transitions. Word has length 29 [2019-12-27 22:23:12,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:12,638 INFO L462 AbstractCegarLoop]: Abstraction has 21662 states and 72918 transitions. [2019-12-27 22:23:12,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:23:12,638 INFO L276 IsEmpty]: Start isEmpty. Operand 21662 states and 72918 transitions. [2019-12-27 22:23:12,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 22:23:12,657 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:12,657 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:23:12,657 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:12,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:12,657 INFO L82 PathProgramCache]: Analyzing trace with hash 287114492, now seen corresponding path program 1 times [2019-12-27 22:23:12,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:12,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738169643] [2019-12-27 22:23:12,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:12,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:23:12,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738169643] [2019-12-27 22:23:12,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:12,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:23:12,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [459528397] [2019-12-27 22:23:12,773 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:12,780 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:12,792 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 52 transitions. [2019-12-27 22:23:12,792 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:12,794 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:23:12,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:23:12,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:12,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:23:12,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:23:12,796 INFO L87 Difference]: Start difference. First operand 21662 states and 72918 transitions. Second operand 5 states. [2019-12-27 22:23:12,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:12,894 INFO L93 Difference]: Finished difference Result 8282 states and 26196 transitions. [2019-12-27 22:23:12,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:23:12,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-27 22:23:12,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:12,911 INFO L225 Difference]: With dead ends: 8282 [2019-12-27 22:23:12,911 INFO L226 Difference]: Without dead ends: 7262 [2019-12-27 22:23:12,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-27 22:23:12,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7262 states. [2019-12-27 22:23:13,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7262 to 7262. [2019-12-27 22:23:13,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7262 states. [2019-12-27 22:23:13,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7262 states to 7262 states and 22848 transitions. [2019-12-27 22:23:13,275 INFO L78 Accepts]: Start accepts. Automaton has 7262 states and 22848 transitions. Word has length 30 [2019-12-27 22:23:13,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:13,276 INFO L462 AbstractCegarLoop]: Abstraction has 7262 states and 22848 transitions. [2019-12-27 22:23:13,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:23:13,276 INFO L276 IsEmpty]: Start isEmpty. Operand 7262 states and 22848 transitions. [2019-12-27 22:23:13,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 22:23:13,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:13,294 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] [2019-12-27 22:23:13,294 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:13,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:13,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1003841973, now seen corresponding path program 1 times [2019-12-27 22:23:13,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:13,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634642684] [2019-12-27 22:23:13,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:13,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:13,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:23:13,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634642684] [2019-12-27 22:23:13,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:13,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:23:13,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [774485844] [2019-12-27 22:23:13,427 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:13,437 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:13,458 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 51 states and 57 transitions. [2019-12-27 22:23:13,459 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:13,461 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:23:13,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:23:13,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:13,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:23:13,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:23:13,463 INFO L87 Difference]: Start difference. First operand 7262 states and 22848 transitions. Second operand 4 states. [2019-12-27 22:23:13,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:13,790 INFO L93 Difference]: Finished difference Result 9942 states and 30142 transitions. [2019-12-27 22:23:13,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:23:13,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 22:23:13,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:13,809 INFO L225 Difference]: With dead ends: 9942 [2019-12-27 22:23:13,810 INFO L226 Difference]: Without dead ends: 9942 [2019-12-27 22:23:13,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:23:13,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9942 states. [2019-12-27 22:23:14,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9942 to 8965. [2019-12-27 22:23:14,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8965 states. [2019-12-27 22:23:14,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8965 states to 8965 states and 27668 transitions. [2019-12-27 22:23:14,044 INFO L78 Accepts]: Start accepts. Automaton has 8965 states and 27668 transitions. Word has length 40 [2019-12-27 22:23:14,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:14,045 INFO L462 AbstractCegarLoop]: Abstraction has 8965 states and 27668 transitions. [2019-12-27 22:23:14,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:23:14,045 INFO L276 IsEmpty]: Start isEmpty. Operand 8965 states and 27668 transitions. [2019-12-27 22:23:14,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 22:23:14,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:14,063 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] [2019-12-27 22:23:14,063 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:14,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:14,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1779671156, now seen corresponding path program 1 times [2019-12-27 22:23:14,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:14,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496690906] [2019-12-27 22:23:14,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:14,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:23:14,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496690906] [2019-12-27 22:23:14,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:14,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:23:14,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1880051267] [2019-12-27 22:23:14,141 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:14,152 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:14,190 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 122 transitions. [2019-12-27 22:23:14,191 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:14,196 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 22:23:14,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:23:14,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:14,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:23:14,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:23:14,197 INFO L87 Difference]: Start difference. First operand 8965 states and 27668 transitions. Second operand 4 states. [2019-12-27 22:23:14,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:14,474 INFO L93 Difference]: Finished difference Result 11729 states and 35258 transitions. [2019-12-27 22:23:14,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:23:14,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 22:23:14,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:14,492 INFO L225 Difference]: With dead ends: 11729 [2019-12-27 22:23:14,492 INFO L226 Difference]: Without dead ends: 11729 [2019-12-27 22:23:14,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:23:14,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11729 states. [2019-12-27 22:23:14,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11729 to 9857. [2019-12-27 22:23:14,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9857 states. [2019-12-27 22:23:14,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9857 states to 9857 states and 30235 transitions. [2019-12-27 22:23:14,734 INFO L78 Accepts]: Start accepts. Automaton has 9857 states and 30235 transitions. Word has length 40 [2019-12-27 22:23:14,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:14,734 INFO L462 AbstractCegarLoop]: Abstraction has 9857 states and 30235 transitions. [2019-12-27 22:23:14,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:23:14,735 INFO L276 IsEmpty]: Start isEmpty. Operand 9857 states and 30235 transitions. [2019-12-27 22:23:14,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 22:23:14,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:14,759 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:23:14,759 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:14,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:14,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1394968114, now seen corresponding path program 1 times [2019-12-27 22:23:14,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:14,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929633516] [2019-12-27 22:23:14,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:14,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:23:14,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929633516] [2019-12-27 22:23:14,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:14,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:23:14,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [437551786] [2019-12-27 22:23:14,888 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:14,898 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:14,923 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 53 states and 60 transitions. [2019-12-27 22:23:14,924 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:14,924 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:23:14,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:23:14,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:14,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:23:14,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:23:14,925 INFO L87 Difference]: Start difference. First operand 9857 states and 30235 transitions. Second operand 6 states. [2019-12-27 22:23:15,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:15,025 INFO L93 Difference]: Finished difference Result 8932 states and 28069 transitions. [2019-12-27 22:23:15,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:23:15,026 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 22:23:15,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:15,042 INFO L225 Difference]: With dead ends: 8932 [2019-12-27 22:23:15,042 INFO L226 Difference]: Without dead ends: 8847 [2019-12-27 22:23:15,043 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-27 22:23:15,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8847 states. [2019-12-27 22:23:15,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8847 to 8847. [2019-12-27 22:23:15,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8847 states. [2019-12-27 22:23:15,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8847 states to 8847 states and 27881 transitions. [2019-12-27 22:23:15,347 INFO L78 Accepts]: Start accepts. Automaton has 8847 states and 27881 transitions. Word has length 41 [2019-12-27 22:23:15,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:15,348 INFO L462 AbstractCegarLoop]: Abstraction has 8847 states and 27881 transitions. [2019-12-27 22:23:15,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:23:15,348 INFO L276 IsEmpty]: Start isEmpty. Operand 8847 states and 27881 transitions. [2019-12-27 22:23:15,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 22:23:15,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:15,365 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] [2019-12-27 22:23:15,366 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:15,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:15,366 INFO L82 PathProgramCache]: Analyzing trace with hash 2142371198, now seen corresponding path program 1 times [2019-12-27 22:23:15,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:15,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831629099] [2019-12-27 22:23:15,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:15,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:23:15,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831629099] [2019-12-27 22:23:15,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:15,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:23:15,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2094126676] [2019-12-27 22:23:15,418 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:15,441 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:15,607 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 158 states and 235 transitions. [2019-12-27 22:23:15,607 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:15,624 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 22:23:15,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:23:15,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:15,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:23:15,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:23:15,626 INFO L87 Difference]: Start difference. First operand 8847 states and 27881 transitions. Second operand 4 states. [2019-12-27 22:23:15,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:15,987 INFO L93 Difference]: Finished difference Result 18761 states and 57572 transitions. [2019-12-27 22:23:15,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:23:15,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-12-27 22:23:15,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:16,015 INFO L225 Difference]: With dead ends: 18761 [2019-12-27 22:23:16,015 INFO L226 Difference]: Without dead ends: 18761 [2019-12-27 22:23:16,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:23:16,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18761 states. [2019-12-27 22:23:16,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18761 to 10425. [2019-12-27 22:23:16,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10425 states. [2019-12-27 22:23:16,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10425 states to 10425 states and 32444 transitions. [2019-12-27 22:23:16,220 INFO L78 Accepts]: Start accepts. Automaton has 10425 states and 32444 transitions. Word has length 60 [2019-12-27 22:23:16,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:16,220 INFO L462 AbstractCegarLoop]: Abstraction has 10425 states and 32444 transitions. [2019-12-27 22:23:16,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:23:16,220 INFO L276 IsEmpty]: Start isEmpty. Operand 10425 states and 32444 transitions. [2019-12-27 22:23:16,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 22:23:16,235 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:16,235 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] [2019-12-27 22:23:16,235 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:16,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:16,235 INFO L82 PathProgramCache]: Analyzing trace with hash -661405669, now seen corresponding path program 1 times [2019-12-27 22:23:16,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:16,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595630439] [2019-12-27 22:23:16,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:16,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:23:16,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595630439] [2019-12-27 22:23:16,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:16,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:23:16,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [976528453] [2019-12-27 22:23:16,321 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:16,344 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:16,612 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 153 states and 252 transitions. [2019-12-27 22:23:16,613 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:16,619 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:23:16,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:23:16,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:16,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:23:16,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:23:16,620 INFO L87 Difference]: Start difference. First operand 10425 states and 32444 transitions. Second operand 5 states. [2019-12-27 22:23:16,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:16,937 INFO L93 Difference]: Finished difference Result 13166 states and 39995 transitions. [2019-12-27 22:23:16,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:23:16,937 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-12-27 22:23:16,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:16,956 INFO L225 Difference]: With dead ends: 13166 [2019-12-27 22:23:16,956 INFO L226 Difference]: Without dead ends: 13166 [2019-12-27 22:23:16,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:23:16,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13166 states. [2019-12-27 22:23:17,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13166 to 9821. [2019-12-27 22:23:17,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9821 states. [2019-12-27 22:23:17,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9821 states to 9821 states and 29997 transitions. [2019-12-27 22:23:17,108 INFO L78 Accepts]: Start accepts. Automaton has 9821 states and 29997 transitions. Word has length 60 [2019-12-27 22:23:17,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:17,109 INFO L462 AbstractCegarLoop]: Abstraction has 9821 states and 29997 transitions. [2019-12-27 22:23:17,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:23:17,109 INFO L276 IsEmpty]: Start isEmpty. Operand 9821 states and 29997 transitions. [2019-12-27 22:23:17,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-27 22:23:17,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:17,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:23:17,122 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:17,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:17,122 INFO L82 PathProgramCache]: Analyzing trace with hash -766696375, now seen corresponding path program 1 times [2019-12-27 22:23:17,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:17,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220343945] [2019-12-27 22:23:17,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:17,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:23:17,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220343945] [2019-12-27 22:23:17,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:17,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:23:17,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [255679744] [2019-12-27 22:23:17,233 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:17,257 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:17,366 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 124 states and 187 transitions. [2019-12-27 22:23:17,366 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:17,370 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 22:23:17,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:23:17,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:17,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:23:17,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:23:17,371 INFO L87 Difference]: Start difference. First operand 9821 states and 29997 transitions. Second operand 5 states. [2019-12-27 22:23:17,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:17,961 INFO L93 Difference]: Finished difference Result 13742 states and 41245 transitions. [2019-12-27 22:23:17,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:23:17,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-12-27 22:23:17,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:17,980 INFO L225 Difference]: With dead ends: 13742 [2019-12-27 22:23:17,980 INFO L226 Difference]: Without dead ends: 13742 [2019-12-27 22:23:17,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:23:18,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13742 states. [2019-12-27 22:23:18,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13742 to 10061. [2019-12-27 22:23:18,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10061 states. [2019-12-27 22:23:18,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10061 states to 10061 states and 30773 transitions. [2019-12-27 22:23:18,153 INFO L78 Accepts]: Start accepts. Automaton has 10061 states and 30773 transitions. Word has length 61 [2019-12-27 22:23:18,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:18,154 INFO L462 AbstractCegarLoop]: Abstraction has 10061 states and 30773 transitions. [2019-12-27 22:23:18,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:23:18,154 INFO L276 IsEmpty]: Start isEmpty. Operand 10061 states and 30773 transitions. [2019-12-27 22:23:18,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-27 22:23:18,165 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:18,165 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] [2019-12-27 22:23:18,165 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:18,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:18,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1120182021, now seen corresponding path program 2 times [2019-12-27 22:23:18,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:18,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380758139] [2019-12-27 22:23:18,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:18,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:18,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:23:18,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380758139] [2019-12-27 22:23:18,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:18,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:23:18,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [386902162] [2019-12-27 22:23:18,250 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:18,271 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:18,464 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 159 states and 280 transitions. [2019-12-27 22:23:18,464 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:18,508 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 22:23:18,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:23:18,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:18,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:23:18,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:23:18,510 INFO L87 Difference]: Start difference. First operand 10061 states and 30773 transitions. Second operand 5 states. [2019-12-27 22:23:18,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:18,647 INFO L93 Difference]: Finished difference Result 13355 states and 40354 transitions. [2019-12-27 22:23:18,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:23:18,648 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-12-27 22:23:18,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:18,664 INFO L225 Difference]: With dead ends: 13355 [2019-12-27 22:23:18,664 INFO L226 Difference]: Without dead ends: 13355 [2019-12-27 22:23:18,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:23:18,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13355 states. [2019-12-27 22:23:18,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13355 to 8777. [2019-12-27 22:23:18,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8777 states. [2019-12-27 22:23:18,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8777 states to 8777 states and 26910 transitions. [2019-12-27 22:23:18,812 INFO L78 Accepts]: Start accepts. Automaton has 8777 states and 26910 transitions. Word has length 61 [2019-12-27 22:23:18,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:18,812 INFO L462 AbstractCegarLoop]: Abstraction has 8777 states and 26910 transitions. [2019-12-27 22:23:18,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:23:18,812 INFO L276 IsEmpty]: Start isEmpty. Operand 8777 states and 26910 transitions. [2019-12-27 22:23:18,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-27 22:23:18,822 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:18,822 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] [2019-12-27 22:23:18,822 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:18,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:18,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1050033043, now seen corresponding path program 1 times [2019-12-27 22:23:18,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:18,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336475669] [2019-12-27 22:23:18,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:18,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:23:18,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336475669] [2019-12-27 22:23:18,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:18,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:23:18,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [881593239] [2019-12-27 22:23:18,898 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:19,027 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:19,277 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 160 states and 260 transitions. [2019-12-27 22:23:19,278 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:19,281 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:23:19,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:23:19,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:19,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:23:19,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:23:19,282 INFO L87 Difference]: Start difference. First operand 8777 states and 26910 transitions. Second operand 3 states. [2019-12-27 22:23:19,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:19,326 INFO L93 Difference]: Finished difference Result 8776 states and 26908 transitions. [2019-12-27 22:23:19,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:23:19,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-12-27 22:23:19,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:19,343 INFO L225 Difference]: With dead ends: 8776 [2019-12-27 22:23:19,343 INFO L226 Difference]: Without dead ends: 8776 [2019-12-27 22:23:19,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:23:19,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8776 states. [2019-12-27 22:23:19,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8776 to 8776. [2019-12-27 22:23:19,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8776 states. [2019-12-27 22:23:19,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8776 states to 8776 states and 26908 transitions. [2019-12-27 22:23:19,513 INFO L78 Accepts]: Start accepts. Automaton has 8776 states and 26908 transitions. Word has length 61 [2019-12-27 22:23:19,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:19,513 INFO L462 AbstractCegarLoop]: Abstraction has 8776 states and 26908 transitions. [2019-12-27 22:23:19,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:23:19,513 INFO L276 IsEmpty]: Start isEmpty. Operand 8776 states and 26908 transitions. [2019-12-27 22:23:19,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 22:23:19,526 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:19,526 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] [2019-12-27 22:23:19,526 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:19,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:19,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1808783175, now seen corresponding path program 1 times [2019-12-27 22:23:19,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:19,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301122811] [2019-12-27 22:23:19,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:19,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:19,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:23:19,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301122811] [2019-12-27 22:23:19,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:19,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:23:19,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1950547542] [2019-12-27 22:23:19,665 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:19,689 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:20,128 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 161 states and 261 transitions. [2019-12-27 22:23:20,128 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:20,136 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:23:20,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:23:20,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:20,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:23:20,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:23:20,140 INFO L87 Difference]: Start difference. First operand 8776 states and 26908 transitions. Second operand 6 states. [2019-12-27 22:23:20,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:20,593 INFO L93 Difference]: Finished difference Result 12692 states and 37867 transitions. [2019-12-27 22:23:20,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 22:23:20,594 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-27 22:23:20,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:20,611 INFO L225 Difference]: With dead ends: 12692 [2019-12-27 22:23:20,612 INFO L226 Difference]: Without dead ends: 12692 [2019-12-27 22:23:20,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:23:20,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12692 states. [2019-12-27 22:23:20,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12692 to 9816. [2019-12-27 22:23:20,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9816 states. [2019-12-27 22:23:20,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9816 states to 9816 states and 30004 transitions. [2019-12-27 22:23:20,758 INFO L78 Accepts]: Start accepts. Automaton has 9816 states and 30004 transitions. Word has length 62 [2019-12-27 22:23:20,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:20,759 INFO L462 AbstractCegarLoop]: Abstraction has 9816 states and 30004 transitions. [2019-12-27 22:23:20,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:23:20,759 INFO L276 IsEmpty]: Start isEmpty. Operand 9816 states and 30004 transitions. [2019-12-27 22:23:20,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 22:23:20,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:20,773 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] [2019-12-27 22:23:20,773 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:20,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:20,773 INFO L82 PathProgramCache]: Analyzing trace with hash -483078087, now seen corresponding path program 1 times [2019-12-27 22:23:20,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:20,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766423355] [2019-12-27 22:23:20,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:20,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:20,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:23:20,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766423355] [2019-12-27 22:23:20,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:20,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:23:20,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [278865203] [2019-12-27 22:23:20,847 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:20,869 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:21,025 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 128 states and 193 transitions. [2019-12-27 22:23:21,026 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:21,027 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:23:21,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:23:21,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:21,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:23:21,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:23:21,027 INFO L87 Difference]: Start difference. First operand 9816 states and 30004 transitions. Second operand 3 states. [2019-12-27 22:23:21,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:21,067 INFO L93 Difference]: Finished difference Result 9696 states and 29370 transitions. [2019-12-27 22:23:21,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:23:21,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-27 22:23:21,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:21,079 INFO L225 Difference]: With dead ends: 9696 [2019-12-27 22:23:21,079 INFO L226 Difference]: Without dead ends: 9696 [2019-12-27 22:23:21,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:23:21,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9696 states. [2019-12-27 22:23:21,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9696 to 9128. [2019-12-27 22:23:21,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9128 states. [2019-12-27 22:23:21,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9128 states to 9128 states and 27716 transitions. [2019-12-27 22:23:21,200 INFO L78 Accepts]: Start accepts. Automaton has 9128 states and 27716 transitions. Word has length 63 [2019-12-27 22:23:21,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:21,200 INFO L462 AbstractCegarLoop]: Abstraction has 9128 states and 27716 transitions. [2019-12-27 22:23:21,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:23:21,200 INFO L276 IsEmpty]: Start isEmpty. Operand 9128 states and 27716 transitions. [2019-12-27 22:23:21,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 22:23:21,210 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:21,210 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] [2019-12-27 22:23:21,210 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:21,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:21,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1295210882, now seen corresponding path program 1 times [2019-12-27 22:23:21,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:21,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208502967] [2019-12-27 22:23:21,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:21,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:21,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:23:21,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208502967] [2019-12-27 22:23:21,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:21,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:23:21,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2093173681] [2019-12-27 22:23:21,301 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:21,323 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:21,776 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 225 states and 438 transitions. [2019-12-27 22:23:21,776 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:21,782 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:23:21,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:23:21,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:21,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:23:21,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:23:21,783 INFO L87 Difference]: Start difference. First operand 9128 states and 27716 transitions. Second operand 3 states. [2019-12-27 22:23:21,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:21,818 INFO L93 Difference]: Finished difference Result 8936 states and 26938 transitions. [2019-12-27 22:23:21,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:23:21,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-27 22:23:21,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:21,828 INFO L225 Difference]: With dead ends: 8936 [2019-12-27 22:23:21,829 INFO L226 Difference]: Without dead ends: 8936 [2019-12-27 22:23:21,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:23:21,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8936 states. [2019-12-27 22:23:21,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8936 to 7672. [2019-12-27 22:23:21,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7672 states. [2019-12-27 22:23:21,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7672 states to 7672 states and 23246 transitions. [2019-12-27 22:23:21,942 INFO L78 Accepts]: Start accepts. Automaton has 7672 states and 23246 transitions. Word has length 63 [2019-12-27 22:23:21,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:21,943 INFO L462 AbstractCegarLoop]: Abstraction has 7672 states and 23246 transitions. [2019-12-27 22:23:21,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:23:21,943 INFO L276 IsEmpty]: Start isEmpty. Operand 7672 states and 23246 transitions. [2019-12-27 22:23:21,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 22:23:21,950 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:21,950 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] [2019-12-27 22:23:21,950 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:21,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:21,951 INFO L82 PathProgramCache]: Analyzing trace with hash -2099628456, now seen corresponding path program 1 times [2019-12-27 22:23:21,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:21,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394320416] [2019-12-27 22:23:21,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:22,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:22,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:23:22,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394320416] [2019-12-27 22:23:22,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:22,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:23:22,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1226272907] [2019-12-27 22:23:22,122 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:22,145 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:22,349 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 280 transitions. [2019-12-27 22:23:22,349 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:22,350 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:23:22,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:23:22,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:22,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:23:22,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:23:22,351 INFO L87 Difference]: Start difference. First operand 7672 states and 23246 transitions. Second operand 5 states. [2019-12-27 22:23:22,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:22,518 INFO L93 Difference]: Finished difference Result 13850 states and 41832 transitions. [2019-12-27 22:23:22,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:23:22,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-27 22:23:22,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:22,530 INFO L225 Difference]: With dead ends: 13850 [2019-12-27 22:23:22,530 INFO L226 Difference]: Without dead ends: 6717 [2019-12-27 22:23:22,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:23:22,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6717 states. [2019-12-27 22:23:22,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6717 to 6717. [2019-12-27 22:23:22,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6717 states. [2019-12-27 22:23:22,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6717 states to 6717 states and 20169 transitions. [2019-12-27 22:23:22,625 INFO L78 Accepts]: Start accepts. Automaton has 6717 states and 20169 transitions. Word has length 64 [2019-12-27 22:23:22,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:22,625 INFO L462 AbstractCegarLoop]: Abstraction has 6717 states and 20169 transitions. [2019-12-27 22:23:22,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:23:22,625 INFO L276 IsEmpty]: Start isEmpty. Operand 6717 states and 20169 transitions. [2019-12-27 22:23:22,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 22:23:22,632 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:22,632 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] [2019-12-27 22:23:22,633 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:22,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:22,633 INFO L82 PathProgramCache]: Analyzing trace with hash 229338624, now seen corresponding path program 2 times [2019-12-27 22:23:22,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:22,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221649021] [2019-12-27 22:23:22,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:22,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:23:22,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221649021] [2019-12-27 22:23:22,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:22,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:23:22,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [475985743] [2019-12-27 22:23:22,720 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:22,743 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:22,987 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 169 states and 278 transitions. [2019-12-27 22:23:22,987 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:22,989 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:23:22,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:23:22,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:22,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:23:22,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:23:22,990 INFO L87 Difference]: Start difference. First operand 6717 states and 20169 transitions. Second operand 4 states. [2019-12-27 22:23:23,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:23,031 INFO L93 Difference]: Finished difference Result 8182 states and 24153 transitions. [2019-12-27 22:23:23,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:23:23,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-27 22:23:23,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:23,034 INFO L225 Difference]: With dead ends: 8182 [2019-12-27 22:23:23,034 INFO L226 Difference]: Without dead ends: 1935 [2019-12-27 22:23:23,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:23:23,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2019-12-27 22:23:23,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1935. [2019-12-27 22:23:23,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-12-27 22:23:23,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 5238 transitions. [2019-12-27 22:23:23,058 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 5238 transitions. Word has length 64 [2019-12-27 22:23:23,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:23,058 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 5238 transitions. [2019-12-27 22:23:23,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:23:23,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 5238 transitions. [2019-12-27 22:23:23,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 22:23:23,061 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:23,061 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] [2019-12-27 22:23:23,061 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:23,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:23,061 INFO L82 PathProgramCache]: Analyzing trace with hash 944078778, now seen corresponding path program 3 times [2019-12-27 22:23:23,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:23,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868592944] [2019-12-27 22:23:23,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:23:23,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:23:23,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868592944] [2019-12-27 22:23:23,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:23:23,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 22:23:23,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2114814124] [2019-12-27 22:23:23,756 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:23:23,777 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:23:24,145 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 141 states and 212 transitions. [2019-12-27 22:23:24,146 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:23:24,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:23:24,321 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 22:23:24,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 22:23:24,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:23:24,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 22:23:24,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2019-12-27 22:23:24,322 INFO L87 Difference]: Start difference. First operand 1935 states and 5238 transitions. Second operand 21 states. [2019-12-27 22:23:26,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:23:26,504 INFO L93 Difference]: Finished difference Result 4715 states and 13043 transitions. [2019-12-27 22:23:26,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 22:23:26,504 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2019-12-27 22:23:26,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:23:26,510 INFO L225 Difference]: With dead ends: 4715 [2019-12-27 22:23:26,510 INFO L226 Difference]: Without dead ends: 3934 [2019-12-27 22:23:26,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 13 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=311, Invalid=1581, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 22:23:26,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3934 states. [2019-12-27 22:23:26,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3934 to 2571. [2019-12-27 22:23:26,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2571 states. [2019-12-27 22:23:26,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 6956 transitions. [2019-12-27 22:23:26,552 INFO L78 Accepts]: Start accepts. Automaton has 2571 states and 6956 transitions. Word has length 64 [2019-12-27 22:23:26,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:23:26,552 INFO L462 AbstractCegarLoop]: Abstraction has 2571 states and 6956 transitions. [2019-12-27 22:23:26,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 22:23:26,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 6956 transitions. [2019-12-27 22:23:26,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 22:23:26,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:23:26,555 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:23:26,555 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:23:26,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:23:26,555 INFO L82 PathProgramCache]: Analyzing trace with hash -750162950, now seen corresponding path program 4 times [2019-12-27 22:23:26,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:23:26,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298569631] [2019-12-27 22:23:26,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:23:26,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:23:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:23:26,715 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:23:26,715 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:23:26,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] ULTIMATE.startENTRY-->L825: Formula: (let ((.cse1 (store |v_#valid_75| 0 0))) (let ((.cse0 (store .cse1 |v_~#x~0.base_30| 1))) (and (= v_~__unbuffered_p1_EAX$r_buff0_thd3~0_8 0) (= 0 v_~__unbuffered_cnt~0_17) (= 0 v_~x$r_buff0_thd1~0_22) (= v_~__unbuffered_p0_EAX~0_9 0) (= |v_~#x~0.offset_30| 0) (= v_~__unbuffered_p1_EAX$r_buff1_thd3~0_7 0) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff1_thd1~0_18 0) (= v_~x$r_buff1_thd2~0_53 0) (= v_~__unbuffered_p1_EAX$w_buff1_used~0_8 0) (= 0 v_~x$read_delayed~0_7) (= v_~__unbuffered_p1_EAX$r_buff1_thd0~0_8 0) (= 0 v_~x$r_buff0_thd2~0_82) (= v_~x$flush_delayed~0_12 0) (= 0 (select (select |v_#memory_int_62| |v_~#x~0.base_30|) |v_~#x~0.offset_30|)) (= v_~__unbuffered_p1_EAX$w_buff0~0_8 0) (= v_~x$mem_tmp~0_11 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~x$r_buff1_thd0~0_19 0) (= (store (store |v_#length_37| |v_~#x~0.base_30| 4) |v_ULTIMATE.start_main_~#t2000~0.base_24| 4) |v_#length_36|) (= 0 v_~__unbuffered_p1_EAX~0_16) (= v_~x$r_buff1_thd3~0_16 0) (= v_~__unbuffered_p1_EAX$r_buff0_thd1~0_8 0) (= 0 v_~x$r_buff0_thd0~0_27) (= v_~x$w_buff1_used~0_75 0) (= 0 v_~x$w_buff0_used~0_119) (= v_~__unbuffered_p1_EAX$w_buff1~0_8 0) (= v_~__unbuffered_p1_EAX$r_buff0_thd0~0_7 0) (= 0 v_~weak$$choice0~0_9) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2000~0.base_24|)) (< 0 |v_#StackHeapBarrier_22|) (= 0 v_~x$w_buff1~0_26) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t2000~0.base_24|) (= 0 v_~x$r_buff0_thd3~0_22) (= v_~main$tmp_guard0~0_12 0) (= v_~__unbuffered_p1_EAX$r_buff0_thd2~0_8 0) (= v_~__unbuffered_p1_EAX$flush_delayed~0_8 0) (= v_~__unbuffered_p1_EAX$r_buff1_thd2~0_8 0) (= v_~y~0_16 0) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_12 0) (= v_~__unbuffered_p1_EAX$r_buff1_thd1~0_8 0) (= 0 v_~weak$$choice2~0_38) (= 0 |v_#NULL.base_4|) (= 0 |v_ULTIMATE.start_main_~#t2000~0.offset_18|) (= 0 v_~x$w_buff0~0_27) (= v_~__unbuffered_p1_EAX$read_delayed~0_12 0) (= v_~__unbuffered_p1_EAX$w_buff0_used~0_7 0) (= v_~main$tmp_guard1~0_14 0) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.base_12 0) (< |v_#StackHeapBarrier_22| |v_~#x~0.base_30|) (= |v_#NULL.offset_4| 0) (= 0 v_~weak$$choice1~0_13) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t2000~0.base_24| 1)) (= 0 (select .cse1 |v_~#x~0.base_30|)) (= (store |v_#memory_int_62| |v_ULTIMATE.start_main_~#t2000~0.base_24| (store (select |v_#memory_int_62| |v_ULTIMATE.start_main_~#t2000~0.base_24|) |v_ULTIMATE.start_main_~#t2000~0.offset_18| 0)) |v_#memory_int_61|) (= 0 v_~__unbuffered_p1_EAX$mem_tmp~0_8)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_62|, #length=|v_#length_37|} OutVars{ULTIMATE.start_main_#t~nondet53=|v_ULTIMATE.start_main_#t~nondet53_8|, ~x$w_buff0~0=v_~x$w_buff0~0_27, ULTIMATE.start_main_#t~nondet51=|v_ULTIMATE.start_main_#t~nondet51_10|, ~__unbuffered_p1_EAX$r_buff0_thd0~0=v_~__unbuffered_p1_EAX$r_buff0_thd0~0_7, ~__unbuffered_p1_EAX$r_buff1_thd2~0=v_~__unbuffered_p1_EAX$r_buff1_thd2~0_8, ~x$flush_delayed~0=v_~x$flush_delayed~0_12, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_18, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_16|, ~weak$$choice1~0=v_~weak$$choice1~0_13, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~__unbuffered_p1_EAX$w_buff0~0=v_~__unbuffered_p1_EAX$w_buff0~0_8, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_12, #length=|v_#length_36|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_27, ULTIMATE.start_main_#t~mem54=|v_ULTIMATE.start_main_#t~mem54_10|, ~__unbuffered_p1_EAX$r_buff0_thd1~0=v_~__unbuffered_p1_EAX$r_buff0_thd1~0_8, ~#x~0.offset=|v_~#x~0.offset_30|, ~x$w_buff1~0=v_~x$w_buff1~0_26, ~__unbuffered_p1_EAX$r_buff1_thd3~0=v_~__unbuffered_p1_EAX$r_buff1_thd3~0_7, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_11|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_75, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_53, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_14|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_16|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ~__unbuffered_p1_EAX$w_buff1_used~0=v_~__unbuffered_p1_EAX$w_buff1_used~0_8, ~__unbuffered_p1_EAX$w_buff1~0=v_~__unbuffered_p1_EAX$w_buff1~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, ~__unbuffered_p1_EAX$r_buff0_thd2~0=v_~__unbuffered_p1_EAX$r_buff0_thd2~0_8, ~__unbuffered_p1_EAX$r_buff1_thd0~0=v_~__unbuffered_p1_EAX$r_buff1_thd0~0_8, ~__unbuffered_p1_EAX$flush_delayed~0=v_~__unbuffered_p1_EAX$flush_delayed~0_8, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ULTIMATE.start_main_#t~nondet52=|v_ULTIMATE.start_main_#t~nondet52_9|, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_12, ULTIMATE.start_main_#t~mem62=|v_ULTIMATE.start_main_#t~mem62_12|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_~#t2002~0.offset=|v_ULTIMATE.start_main_~#t2002~0.offset_17|, ~__unbuffered_p1_EAX$mem_tmp~0=v_~__unbuffered_p1_EAX$mem_tmp~0_8, ULTIMATE.start_main_~#t2000~0.base=|v_ULTIMATE.start_main_~#t2000~0.base_24|, ~y~0=v_~y~0_16, ~__unbuffered_p1_EAX$r_buff0_thd3~0=v_~__unbuffered_p1_EAX$r_buff0_thd3~0_8, ~__unbuffered_p1_EAX$r_buff1_thd1~0=v_~__unbuffered_p1_EAX$r_buff1_thd1~0_8, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_11|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_12, ULTIMATE.start_main_~#t2001~0.offset=|v_ULTIMATE.start_main_~#t2001~0.offset_16|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12, ULTIMATE.start_main_~#t2001~0.base=|v_ULTIMATE.start_main_~#t2001~0.base_21|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_19, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_82, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_13|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_13|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_119, ~__unbuffered_p1_EAX$w_buff0_used~0=v_~__unbuffered_p1_EAX$w_buff0_used~0_7, ULTIMATE.start_main_~#t2002~0.base=|v_ULTIMATE.start_main_~#t2002~0.base_21|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_15|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_61|, ~#x~0.base=|v_~#x~0.base_30|, ~weak$$choice2~0=v_~weak$$choice2~0_38, ULTIMATE.start_main_~#t2000~0.offset=|v_ULTIMATE.start_main_~#t2000~0.offset_18|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet53, ~x$w_buff0~0, ULTIMATE.start_main_#t~nondet51, ~__unbuffered_p1_EAX$r_buff0_thd0~0, ~__unbuffered_p1_EAX$r_buff1_thd2~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite64, ~weak$$choice1~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~__unbuffered_p1_EAX$w_buff0~0, ~__unbuffered_p1_EAX$read_delayed_var~0.base, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~mem54, ~__unbuffered_p1_EAX$r_buff0_thd1~0, ~#x~0.offset, ~x$w_buff1~0, ~__unbuffered_p1_EAX$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite58, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite56, ~x$read_delayed_var~0.base, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ~__unbuffered_p1_EAX$w_buff1_used~0, ~__unbuffered_p1_EAX$w_buff1~0, ~__unbuffered_cnt~0, ~__unbuffered_p1_EAX$r_buff0_thd2~0, ~__unbuffered_p1_EAX$r_buff1_thd0~0, ~__unbuffered_p1_EAX$flush_delayed~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet52, ~__unbuffered_p1_EAX$read_delayed~0, ULTIMATE.start_main_#t~mem62, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_~#t2002~0.offset, ~__unbuffered_p1_EAX$mem_tmp~0, ULTIMATE.start_main_~#t2000~0.base, ~y~0, ~__unbuffered_p1_EAX$r_buff0_thd3~0, ~__unbuffered_p1_EAX$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite57, ~__unbuffered_p1_EAX$read_delayed_var~0.offset, ULTIMATE.start_main_~#t2001~0.offset, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2001~0.base, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet61, #NULL.base, ULTIMATE.start_main_#t~ite55, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX$w_buff0_used~0, ULTIMATE.start_main_~#t2002~0.base, ULTIMATE.start_main_#t~ite60, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~#x~0.base, ~weak$$choice2~0, ULTIMATE.start_main_~#t2000~0.offset, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 22:23:26,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [903] [903] L825-1-->L827: Formula: (and (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2001~0.base_9|)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2001~0.base_9| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t2001~0.base_9|)) (= (store |v_#memory_int_48| |v_ULTIMATE.start_main_~#t2001~0.base_9| (store (select |v_#memory_int_48| |v_ULTIMATE.start_main_~#t2001~0.base_9|) |v_ULTIMATE.start_main_~#t2001~0.offset_8| 1)) |v_#memory_int_47|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2001~0.base_9|) (= |v_ULTIMATE.start_main_~#t2001~0.offset_8| 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t2001~0.base_9| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_48|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet51=|v_ULTIMATE.start_main_#t~nondet51_5|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_47|, ULTIMATE.start_main_~#t2001~0.offset=|v_ULTIMATE.start_main_~#t2001~0.offset_8|, #length=|v_#length_19|, ULTIMATE.start_main_~#t2001~0.base=|v_ULTIMATE.start_main_~#t2001~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet51, #valid, #memory_int, ULTIMATE.start_main_~#t2001~0.offset, #length, ULTIMATE.start_main_~#t2001~0.base] because there is no mapped edge [2019-12-27 22:23:26,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L827-1-->L829: Formula: (and (= |v_ULTIMATE.start_main_~#t2002~0.offset_11| 0) (= (store |v_#memory_int_52| |v_ULTIMATE.start_main_~#t2002~0.base_13| (store (select |v_#memory_int_52| |v_ULTIMATE.start_main_~#t2002~0.base_13|) |v_ULTIMATE.start_main_~#t2002~0.offset_11| 2)) |v_#memory_int_51|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2002~0.base_13| 4)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t2002~0.base_13|) (= (select |v_#valid_44| |v_ULTIMATE.start_main_~#t2002~0.base_13|) 0) (= |v_#valid_43| (store |v_#valid_44| |v_ULTIMATE.start_main_~#t2002~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t2002~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_52|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t2002~0.base=|v_ULTIMATE.start_main_~#t2002~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet52=|v_ULTIMATE.start_main_#t~nondet52_5|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_51|, ULTIMATE.start_main_~#t2002~0.offset=|v_ULTIMATE.start_main_~#t2002~0.offset_11|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2002~0.base, ULTIMATE.start_main_#t~nondet52, #valid, #memory_int, ULTIMATE.start_main_~#t2002~0.offset, #length] because there is no mapped edge [2019-12-27 22:23:26,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L769-->L770: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~x$w_buff0~0_17 v_~x$w_buff0~0_16)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_17, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_16, P1Thread1of1ForFork0_#t~ite16=|v_P1Thread1of1ForFork0_#t~ite16_8|, ~weak$$choice2~0=v_~weak$$choice2~0_25, P1Thread1of1ForFork0_#t~ite18=|v_P1Thread1of1ForFork0_#t~ite18_8|, P1Thread1of1ForFork0_#t~ite17=|v_P1Thread1of1ForFork0_#t~ite17_9|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0_#t~ite16, P1Thread1of1ForFork0_#t~ite18, P1Thread1of1ForFork0_#t~ite17] because there is no mapped edge [2019-12-27 22:23:26,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L770-->L771: Formula: (and (= v_~x$w_buff1~0_17 v_~x$w_buff1~0_16) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$w_buff1~0=v_~x$w_buff1~0_17, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P1Thread1of1ForFork0_#t~ite19=|v_P1Thread1of1ForFork0_#t~ite19_8|, P1Thread1of1ForFork0_#t~ite20=|v_P1Thread1of1ForFork0_#t~ite20_9|, P1Thread1of1ForFork0_#t~ite21=|v_P1Thread1of1ForFork0_#t~ite21_9|, ~x$w_buff1~0=v_~x$w_buff1~0_16, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite19, P1Thread1of1ForFork0_#t~ite20, P1Thread1of1ForFork0_#t~ite21, ~x$w_buff1~0] because there is no mapped edge [2019-12-27 22:23:26,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L771-->L771-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In356220281 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite23_In356220281| |P1Thread1of1ForFork0_#t~ite23_Out356220281|) (= ~x$w_buff0_used~0_In356220281 |P1Thread1of1ForFork0_#t~ite24_Out356220281|)) (and .cse0 (= |P1Thread1of1ForFork0_#t~ite24_Out356220281| |P1Thread1of1ForFork0_#t~ite23_Out356220281|) (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In356220281 256) 0))) (or (and (= 0 (mod ~x$w_buff1_used~0_In356220281 256)) .cse1) (= (mod ~x$w_buff0_used~0_In356220281 256) 0) (and (= 0 (mod ~x$r_buff1_thd2~0_In356220281 256)) .cse1))) (= ~x$w_buff0_used~0_In356220281 |P1Thread1of1ForFork0_#t~ite23_Out356220281|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In356220281, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In356220281, P1Thread1of1ForFork0_#t~ite23=|P1Thread1of1ForFork0_#t~ite23_In356220281|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In356220281, ~weak$$choice2~0=~weak$$choice2~0_In356220281, ~x$w_buff0_used~0=~x$w_buff0_used~0_In356220281} OutVars{P1Thread1of1ForFork0_#t~ite24=|P1Thread1of1ForFork0_#t~ite24_Out356220281|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In356220281, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In356220281, P1Thread1of1ForFork0_#t~ite23=|P1Thread1of1ForFork0_#t~ite23_Out356220281|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In356220281, ~weak$$choice2~0=~weak$$choice2~0_In356220281, ~x$w_buff0_used~0=~x$w_buff0_used~0_In356220281} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite24, P1Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-12-27 22:23:26,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L773-->L774: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1571881541 256))) (.cse0 (= ~x$r_buff0_thd2~0_Out1571881541 ~x$r_buff0_thd2~0_In1571881541))) (or (and .cse0 (not .cse1)) (and .cse1 .cse0 (let ((.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In1571881541 256)))) (or (and (= (mod ~x$r_buff1_thd2~0_In1571881541 256) 0) .cse2) (and .cse2 (= (mod ~x$w_buff1_used~0_In1571881541 256) 0)) (= (mod ~x$w_buff0_used~0_In1571881541 256) 0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1571881541, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1571881541, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1571881541, ~weak$$choice2~0=~weak$$choice2~0_In1571881541, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1571881541} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1571881541|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1571881541, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1571881541, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1571881541, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1571881541|, ~weak$$choice2~0=~weak$$choice2~0_In1571881541, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1571881541|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1571881541} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#t~ite28, P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 22:23:26,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L774-->L778: Formula: (and (= v_~__unbuffered_p1_EAX~0_7 (select (select |v_#memory_int_40| |v_~#x~0.base_23|) |v_~#x~0.offset_23|)) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_5 |v_~#x~0.offset_23|) (= |v_~#x~0.base_23| v_~__unbuffered_p1_EAX$read_delayed_var~0.base_5) (= v_~__unbuffered_p1_EAX$read_delayed~0_5 1) (= v_~x$r_buff1_thd2~0_36 v_~x$r_buff1_thd2~0_35) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~#x~0.offset=|v_~#x~0.offset_23|, ~#x~0.base=|v_~#x~0.base_23|, #memory_int=|v_#memory_int_40|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_36, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{~#x~0.offset=|v_~#x~0.offset_23|, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_5, P1Thread1of1ForFork0_#t~mem34=|v_P1Thread1of1ForFork0_#t~mem34_4|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_5, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_35, P1Thread1of1ForFork0_#t~ite33=|v_P1Thread1of1ForFork0_#t~ite33_9|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, P1Thread1of1ForFork0_#t~ite32=|v_P1Thread1of1ForFork0_#t~ite32_9|, ~#x~0.base=|v_~#x~0.base_23|, #memory_int=|v_#memory_int_40|, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_5, ~weak$$choice2~0=v_~weak$$choice2~0_22} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_#t~ite31, ~__unbuffered_p1_EAX$read_delayed~0, P1Thread1of1ForFork0_#t~ite32, P1Thread1of1ForFork0_#t~mem34, ~__unbuffered_p1_EAX$read_delayed_var~0.base, ~__unbuffered_p1_EAX$read_delayed_var~0.offset, ~x$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite33] because there is no mapped edge [2019-12-27 22:23:26,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L778-->L785: Formula: (and (= (store |v_#memory_int_33| |v_~#x~0.base_19| (store (select |v_#memory_int_33| |v_~#x~0.base_19|) |v_~#x~0.offset_19| v_~x$mem_tmp~0_4)) |v_#memory_int_32|) (= 0 v_~x$flush_delayed~0_6) (= 1 v_~y~0_8) (not (= 0 (mod v_~x$flush_delayed~0_7 256)))) InVars {~#x~0.offset=|v_~#x~0.offset_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, #memory_int=|v_#memory_int_33|, ~#x~0.base=|v_~#x~0.base_19|, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_6, ~#x~0.offset=|v_~#x~0.offset_19|, P1Thread1of1ForFork0_#t~mem35=|v_P1Thread1of1ForFork0_#t~mem35_5|, #memory_int=|v_#memory_int_32|, ~#x~0.base=|v_~#x~0.base_19|, P1Thread1of1ForFork0_#t~ite36=|v_P1Thread1of1ForFork0_#t~ite36_7|, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~y~0=v_~y~0_8} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork0_#t~mem35, #memory_int, P1Thread1of1ForFork0_#t~ite36, ~y~0] because there is no mapped edge [2019-12-27 22:23:26,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L785-2-->L785-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork0_#t~ite38_Out-170796629| |P1Thread1of1ForFork0_#t~ite39_Out-170796629|)) (.cse2 (= (mod ~x$r_buff1_thd2~0_In-170796629 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-170796629 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~mem37_In-170796629| |P1Thread1of1ForFork0_#t~mem37_Out-170796629|) .cse0 (not .cse1) (not .cse2) (= |P1Thread1of1ForFork0_#t~ite38_Out-170796629| ~x$w_buff1~0_In-170796629)) (and .cse0 (= |P1Thread1of1ForFork0_#t~mem37_Out-170796629| (select (select |#memory_int_In-170796629| |~#x~0.base_In-170796629|) |~#x~0.offset_In-170796629|)) (or .cse2 .cse1) (= |P1Thread1of1ForFork0_#t~mem37_Out-170796629| |P1Thread1of1ForFork0_#t~ite38_Out-170796629|)))) InVars {P1Thread1of1ForFork0_#t~mem37=|P1Thread1of1ForFork0_#t~mem37_In-170796629|, ~#x~0.offset=|~#x~0.offset_In-170796629|, ~x$w_buff1~0=~x$w_buff1~0_In-170796629, ~#x~0.base=|~#x~0.base_In-170796629|, #memory_int=|#memory_int_In-170796629|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-170796629, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-170796629} OutVars{P1Thread1of1ForFork0_#t~mem37=|P1Thread1of1ForFork0_#t~mem37_Out-170796629|, ~#x~0.offset=|~#x~0.offset_In-170796629|, ~x$w_buff1~0=~x$w_buff1~0_In-170796629, ~#x~0.base=|~#x~0.base_In-170796629|, #memory_int=|#memory_int_In-170796629|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-170796629, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-170796629, P1Thread1of1ForFork0_#t~ite39=|P1Thread1of1ForFork0_#t~ite39_Out-170796629|, P1Thread1of1ForFork0_#t~ite38=|P1Thread1of1ForFork0_#t~ite38_Out-170796629|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~mem37, P1Thread1of1ForFork0_#t~ite39, P1Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 22:23:26,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L802-2-->L802-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-1266055678 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1266055678 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~mem44_In-1266055678| |P2Thread1of1ForFork1_#t~mem44_Out-1266055678|) (= |P2Thread1of1ForFork1_#t~ite45_Out-1266055678| ~x$w_buff1~0_In-1266055678)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite45_Out-1266055678| |P2Thread1of1ForFork1_#t~mem44_Out-1266055678|) (= (select (select |#memory_int_In-1266055678| |~#x~0.base_In-1266055678|) |~#x~0.offset_In-1266055678|) |P2Thread1of1ForFork1_#t~mem44_Out-1266055678|)))) InVars {~#x~0.offset=|~#x~0.offset_In-1266055678|, ~x$w_buff1~0=~x$w_buff1~0_In-1266055678, ~#x~0.base=|~#x~0.base_In-1266055678|, #memory_int=|#memory_int_In-1266055678|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1266055678, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1266055678, P2Thread1of1ForFork1_#t~mem44=|P2Thread1of1ForFork1_#t~mem44_In-1266055678|} OutVars{~#x~0.offset=|~#x~0.offset_In-1266055678|, P2Thread1of1ForFork1_#t~ite45=|P2Thread1of1ForFork1_#t~ite45_Out-1266055678|, ~x$w_buff1~0=~x$w_buff1~0_In-1266055678, ~#x~0.base=|~#x~0.base_In-1266055678|, #memory_int=|#memory_int_In-1266055678|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1266055678, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1266055678, P2Thread1of1ForFork1_#t~mem44=|P2Thread1of1ForFork1_#t~mem44_Out-1266055678|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite45, P2Thread1of1ForFork1_#t~mem44] because there is no mapped edge [2019-12-27 22:23:26,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-2037912440 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-2037912440 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite40_Out-2037912440| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite40_Out-2037912440| ~x$w_buff0_used~0_In-2037912440) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2037912440, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2037912440} OutVars{P1Thread1of1ForFork0_#t~ite40=|P1Thread1of1ForFork0_#t~ite40_Out-2037912440|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2037912440, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2037912440} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 22:23:26,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L787-->L787-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In659749228 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In659749228 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In659749228 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In659749228 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In659749228 |P1Thread1of1ForFork0_#t~ite41_Out659749228|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite41_Out659749228|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In659749228, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In659749228, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In659749228, ~x$w_buff0_used~0=~x$w_buff0_used~0_In659749228} OutVars{P1Thread1of1ForFork0_#t~ite41=|P1Thread1of1ForFork0_#t~ite41_Out659749228|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In659749228, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In659749228, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In659749228, ~x$w_buff0_used~0=~x$w_buff0_used~0_In659749228} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 22:23:26,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L788-->L789: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In599147903 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In599147903 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd2~0_Out599147903 0)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd2~0_In599147903 ~x$r_buff0_thd2~0_Out599147903)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In599147903, ~x$w_buff0_used~0=~x$w_buff0_used~0_In599147903} OutVars{P1Thread1of1ForFork0_#t~ite42=|P1Thread1of1ForFork0_#t~ite42_Out599147903|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out599147903, ~x$w_buff0_used~0=~x$w_buff0_used~0_In599147903} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite42, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 22:23:26,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L750-2-->L750-5: Formula: (let ((.cse1 (= |P0Thread1of1ForFork2_#t~ite4_Out-714823285| |P0Thread1of1ForFork2_#t~ite5_Out-714823285|)) (.cse0 (= (mod ~x$w_buff1_used~0_In-714823285 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In-714823285 256)))) (or (and (= |P0Thread1of1ForFork2_#t~mem3_In-714823285| |P0Thread1of1ForFork2_#t~mem3_Out-714823285|) (not .cse0) .cse1 (= |P0Thread1of1ForFork2_#t~ite4_Out-714823285| ~x$w_buff1~0_In-714823285) (not .cse2)) (and (= |P0Thread1of1ForFork2_#t~ite4_Out-714823285| |P0Thread1of1ForFork2_#t~mem3_Out-714823285|) .cse1 (= |P0Thread1of1ForFork2_#t~mem3_Out-714823285| (select (select |#memory_int_In-714823285| |~#x~0.base_In-714823285|) |~#x~0.offset_In-714823285|)) (or .cse0 .cse2)))) InVars {P0Thread1of1ForFork2_#t~mem3=|P0Thread1of1ForFork2_#t~mem3_In-714823285|, ~#x~0.offset=|~#x~0.offset_In-714823285|, ~x$w_buff1~0=~x$w_buff1~0_In-714823285, ~#x~0.base=|~#x~0.base_In-714823285|, #memory_int=|#memory_int_In-714823285|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-714823285, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-714823285} OutVars{P0Thread1of1ForFork2_#t~ite4=|P0Thread1of1ForFork2_#t~ite4_Out-714823285|, P0Thread1of1ForFork2_#t~mem3=|P0Thread1of1ForFork2_#t~mem3_Out-714823285|, ~#x~0.offset=|~#x~0.offset_In-714823285|, P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out-714823285|, ~x$w_buff1~0=~x$w_buff1~0_In-714823285, ~#x~0.base=|~#x~0.base_In-714823285|, #memory_int=|#memory_int_In-714823285|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-714823285, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-714823285} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite4, P0Thread1of1ForFork2_#t~mem3, P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 22:23:26,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L802-4-->L803: Formula: (= (store |v_#memory_int_36| |v_~#x~0.base_21| (store (select |v_#memory_int_36| |v_~#x~0.base_21|) |v_~#x~0.offset_21| |v_P2Thread1of1ForFork1_#t~ite45_8|)) |v_#memory_int_35|) InVars {~#x~0.offset=|v_~#x~0.offset_21|, P2Thread1of1ForFork1_#t~ite45=|v_P2Thread1of1ForFork1_#t~ite45_8|, #memory_int=|v_#memory_int_36|, ~#x~0.base=|v_~#x~0.base_21|} OutVars{P2Thread1of1ForFork1_#t~ite46=|v_P2Thread1of1ForFork1_#t~ite46_7|, ~#x~0.offset=|v_~#x~0.offset_21|, P2Thread1of1ForFork1_#t~ite45=|v_P2Thread1of1ForFork1_#t~ite45_7|, #memory_int=|v_#memory_int_35|, ~#x~0.base=|v_~#x~0.base_21|, P2Thread1of1ForFork1_#t~mem44=|v_P2Thread1of1ForFork1_#t~mem44_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite46, P2Thread1of1ForFork1_#t~ite45, #memory_int, P2Thread1of1ForFork1_#t~mem44] because there is no mapped edge [2019-12-27 22:23:26,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In-363160722 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-363160722 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite47_Out-363160722| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite47_Out-363160722| ~x$w_buff0_used~0_In-363160722)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-363160722, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-363160722} OutVars{P2Thread1of1ForFork1_#t~ite47=|P2Thread1of1ForFork1_#t~ite47_Out-363160722|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-363160722, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-363160722} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite47] because there is no mapped edge [2019-12-27 22:23:26,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [886] [886] L804-->L804-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-206261261 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-206261261 256))) (.cse2 (= (mod ~x$r_buff1_thd3~0_In-206261261 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-206261261 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite48_Out-206261261| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In-206261261 |P2Thread1of1ForFork1_#t~ite48_Out-206261261|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-206261261, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-206261261, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-206261261, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-206261261} OutVars{P2Thread1of1ForFork1_#t~ite48=|P2Thread1of1ForFork1_#t~ite48_Out-206261261|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-206261261, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-206261261, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-206261261, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-206261261} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-27 22:23:26,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L751-->L751-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1022309 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-1022309 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite6_Out-1022309| ~x$w_buff0_used~0_In-1022309) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork2_#t~ite6_Out-1022309|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1022309, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1022309} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1022309, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out-1022309|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1022309} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 22:23:26,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L752-->L752-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In-1850809648 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-1850809648 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1850809648 256))) (.cse1 (= (mod ~x$r_buff1_thd1~0_In-1850809648 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1850809648 |P0Thread1of1ForFork2_#t~ite7_Out-1850809648|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork2_#t~ite7_Out-1850809648|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1850809648, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1850809648, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1850809648, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1850809648} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1850809648, P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out-1850809648|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1850809648, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1850809648, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1850809648} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 22:23:26,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L753-->L754: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In943081861 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In943081861 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd1~0_Out943081861 ~x$r_buff0_thd1~0_In943081861)) (and (= ~x$r_buff0_thd1~0_Out943081861 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In943081861, ~x$w_buff0_used~0=~x$w_buff0_used~0_In943081861} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out943081861, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out943081861|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In943081861} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 22:23:26,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L754-->L754-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In2128019220 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In2128019220 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In2128019220 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In2128019220 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite9_Out2128019220| ~x$r_buff1_thd1~0_In2128019220) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork2_#t~ite9_Out2128019220| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2128019220, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2128019220, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2128019220, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2128019220} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2128019220, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2128019220, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2128019220, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out2128019220|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2128019220} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 22:23:26,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [904] [904] L754-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_12 |v_P0Thread1of1ForFork2_#t~ite9_8|) (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P0Thread1of1ForFork2_#t~ite9=|v_P0Thread1of1ForFork2_#t~ite9_8|} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_12, P0Thread1of1ForFork2_#t~ite9=|v_P0Thread1of1ForFork2_#t~ite9_7|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~ite9, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 22:23:26,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L805-->L806: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-83935295 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-83935295 256) 0))) (or (and (= ~x$r_buff0_thd3~0_In-83935295 ~x$r_buff0_thd3~0_Out-83935295) (or .cse0 .cse1)) (and (not .cse0) (= 0 ~x$r_buff0_thd3~0_Out-83935295) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-83935295, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-83935295} OutVars{P2Thread1of1ForFork1_#t~ite49=|P2Thread1of1ForFork1_#t~ite49_Out-83935295|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_Out-83935295, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-83935295} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite49, ~x$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 22:23:26,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L806-->L806-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-807189251 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-807189251 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In-807189251 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-807189251 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite50_Out-807189251| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite50_Out-807189251| ~x$r_buff1_thd3~0_In-807189251) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-807189251, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-807189251, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-807189251, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-807189251} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-807189251, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-807189251, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-807189251, P2Thread1of1ForFork1_#t~ite50=|P2Thread1of1ForFork1_#t~ite50_Out-807189251|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-807189251} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite50] because there is no mapped edge [2019-12-27 22:23:26,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] L806-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_11 |v_P2Thread1of1ForFork1_#t~ite50_8|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork1_#t~ite50=|v_P2Thread1of1ForFork1_#t~ite50_8|} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P2Thread1of1ForFork1_#t~ite50=|v_P2Thread1of1ForFork1_#t~ite50_7|, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#t~ite50, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 22:23:26,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L789-->L789-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-1459891929 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-1459891929 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-1459891929 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1459891929 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite43_Out-1459891929| ~x$r_buff1_thd2~0_In-1459891929) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite43_Out-1459891929| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1459891929, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1459891929, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1459891929, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1459891929} OutVars{P1Thread1of1ForFork0_#t~ite43=|P1Thread1of1ForFork0_#t~ite43_Out-1459891929|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1459891929, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1459891929, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1459891929, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1459891929} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 22:23:26,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] L789-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_44 |v_P1Thread1of1ForFork0_#t~ite43_8|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {P1Thread1of1ForFork0_#t~ite43=|v_P1Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{P1Thread1of1ForFork0_#t~ite43=|v_P1Thread1of1ForFork0_#t~ite43_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_44, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite43, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 22:23:26,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L833-->L835-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= (mod v_~x$w_buff0_used~0_88 256) 0) (= 0 (mod v_~x$r_buff0_thd0~0_18 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 22:23:26,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L835-2-->L835-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In203583452 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In203583452 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~mem54_In203583452| |ULTIMATE.start_main_#t~mem54_Out203583452|) (not .cse1) (= |ULTIMATE.start_main_#t~ite55_Out203583452| ~x$w_buff1~0_In203583452)) (and (or .cse0 .cse1) (= (select (select |#memory_int_In203583452| |~#x~0.base_In203583452|) |~#x~0.offset_In203583452|) |ULTIMATE.start_main_#t~mem54_Out203583452|) (= |ULTIMATE.start_main_#t~ite55_Out203583452| |ULTIMATE.start_main_#t~mem54_Out203583452|)))) InVars {ULTIMATE.start_main_#t~mem54=|ULTIMATE.start_main_#t~mem54_In203583452|, ~#x~0.offset=|~#x~0.offset_In203583452|, ~x$w_buff1~0=~x$w_buff1~0_In203583452, ~#x~0.base=|~#x~0.base_In203583452|, #memory_int=|#memory_int_In203583452|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In203583452, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In203583452} OutVars{ULTIMATE.start_main_#t~mem54=|ULTIMATE.start_main_#t~mem54_Out203583452|, ~#x~0.offset=|~#x~0.offset_In203583452|, ~x$w_buff1~0=~x$w_buff1~0_In203583452, ~#x~0.base=|~#x~0.base_In203583452|, #memory_int=|#memory_int_In203583452|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In203583452, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In203583452, ULTIMATE.start_main_#t~ite55=|ULTIMATE.start_main_#t~ite55_Out203583452|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem54, ULTIMATE.start_main_#t~ite55] because there is no mapped edge [2019-12-27 22:23:26,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [854] [854] L835-4-->L836: Formula: (= (store |v_#memory_int_44| |v_~#x~0.base_24| (store (select |v_#memory_int_44| |v_~#x~0.base_24|) |v_~#x~0.offset_24| |v_ULTIMATE.start_main_#t~ite55_8|)) |v_#memory_int_43|) InVars {~#x~0.offset=|v_~#x~0.offset_24|, #memory_int=|v_#memory_int_44|, ~#x~0.base=|v_~#x~0.base_24|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_8|} OutVars{ULTIMATE.start_main_#t~mem54=|v_ULTIMATE.start_main_#t~mem54_5|, ~#x~0.offset=|v_~#x~0.offset_24|, #memory_int=|v_#memory_int_43|, ~#x~0.base=|v_~#x~0.base_24|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_8|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem54, #memory_int, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_#t~ite55] because there is no mapped edge [2019-12-27 22:23:26,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L836-->L836-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1304621756 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In1304621756 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite57_Out1304621756| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In1304621756 |ULTIMATE.start_main_#t~ite57_Out1304621756|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1304621756, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1304621756} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1304621756, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out1304621756|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1304621756} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-27 22:23:26,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L837-->L837-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In-199039435 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd0~0_In-199039435 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-199039435 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-199039435 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite58_Out-199039435| ~x$w_buff1_used~0_In-199039435)) (and (= |ULTIMATE.start_main_#t~ite58_Out-199039435| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-199039435, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-199039435, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-199039435, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-199039435} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-199039435, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-199039435|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-199039435, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-199039435, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-199039435} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58] because there is no mapped edge [2019-12-27 22:23:26,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L838-->L839: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-740298771 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-740298771 256)))) (or (and (= ~x$r_buff0_thd0~0_Out-740298771 ~x$r_buff0_thd0~0_In-740298771) (or .cse0 .cse1)) (and (= ~x$r_buff0_thd0~0_Out-740298771 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-740298771, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-740298771} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-740298771, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-740298771|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-740298771} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-27 22:23:26,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L839-->L843: Formula: (let ((.cse4 (= (mod ~x$w_buff1_used~0_In886888038 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In886888038 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In886888038 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In886888038 256))) (.cse2 (= ~weak$$choice1~0_Out886888038 |ULTIMATE.start_main_#t~nondet61_In886888038|))) (or (and (or .cse0 .cse1) .cse2 (= ~x$r_buff1_thd0~0_Out886888038 ~x$r_buff1_thd0~0_In886888038) (or .cse3 .cse4)) (and (= ~x$r_buff1_thd0~0_Out886888038 0) (or (and (not .cse4) (not .cse3)) (and (not .cse1) (not .cse0))) .cse2))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In886888038, ~x$w_buff1_used~0=~x$w_buff1_used~0_In886888038, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In886888038, ULTIMATE.start_main_#t~nondet61=|ULTIMATE.start_main_#t~nondet61_In886888038|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In886888038} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In886888038, ~weak$$choice1~0=~weak$$choice1~0_Out886888038, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out886888038|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In886888038, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out886888038, ULTIMATE.start_main_#t~nondet61=|ULTIMATE.start_main_#t~nondet61_Out886888038|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In886888038} AuxVars[] AssignedVars[~weak$$choice1~0, ULTIMATE.start_main_#t~ite60, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-27 22:23:26,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L843-1-->L843-3: Formula: (let ((.cse0 (= (mod ~weak$$choice1~0_In-45115231 256) 0))) (or (and .cse0 (= |ULTIMATE.start_main_#t~mem62_In-45115231| |ULTIMATE.start_main_#t~mem62_Out-45115231|) (= ~__unbuffered_p1_EAX~0_In-45115231 |ULTIMATE.start_main_#t~ite63_Out-45115231|)) (and (= |ULTIMATE.start_main_#t~mem62_Out-45115231| |ULTIMATE.start_main_#t~ite63_Out-45115231|) (= (select (select |#memory_int_In-45115231| ~__unbuffered_p1_EAX$read_delayed_var~0.base_In-45115231) ~__unbuffered_p1_EAX$read_delayed_var~0.offset_In-45115231) |ULTIMATE.start_main_#t~mem62_Out-45115231|) (not .cse0)))) InVars {~weak$$choice1~0=~weak$$choice1~0_In-45115231, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_In-45115231, ULTIMATE.start_main_#t~mem62=|ULTIMATE.start_main_#t~mem62_In-45115231|, ~__unbuffered_p1_EAX$read_delayed_var~0.base=~__unbuffered_p1_EAX$read_delayed_var~0.base_In-45115231, #memory_int=|#memory_int_In-45115231|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=~__unbuffered_p1_EAX$read_delayed_var~0.offset_In-45115231} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-45115231|, ~weak$$choice1~0=~weak$$choice1~0_In-45115231, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_In-45115231, ULTIMATE.start_main_#t~mem62=|ULTIMATE.start_main_#t~mem62_Out-45115231|, ~__unbuffered_p1_EAX$read_delayed_var~0.base=~__unbuffered_p1_EAX$read_delayed_var~0.base_In-45115231, #memory_int=|#memory_int_In-45115231|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=~__unbuffered_p1_EAX$read_delayed_var~0.offset_In-45115231} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~mem62] because there is no mapped edge [2019-12-27 22:23:26,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [923] [923] L843-3-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5| (mod v_~main$tmp_guard1~0_8 256)) (= |v_ULTIMATE.start_main_#t~ite63_11| v_~__unbuffered_p1_EAX~0_10) (let ((.cse1 (= 1 v_~__unbuffered_p1_EAX~0_10)) (.cse2 (= v_~__unbuffered_p0_EAX~0_6 2)) (.cse0 (= v_~y~0_10 2))) (or (and .cse0 (= v_~main$tmp_guard1~0_8 0) .cse1 .cse2) (and (or (not .cse1) (not .cse2) (not .cse0)) (= v_~main$tmp_guard1~0_8 1))))) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_11|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ~y~0=v_~y~0_10} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ULTIMATE.start_main_#t~mem62=|v_ULTIMATE.start_main_#t~mem62_7|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y~0=v_~y~0_10, 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_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~mem62, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 22:23:26,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [920] [920] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 22:23:26,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:23:26 BasicIcfg [2019-12-27 22:23:26,888 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:23:26,890 INFO L168 Benchmark]: Toolchain (without parser) took 55001.20 ms. Allocated memory was 144.2 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 100.2 MB in the beginning and 858.5 MB in the end (delta: -758.3 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-27 22:23:26,891 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 22:23:26,892 INFO L168 Benchmark]: CACSL2BoogieTranslator took 789.17 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 99.7 MB in the beginning and 154.6 MB in the end (delta: -54.8 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. [2019-12-27 22:23:26,892 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.71 ms. Allocated memory is still 201.3 MB. Free memory was 154.6 MB in the beginning and 151.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:23:26,893 INFO L168 Benchmark]: Boogie Preprocessor took 52.99 ms. Allocated memory is still 201.3 MB. Free memory was 151.9 MB in the beginning and 149.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:23:26,893 INFO L168 Benchmark]: RCFGBuilder took 887.64 ms. Allocated memory is still 201.3 MB. Free memory was 149.2 MB in the beginning and 94.3 MB in the end (delta: 54.9 MB). Peak memory consumption was 54.9 MB. Max. memory is 7.1 GB. [2019-12-27 22:23:26,894 INFO L168 Benchmark]: TraceAbstraction took 53199.25 ms. Allocated memory was 201.3 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 93.6 MB in the beginning and 858.5 MB in the end (delta: -764.9 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-27 22:23:26,897 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.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 789.17 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 99.7 MB in the beginning and 154.6 MB in the end (delta: -54.8 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.71 ms. Allocated memory is still 201.3 MB. Free memory was 154.6 MB in the beginning and 151.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.99 ms. Allocated memory is still 201.3 MB. Free memory was 151.9 MB in the beginning and 149.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 887.64 ms. Allocated memory is still 201.3 MB. Free memory was 149.2 MB in the beginning and 94.3 MB in the end (delta: 54.9 MB). Peak memory consumption was 54.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 53199.25 ms. Allocated memory was 201.3 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 93.6 MB in the beginning and 858.5 MB in the end (delta: -764.9 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.3s, 192 ProgramPointsBefore, 91 ProgramPointsAfterwards, 230 TransitionsBefore, 102 TransitionsAfterwards, 19530 CoEnabledTransitionPairs, 8 FixpointIterations, 49 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 48 ConcurrentYvCompositions, 31 ChoiceCompositions, 7604 VarBasedMoverChecksPositive, 178 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 88636 CheckedPairsTotal, 138 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L825] FCALL, FORK 0 pthread_create(&t2000, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L827] FCALL, FORK 0 pthread_create(&t2001, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L829] FCALL, FORK 0 pthread_create(&t2002, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L764] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 2 x$flush_delayed = weak$$choice2 [L767] EXPR 2 \read(x) [L767] 2 x$mem_tmp = x [L768] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L768] EXPR 2 \read(x) [L768] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, \read(x)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x={5:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L768] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L771] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L772] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x={5:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L772] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=1, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L785] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=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=3, weak$$choice1=0, weak$$choice2=1, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L802] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=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=3, weak$$choice1=0, weak$$choice2=1, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 __unbuffered_p0_EAX = y [L747] 1 x = 1 VAL [\read(x)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, 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=3, weak$$choice1=0, weak$$choice2=1, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2] [L786] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L787] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [\read(x)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, 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=3, weak$$choice1=0, weak$$choice2=1, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2] [L803] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L750] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L751] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L752] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L804] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, 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=3, weak$$choice1=0, weak$$choice2=1, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L836] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L837] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L843] 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={5:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, 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=3, weak$$choice1=1, weak$$choice2=1, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 183 locations, 1 error locations. Result: UNSAFE, OverallTime: 52.7s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 11.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2082 SDtfs, 3124 SDslu, 3896 SDs, 0 SdLazy, 2831 SolverSat, 226 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 200 GetRequests, 73 SyntacticMatches, 29 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104810occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 28860 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 964 NumberOfCodeBlocks, 964 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 882 ConstructedInterpolants, 0 QuantifiedInterpolants, 183446 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...