/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix045_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:36:09,736 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:36:09,738 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:36:09,751 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:36:09,751 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:36:09,752 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:36:09,753 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:36:09,755 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:36:09,757 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:36:09,758 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:36:09,759 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:36:09,760 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:36:09,760 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:36:09,761 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:36:09,762 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:36:09,763 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:36:09,764 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:36:09,765 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:36:09,767 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:36:09,769 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:36:09,770 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:36:09,771 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:36:09,772 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:36:09,773 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:36:09,775 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:36:09,776 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:36:09,776 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:36:09,777 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:36:09,777 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:36:09,778 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:36:09,778 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:36:09,779 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:36:09,780 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:36:09,780 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:36:09,781 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:36:09,782 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:36:09,782 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:36:09,783 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:36:09,783 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:36:09,784 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:36:09,784 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:36:09,785 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 06:36:09,800 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:36:09,800 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:36:09,801 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:36:09,802 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:36:09,802 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:36:09,802 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:36:09,802 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:36:09,802 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:36:09,803 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:36:09,803 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:36:09,803 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:36:09,803 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:36:09,803 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:36:09,804 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:36:09,804 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:36:09,804 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:36:09,804 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:36:09,804 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:36:09,805 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:36:09,805 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:36:09,805 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:36:09,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:36:09,805 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:36:09,806 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:36:09,806 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:36:09,806 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:36:09,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:36:09,806 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:36:09,807 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:36:09,807 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:36:10,100 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:36:10,114 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:36:10,117 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:36:10,119 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:36:10,119 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:36:10,120 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_tso.opt.i [2019-12-27 06:36:10,181 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a31d1a638/e1eac1cf269e4ffd9ea7e1240c895103/FLAG9a14ac540 [2019-12-27 06:36:10,735 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:36:10,736 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_tso.opt.i [2019-12-27 06:36:10,756 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a31d1a638/e1eac1cf269e4ffd9ea7e1240c895103/FLAG9a14ac540 [2019-12-27 06:36:11,023 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a31d1a638/e1eac1cf269e4ffd9ea7e1240c895103 [2019-12-27 06:36:11,031 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:36:11,033 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:36:11,034 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:36:11,035 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:36:11,040 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:36:11,041 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:36:11" (1/1) ... [2019-12-27 06:36:11,044 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cd32435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:11, skipping insertion in model container [2019-12-27 06:36:11,044 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:36:11" (1/1) ... [2019-12-27 06:36:11,052 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:36:11,130 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:36:11,688 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:36:11,708 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:36:11,790 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:36:11,869 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:36:11,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:11 WrapperNode [2019-12-27 06:36:11,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:36:11,870 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:36:11,870 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:36:11,871 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:36:11,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:11" (1/1) ... [2019-12-27 06:36:11,901 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:11" (1/1) ... [2019-12-27 06:36:11,940 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:36:11,940 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:36:11,941 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:36:11,941 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:36:11,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:11" (1/1) ... [2019-12-27 06:36:11,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:11" (1/1) ... [2019-12-27 06:36:11,961 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:11" (1/1) ... [2019-12-27 06:36:11,961 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:11" (1/1) ... [2019-12-27 06:36:11,979 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:11" (1/1) ... [2019-12-27 06:36:11,997 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:11" (1/1) ... [2019-12-27 06:36:12,004 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:11" (1/1) ... [2019-12-27 06:36:12,012 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:36:12,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:36:12,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:36:12,013 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:36:12,018 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:11" (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 06:36:12,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:36:12,084 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:36:12,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:36:12,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:36:12,084 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:36:12,085 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:36:12,085 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:36:12,085 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:36:12,085 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:36:12,085 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:36:12,086 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:36:12,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:36:12,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:36:12,088 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 06:36:12,852 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:36:12,852 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:36:12,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:36:12 BoogieIcfgContainer [2019-12-27 06:36:12,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:36:12,855 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:36:12,856 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:36:12,859 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:36:12,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:36:11" (1/3) ... [2019-12-27 06:36:12,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44e39580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:36:12, skipping insertion in model container [2019-12-27 06:36:12,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:11" (2/3) ... [2019-12-27 06:36:12,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44e39580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:36:12, skipping insertion in model container [2019-12-27 06:36:12,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:36:12" (3/3) ... [2019-12-27 06:36:12,866 INFO L109 eAbstractionObserver]: Analyzing ICFG mix045_tso.opt.i [2019-12-27 06:36:12,877 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:36:12,877 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:36:12,887 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:36:12,888 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:36:12,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,927 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,927 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,929 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,929 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,938 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,938 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,938 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,939 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,939 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,951 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,952 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,952 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,957 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,957 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,960 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,961 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:12,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:36:13,008 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 06:36:13,035 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:36:13,035 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:36:13,035 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:36:13,035 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:36:13,036 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:36:13,040 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:36:13,041 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:36:13,041 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:36:13,069 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-27 06:36:13,078 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 06:36:13,196 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 06:36:13,196 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:36:13,212 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 272 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 06:36:13,228 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 06:36:13,325 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 06:36:13,326 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:36:13,335 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 272 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 06:36:13,347 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-27 06:36:13,348 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:36:16,836 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 06:36:16,960 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 06:36:16,979 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48939 [2019-12-27 06:36:16,979 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 06:36:16,982 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 93 transitions [2019-12-27 06:36:18,076 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 17702 states. [2019-12-27 06:36:18,078 INFO L276 IsEmpty]: Start isEmpty. Operand 17702 states. [2019-12-27 06:36:18,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 06:36:18,085 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:36:18,086 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:36:18,087 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:36:18,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:36:18,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1021258717, now seen corresponding path program 1 times [2019-12-27 06:36:18,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:36:18,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506900320] [2019-12-27 06:36:18,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:36:18,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:36:18,386 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 06:36:18,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506900320] [2019-12-27 06:36:18,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:36:18,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:36:18,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515173092] [2019-12-27 06:36:18,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:36:18,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:36:18,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:36:18,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:36:18,416 INFO L87 Difference]: Start difference. First operand 17702 states. Second operand 3 states. [2019-12-27 06:36:18,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:36:18,839 INFO L93 Difference]: Finished difference Result 17518 states and 65786 transitions. [2019-12-27 06:36:18,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:36:18,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 06:36:18,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:36:19,043 INFO L225 Difference]: With dead ends: 17518 [2019-12-27 06:36:19,044 INFO L226 Difference]: Without dead ends: 17154 [2019-12-27 06:36:19,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:36:19,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17154 states. [2019-12-27 06:36:20,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17154 to 17154. [2019-12-27 06:36:20,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17154 states. [2019-12-27 06:36:20,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17154 states to 17154 states and 64484 transitions. [2019-12-27 06:36:20,594 INFO L78 Accepts]: Start accepts. Automaton has 17154 states and 64484 transitions. Word has length 7 [2019-12-27 06:36:20,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:36:20,595 INFO L462 AbstractCegarLoop]: Abstraction has 17154 states and 64484 transitions. [2019-12-27 06:36:20,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:36:20,596 INFO L276 IsEmpty]: Start isEmpty. Operand 17154 states and 64484 transitions. [2019-12-27 06:36:20,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:36:20,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:36:20,600 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:36:20,601 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:36:20,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:36:20,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1042029575, now seen corresponding path program 1 times [2019-12-27 06:36:20,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:36:20,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248193818] [2019-12-27 06:36:20,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:36:20,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:36:20,708 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 06:36:20,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248193818] [2019-12-27 06:36:20,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:36:20,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:36:20,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135101802] [2019-12-27 06:36:20,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:36:20,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:36:20,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:36:20,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:36:20,713 INFO L87 Difference]: Start difference. First operand 17154 states and 64484 transitions. Second operand 4 states. [2019-12-27 06:36:21,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:36:21,339 INFO L93 Difference]: Finished difference Result 26570 states and 95594 transitions. [2019-12-27 06:36:21,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:36:21,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 06:36:21,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:36:21,455 INFO L225 Difference]: With dead ends: 26570 [2019-12-27 06:36:21,455 INFO L226 Difference]: Without dead ends: 26556 [2019-12-27 06:36:21,456 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 06:36:21,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26556 states. [2019-12-27 06:36:22,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26556 to 24300. [2019-12-27 06:36:22,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24300 states. [2019-12-27 06:36:23,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24300 states to 24300 states and 88453 transitions. [2019-12-27 06:36:23,850 INFO L78 Accepts]: Start accepts. Automaton has 24300 states and 88453 transitions. Word has length 13 [2019-12-27 06:36:23,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:36:23,851 INFO L462 AbstractCegarLoop]: Abstraction has 24300 states and 88453 transitions. [2019-12-27 06:36:23,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:36:23,851 INFO L276 IsEmpty]: Start isEmpty. Operand 24300 states and 88453 transitions. [2019-12-27 06:36:23,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:36:23,857 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:36:23,857 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:36:23,858 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:36:23,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:36:23,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1362987190, now seen corresponding path program 1 times [2019-12-27 06:36:23,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:36:23,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799177888] [2019-12-27 06:36:23,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:36:23,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:36:23,928 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 06:36:23,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799177888] [2019-12-27 06:36:23,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:36:23,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:36:23,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892166759] [2019-12-27 06:36:23,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:36:23,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:36:23,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:36:23,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:36:23,930 INFO L87 Difference]: Start difference. First operand 24300 states and 88453 transitions. Second operand 3 states. [2019-12-27 06:36:23,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:36:23,990 INFO L93 Difference]: Finished difference Result 13809 states and 43497 transitions. [2019-12-27 06:36:23,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:36:23,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 06:36:23,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:36:24,062 INFO L225 Difference]: With dead ends: 13809 [2019-12-27 06:36:24,063 INFO L226 Difference]: Without dead ends: 13809 [2019-12-27 06:36:24,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:36:24,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13809 states. [2019-12-27 06:36:24,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13809 to 13809. [2019-12-27 06:36:24,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13809 states. [2019-12-27 06:36:24,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13809 states to 13809 states and 43497 transitions. [2019-12-27 06:36:24,450 INFO L78 Accepts]: Start accepts. Automaton has 13809 states and 43497 transitions. Word has length 13 [2019-12-27 06:36:24,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:36:24,450 INFO L462 AbstractCegarLoop]: Abstraction has 13809 states and 43497 transitions. [2019-12-27 06:36:24,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:36:24,450 INFO L276 IsEmpty]: Start isEmpty. Operand 13809 states and 43497 transitions. [2019-12-27 06:36:24,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 06:36:24,452 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:36:24,452 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:36:24,452 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:36:24,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:36:24,453 INFO L82 PathProgramCache]: Analyzing trace with hash -824782782, now seen corresponding path program 1 times [2019-12-27 06:36:24,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:36:24,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372255016] [2019-12-27 06:36:24,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:36:24,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:36:24,513 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 06:36:24,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372255016] [2019-12-27 06:36:24,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:36:24,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:36:24,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783492055] [2019-12-27 06:36:24,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:36:24,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:36:24,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:36:24,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:36:24,515 INFO L87 Difference]: Start difference. First operand 13809 states and 43497 transitions. Second operand 4 states. [2019-12-27 06:36:24,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:36:24,538 INFO L93 Difference]: Finished difference Result 2006 states and 4674 transitions. [2019-12-27 06:36:24,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:36:24,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 06:36:24,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:36:24,542 INFO L225 Difference]: With dead ends: 2006 [2019-12-27 06:36:24,542 INFO L226 Difference]: Without dead ends: 2006 [2019-12-27 06:36:24,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:36:24,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2006 states. [2019-12-27 06:36:24,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2006 to 2006. [2019-12-27 06:36:24,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2006 states. [2019-12-27 06:36:24,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2006 states to 2006 states and 4674 transitions. [2019-12-27 06:36:24,576 INFO L78 Accepts]: Start accepts. Automaton has 2006 states and 4674 transitions. Word has length 14 [2019-12-27 06:36:24,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:36:24,577 INFO L462 AbstractCegarLoop]: Abstraction has 2006 states and 4674 transitions. [2019-12-27 06:36:24,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:36:24,577 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 4674 transitions. [2019-12-27 06:36:24,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 06:36:24,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:36:24,579 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:36:24,580 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:36:24,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:36:24,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1888947731, now seen corresponding path program 1 times [2019-12-27 06:36:24,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:36:24,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29588547] [2019-12-27 06:36:24,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:36:24,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:36:24,640 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 06:36:24,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29588547] [2019-12-27 06:36:24,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:36:24,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:36:24,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073579494] [2019-12-27 06:36:24,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:36:24,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:36:24,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:36:24,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:36:24,642 INFO L87 Difference]: Start difference. First operand 2006 states and 4674 transitions. Second operand 5 states. [2019-12-27 06:36:24,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:36:24,671 INFO L93 Difference]: Finished difference Result 653 states and 1533 transitions. [2019-12-27 06:36:24,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:36:24,671 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 06:36:24,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:36:24,673 INFO L225 Difference]: With dead ends: 653 [2019-12-27 06:36:24,673 INFO L226 Difference]: Without dead ends: 653 [2019-12-27 06:36:24,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:36:24,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-12-27 06:36:24,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 597. [2019-12-27 06:36:24,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-12-27 06:36:24,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1401 transitions. [2019-12-27 06:36:24,683 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1401 transitions. Word has length 26 [2019-12-27 06:36:24,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:36:24,684 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 1401 transitions. [2019-12-27 06:36:24,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:36:24,684 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1401 transitions. [2019-12-27 06:36:24,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 06:36:24,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:36:24,687 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] [2019-12-27 06:36:24,687 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:36:24,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:36:24,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1558229958, now seen corresponding path program 1 times [2019-12-27 06:36:24,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:36:24,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996609265] [2019-12-27 06:36:24,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:36:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:36:24,828 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 06:36:24,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996609265] [2019-12-27 06:36:24,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:36:24,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:36:24,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001272347] [2019-12-27 06:36:24,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:36:24,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:36:24,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:36:24,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:36:24,972 INFO L87 Difference]: Start difference. First operand 597 states and 1401 transitions. Second operand 3 states. [2019-12-27 06:36:25,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:36:25,028 INFO L93 Difference]: Finished difference Result 609 states and 1418 transitions. [2019-12-27 06:36:25,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:36:25,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 06:36:25,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:36:25,030 INFO L225 Difference]: With dead ends: 609 [2019-12-27 06:36:25,030 INFO L226 Difference]: Without dead ends: 609 [2019-12-27 06:36:25,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:36:25,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-12-27 06:36:25,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 605. [2019-12-27 06:36:25,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-27 06:36:25,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1414 transitions. [2019-12-27 06:36:25,041 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1414 transitions. Word has length 55 [2019-12-27 06:36:25,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:36:25,042 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1414 transitions. [2019-12-27 06:36:25,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:36:25,042 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1414 transitions. [2019-12-27 06:36:25,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 06:36:25,044 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:36:25,044 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] [2019-12-27 06:36:25,044 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:36:25,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:36:25,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1993278178, now seen corresponding path program 1 times [2019-12-27 06:36:25,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:36:25,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79349308] [2019-12-27 06:36:25,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:36:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:36:25,129 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 06:36:25,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79349308] [2019-12-27 06:36:25,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:36:25,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:36:25,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999130307] [2019-12-27 06:36:25,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:36:25,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:36:25,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:36:25,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:36:25,131 INFO L87 Difference]: Start difference. First operand 605 states and 1414 transitions. Second operand 3 states. [2019-12-27 06:36:25,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:36:25,181 INFO L93 Difference]: Finished difference Result 609 states and 1411 transitions. [2019-12-27 06:36:25,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:36:25,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 06:36:25,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:36:25,183 INFO L225 Difference]: With dead ends: 609 [2019-12-27 06:36:25,183 INFO L226 Difference]: Without dead ends: 609 [2019-12-27 06:36:25,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:36:25,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-12-27 06:36:25,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 605. [2019-12-27 06:36:25,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-27 06:36:25,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1407 transitions. [2019-12-27 06:36:25,194 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1407 transitions. Word has length 55 [2019-12-27 06:36:25,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:36:25,194 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1407 transitions. [2019-12-27 06:36:25,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:36:25,195 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1407 transitions. [2019-12-27 06:36:25,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 06:36:25,196 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:36:25,197 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] [2019-12-27 06:36:25,197 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:36:25,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:36:25,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1988838358, now seen corresponding path program 1 times [2019-12-27 06:36:25,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:36:25,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396854167] [2019-12-27 06:36:25,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:36:25,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:36:25,312 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 06:36:25,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396854167] [2019-12-27 06:36:25,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:36:25,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:36:25,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200611757] [2019-12-27 06:36:25,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:36:25,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:36:25,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:36:25,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:36:25,315 INFO L87 Difference]: Start difference. First operand 605 states and 1407 transitions. Second operand 5 states. [2019-12-27 06:36:25,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:36:25,592 INFO L93 Difference]: Finished difference Result 894 states and 2079 transitions. [2019-12-27 06:36:25,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:36:25,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-27 06:36:25,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:36:25,594 INFO L225 Difference]: With dead ends: 894 [2019-12-27 06:36:25,594 INFO L226 Difference]: Without dead ends: 894 [2019-12-27 06:36:25,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:36:25,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-12-27 06:36:25,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 719. [2019-12-27 06:36:25,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2019-12-27 06:36:25,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1688 transitions. [2019-12-27 06:36:25,608 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1688 transitions. Word has length 55 [2019-12-27 06:36:25,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:36:25,609 INFO L462 AbstractCegarLoop]: Abstraction has 719 states and 1688 transitions. [2019-12-27 06:36:25,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:36:25,609 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1688 transitions. [2019-12-27 06:36:25,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 06:36:25,611 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:36:25,611 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] [2019-12-27 06:36:25,611 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:36:25,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:36:25,612 INFO L82 PathProgramCache]: Analyzing trace with hash -2112589232, now seen corresponding path program 2 times [2019-12-27 06:36:25,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:36:25,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572206539] [2019-12-27 06:36:25,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:36:25,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:36:25,720 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 06:36:25,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572206539] [2019-12-27 06:36:25,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:36:25,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:36:25,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613635739] [2019-12-27 06:36:25,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:36:25,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:36:25,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:36:25,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:36:25,723 INFO L87 Difference]: Start difference. First operand 719 states and 1688 transitions. Second operand 3 states. [2019-12-27 06:36:25,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:36:25,775 INFO L93 Difference]: Finished difference Result 719 states and 1687 transitions. [2019-12-27 06:36:25,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:36:25,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 06:36:25,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:36:25,777 INFO L225 Difference]: With dead ends: 719 [2019-12-27 06:36:25,777 INFO L226 Difference]: Without dead ends: 719 [2019-12-27 06:36:25,777 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 06:36:25,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2019-12-27 06:36:25,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 536. [2019-12-27 06:36:25,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-12-27 06:36:25,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1264 transitions. [2019-12-27 06:36:25,791 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1264 transitions. Word has length 55 [2019-12-27 06:36:25,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:36:25,794 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 1264 transitions. [2019-12-27 06:36:25,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:36:25,794 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1264 transitions. [2019-12-27 06:36:25,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 06:36:25,796 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:36:25,796 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] [2019-12-27 06:36:25,797 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:36:25,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:36:25,797 INFO L82 PathProgramCache]: Analyzing trace with hash 966806383, now seen corresponding path program 1 times [2019-12-27 06:36:25,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:36:25,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797648194] [2019-12-27 06:36:25,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:36:25,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:36:25,950 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 06:36:25,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797648194] [2019-12-27 06:36:25,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:36:25,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:36:25,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121761762] [2019-12-27 06:36:25,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:36:25,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:36:25,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:36:25,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:36:25,952 INFO L87 Difference]: Start difference. First operand 536 states and 1264 transitions. Second operand 6 states. [2019-12-27 06:36:26,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:36:26,038 INFO L93 Difference]: Finished difference Result 906 states and 2043 transitions. [2019-12-27 06:36:26,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:36:26,039 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-27 06:36:26,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:36:26,040 INFO L225 Difference]: With dead ends: 906 [2019-12-27 06:36:26,040 INFO L226 Difference]: Without dead ends: 372 [2019-12-27 06:36:26,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:36:26,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-12-27 06:36:26,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 319. [2019-12-27 06:36:26,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-12-27 06:36:26,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 591 transitions. [2019-12-27 06:36:26,047 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 591 transitions. Word has length 56 [2019-12-27 06:36:26,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:36:26,047 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 591 transitions. [2019-12-27 06:36:26,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:36:26,047 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 591 transitions. [2019-12-27 06:36:26,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 06:36:26,048 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:36:26,048 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] [2019-12-27 06:36:26,049 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:36:26,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:36:26,049 INFO L82 PathProgramCache]: Analyzing trace with hash 256747969, now seen corresponding path program 2 times [2019-12-27 06:36:26,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:36:26,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268041791] [2019-12-27 06:36:26,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:36:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:36:26,170 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 06:36:26,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268041791] [2019-12-27 06:36:26,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:36:26,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:36:26,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219350452] [2019-12-27 06:36:26,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:36:26,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:36:26,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:36:26,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:36:26,172 INFO L87 Difference]: Start difference. First operand 319 states and 591 transitions. Second operand 3 states. [2019-12-27 06:36:26,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:36:26,185 INFO L93 Difference]: Finished difference Result 307 states and 552 transitions. [2019-12-27 06:36:26,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:36:26,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-27 06:36:26,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:36:26,186 INFO L225 Difference]: With dead ends: 307 [2019-12-27 06:36:26,186 INFO L226 Difference]: Without dead ends: 307 [2019-12-27 06:36:26,187 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 06:36:26,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-12-27 06:36:26,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 280. [2019-12-27 06:36:26,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-12-27 06:36:26,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 501 transitions. [2019-12-27 06:36:26,192 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 501 transitions. Word has length 56 [2019-12-27 06:36:26,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:36:26,192 INFO L462 AbstractCegarLoop]: Abstraction has 280 states and 501 transitions. [2019-12-27 06:36:26,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:36:26,192 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 501 transitions. [2019-12-27 06:36:26,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:36:26,193 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:36:26,193 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] [2019-12-27 06:36:26,193 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:36:26,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:36:26,194 INFO L82 PathProgramCache]: Analyzing trace with hash 776087573, now seen corresponding path program 1 times [2019-12-27 06:36:26,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:36:26,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406077488] [2019-12-27 06:36:26,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:36:26,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:36:26,444 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 06:36:26,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406077488] [2019-12-27 06:36:26,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:36:26,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 06:36:26,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222666367] [2019-12-27 06:36:26,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 06:36:26,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:36:26,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 06:36:26,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:36:26,447 INFO L87 Difference]: Start difference. First operand 280 states and 501 transitions. Second operand 13 states. [2019-12-27 06:36:27,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:36:27,006 INFO L93 Difference]: Finished difference Result 468 states and 816 transitions. [2019-12-27 06:36:27,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 06:36:27,006 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-27 06:36:27,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:36:27,007 INFO L225 Difference]: With dead ends: 468 [2019-12-27 06:36:27,007 INFO L226 Difference]: Without dead ends: 434 [2019-12-27 06:36:27,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2019-12-27 06:36:27,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2019-12-27 06:36:27,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 388. [2019-12-27 06:36:27,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-12-27 06:36:27,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 686 transitions. [2019-12-27 06:36:27,016 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 686 transitions. Word has length 57 [2019-12-27 06:36:27,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:36:27,016 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 686 transitions. [2019-12-27 06:36:27,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 06:36:27,017 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 686 transitions. [2019-12-27 06:36:27,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:36:27,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:36:27,018 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] [2019-12-27 06:36:27,018 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:36:27,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:36:27,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1732220053, now seen corresponding path program 2 times [2019-12-27 06:36:27,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:36:27,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308246621] [2019-12-27 06:36:27,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:36:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:36:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:36:27,143 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:36:27,143 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:36:27,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1214~0.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1214~0.base_25|) |v_ULTIMATE.start_main_~#t1214~0.offset_19| 0)) |v_#memory_int_21|) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 v_~y$w_buff1~0_26) (= v_~__unbuffered_p2_EBX~0_10 0) (= v_~y$r_buff0_thd2~0_20 0) (= v_~main$tmp_guard0~0_9 0) (= v_~a~0_11 0) (= |v_#NULL.offset_6| 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1214~0.base_25| 4)) (= v_~y$read_delayed~0_7 0) (= v_~main$tmp_guard1~0_11 0) (= 0 v_~y$r_buff1_thd0~0_51) (= v_~y$w_buff0_used~0_108 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~y$flush_delayed~0_14) (= v_~y$r_buff0_thd3~0_26 0) (= 0 v_~y$w_buff0~0_29) (= v_~y$r_buff1_thd1~0_9 0) (= 0 v_~__unbuffered_p2_EAX~0_10) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~y$r_buff0_thd0~0_80 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1214~0.base_25|) (= 0 v_~y$read_delayed_var~0.base_7) (= (store .cse0 |v_ULTIMATE.start_main_~#t1214~0.base_25| 1) |v_#valid_62|) (= 0 v_~y$r_buff1_thd2~0_17) (= 0 v_~z~0_9) (= 0 v_~__unbuffered_cnt~0_22) (= v_~y$mem_tmp~0_10 0) (= v_~x~0_12 0) (= v_~y$w_buff1_used~0_69 0) (= 0 v_~y$r_buff1_thd3~0_19) (= v_~y~0_26 0) (= v_~y$r_buff0_thd1~0_6 0) (= 0 |v_ULTIMATE.start_main_~#t1214~0.offset_19|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1214~0.base_25|) 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1216~0.base=|v_ULTIMATE.start_main_~#t1216~0.base_25|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_13|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_12|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_10|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_13|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_12|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_14|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_8|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_15|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_12|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_14|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~y$w_buff1~0=v_~y$w_buff1~0_26, ULTIMATE.start_main_~#t1215~0.offset=|v_ULTIMATE.start_main_~#t1215~0.offset_19|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_20, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ULTIMATE.start_main_~#t1216~0.offset=|v_ULTIMATE.start_main_~#t1216~0.offset_19|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_51, ~x~0=v_~x~0_12, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_108, ULTIMATE.start_main_~#t1214~0.offset=|v_ULTIMATE.start_main_~#t1214~0.offset_19|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_15|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_12|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_17|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_10|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_15|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_9, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_12|, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_26, ~y~0=v_~y~0_26, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_8|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_14|, ULTIMATE.start_main_~#t1215~0.base=|v_ULTIMATE.start_main_~#t1215~0.base_25|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_13|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_~#t1214~0.base=|v_ULTIMATE.start_main_~#t1214~0.base_25|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_80, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_69} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1216~0.base, ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ULTIMATE.start_main_~#t1215~0.offset, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1216~0.offset, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t1214~0.offset, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_~#t1215~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1214~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 06:36:27,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-1-->L812: Formula: (and (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1215~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t1215~0.base_13| 0)) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1215~0.base_13|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1215~0.base_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1215~0.base_13| 4)) (= 0 |v_ULTIMATE.start_main_~#t1215~0.offset_11|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1215~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1215~0.base_13|) |v_ULTIMATE.start_main_~#t1215~0.offset_11| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1215~0.offset=|v_ULTIMATE.start_main_~#t1215~0.offset_11|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1215~0.base=|v_ULTIMATE.start_main_~#t1215~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1215~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1215~0.base] because there is no mapped edge [2019-12-27 06:36:27,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L812-1-->L814: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1216~0.base_13|) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1216~0.base_13| 1)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1216~0.base_13|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1216~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1216~0.base_13|) |v_ULTIMATE.start_main_~#t1216~0.offset_11| 2)) |v_#memory_int_13|) (not (= 0 |v_ULTIMATE.start_main_~#t1216~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t1216~0.offset_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1216~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1216~0.base=|v_ULTIMATE.start_main_~#t1216~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1216~0.offset=|v_ULTIMATE.start_main_~#t1216~0.offset_11|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1216~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1216~0.offset, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-27 06:36:27,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] P2ENTRY-->L4-3: Formula: (and (= 0 (mod v_~y$w_buff1_used~0_47 256)) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4| v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_6) (= 1 v_~y$w_buff0_used~0_77) (= 2 v_~y$w_buff0~0_14) (= v_P2Thread1of1ForFork0_~arg.offset_4 |v_P2Thread1of1ForFork0_#in~arg.offset_4|) (= v_P2Thread1of1ForFork0_~arg.base_4 |v_P2Thread1of1ForFork0_#in~arg.base_4|) (= v_~y$w_buff1_used~0_47 v_~y$w_buff0_used~0_78) (= v_~y$w_buff0~0_15 v_~y$w_buff1~0_14)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff0~0=v_~y$w_buff0~0_15, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_4|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_4, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_4|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_14, ~y$w_buff0~0=v_~y$w_buff0~0_14, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_4, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_4|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_47} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 06:36:27,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] P0ENTRY-->P0EXIT: Formula: (and (= 1 v_~a~0_7) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 1 v_~x~0_9) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{~a~0=v_~a~0_7, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_9, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 06:36:27,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1446542332 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1446542332 256)))) (or (and (= ~y$w_buff0_used~0_In-1446542332 |P2Thread1of1ForFork0_#t~ite11_Out-1446542332|) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite11_Out-1446542332| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1446542332, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1446542332} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1446542332, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out-1446542332|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1446542332} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 06:36:27,155 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L789-->L789-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In1936061990 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In1936061990 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1936061990 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1936061990 256)))) (or (and (= ~y$w_buff1_used~0_In1936061990 |P2Thread1of1ForFork0_#t~ite12_Out1936061990|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite12_Out1936061990|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1936061990, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1936061990, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1936061990, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1936061990} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1936061990, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1936061990, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out1936061990|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1936061990, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1936061990} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 06:36:27,156 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L790-->L791: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1428313746 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1428313746 256)))) (or (and (= ~y$r_buff0_thd3~0_Out-1428313746 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd3~0_In-1428313746 ~y$r_buff0_thd3~0_Out-1428313746)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1428313746, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1428313746} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1428313746, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1428313746, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out-1428313746|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 06:36:27,156 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In1309285719 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1309285719 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In1309285719 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1309285719 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite14_Out1309285719| ~y$r_buff1_thd3~0_In1309285719) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite14_Out1309285719| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1309285719, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1309285719, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1309285719, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1309285719} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out1309285719|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1309285719, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1309285719, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1309285719, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1309285719} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 06:36:27,157 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L791-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~y$r_buff1_thd3~0_15 |v_P2Thread1of1ForFork0_#t~ite14_8|)) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_7|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 06:36:27,158 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L752-2-->L752-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In-1774198909 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1774198909 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite3_Out-1774198909| ~y$w_buff1~0_In-1774198909) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite3_Out-1774198909| ~y~0_In-1774198909) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1774198909, ~y$w_buff1~0=~y$w_buff1~0_In-1774198909, ~y~0=~y~0_In-1774198909, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1774198909} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1774198909, ~y$w_buff1~0=~y$w_buff1~0_In-1774198909, ~y~0=~y~0_In-1774198909, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out-1774198909|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1774198909} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 06:36:27,158 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L752-4-->L753: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork2_#t~ite3_8|) InVars {P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_8|} OutVars{P1Thread1of1ForFork2_#t~ite4=|v_P1Thread1of1ForFork2_#t~ite4_7|, ~y~0=v_~y~0_18, P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, ~y~0, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 06:36:27,158 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L753-->L753-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In760834627 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In760834627 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite5_Out760834627|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite5_Out760834627| ~y$w_buff0_used~0_In760834627)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In760834627, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In760834627} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In760834627, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In760834627, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out760834627|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 06:36:27,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L754-->L754-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-383692564 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-383692564 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-383692564 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-383692564 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite6_Out-383692564|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-383692564 |P1Thread1of1ForFork2_#t~ite6_Out-383692564|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-383692564, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-383692564, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-383692564, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-383692564} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-383692564, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-383692564, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-383692564, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out-383692564|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-383692564} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 06:36:27,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L755-->L755-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-67243437 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-67243437 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite7_Out-67243437| ~y$r_buff0_thd2~0_In-67243437)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite7_Out-67243437| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-67243437, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-67243437} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-67243437, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-67243437, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out-67243437|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 06:36:27,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L756-->L756-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd2~0_In-638289171 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-638289171 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-638289171 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-638289171 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite8_Out-638289171| ~y$r_buff1_thd2~0_In-638289171) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork2_#t~ite8_Out-638289171| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-638289171, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-638289171, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-638289171, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-638289171} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-638289171, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-638289171, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-638289171|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-638289171, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-638289171} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 06:36:27,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L756-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite8_8| v_~y$r_buff1_thd2~0_13) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 06:36:27,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L814-1-->L820: Formula: (and (= v_~main$tmp_guard0~0_5 1) (= 3 v_~__unbuffered_cnt~0_12)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 06:36:27,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L820-2-->L820-5: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-588693704 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-588693704 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite18_Out-588693704| |ULTIMATE.start_main_#t~ite19_Out-588693704|))) (or (and (= |ULTIMATE.start_main_#t~ite18_Out-588693704| ~y~0_In-588693704) .cse0 (or .cse1 .cse2)) (and (not .cse1) (not .cse2) (= ~y$w_buff1~0_In-588693704 |ULTIMATE.start_main_#t~ite18_Out-588693704|) .cse0))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-588693704, ~y~0=~y~0_In-588693704, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-588693704, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-588693704} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-588693704, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-588693704|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-588693704|, ~y~0=~y~0_In-588693704, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-588693704, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-588693704} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 06:36:27,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In2115752483 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2115752483 256)))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out2115752483| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite20_Out2115752483| ~y$w_buff0_used~0_In2115752483)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2115752483, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2115752483} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2115752483, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2115752483, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out2115752483|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 06:36:27,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L822-->L822-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd0~0_In1178105438 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1178105438 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1178105438 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1178105438 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite21_Out1178105438|)) (and (= ~y$w_buff1_used~0_In1178105438 |ULTIMATE.start_main_#t~ite21_Out1178105438|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1178105438, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1178105438, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1178105438, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1178105438} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1178105438, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1178105438, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1178105438|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1178105438, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1178105438} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 06:36:27,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-266449445 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-266449445 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite22_Out-266449445| ~y$r_buff0_thd0~0_In-266449445)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite22_Out-266449445| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-266449445, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-266449445} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-266449445, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-266449445, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-266449445|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 06:36:27,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L824-->L824-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1147781208 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1147781208 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1147781208 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1147781208 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite23_Out-1147781208| ~y$r_buff1_thd0~0_In-1147781208) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite23_Out-1147781208| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1147781208, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1147781208, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1147781208, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1147781208} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1147781208, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1147781208, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1147781208, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1147781208|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1147781208} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 06:36:27,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L833-->L833-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1539498019 256)))) (or (and (= |ULTIMATE.start_main_#t~ite32_In-1539498019| |ULTIMATE.start_main_#t~ite32_Out-1539498019|) (not .cse0) (= ~y$w_buff1~0_In-1539498019 |ULTIMATE.start_main_#t~ite33_Out-1539498019|)) (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1539498019 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-1539498019 256)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1539498019 256))) (and (= (mod ~y$r_buff1_thd0~0_In-1539498019 256) 0) .cse1))) (= |ULTIMATE.start_main_#t~ite33_Out-1539498019| |ULTIMATE.start_main_#t~ite32_Out-1539498019|) (= ~y$w_buff1~0_In-1539498019 |ULTIMATE.start_main_#t~ite32_Out-1539498019|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1539498019, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1539498019, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1539498019, ~weak$$choice2~0=~weak$$choice2~0_In-1539498019, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1539498019, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_In-1539498019|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1539498019} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1539498019, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1539498019, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1539498019, ~weak$$choice2~0=~weak$$choice2~0_In-1539498019, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-1539498019|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1539498019, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out-1539498019|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1539498019} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33] because there is no mapped edge [2019-12-27 06:36:27,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L834-->L834-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1220761953 256) 0))) (or (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1220761953 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In1220761953 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In1220761953 256) 0)) (and .cse1 (= (mod ~y$r_buff1_thd0~0_In1220761953 256) 0)))) (= |ULTIMATE.start_main_#t~ite35_Out1220761953| |ULTIMATE.start_main_#t~ite36_Out1220761953|) (= |ULTIMATE.start_main_#t~ite35_Out1220761953| ~y$w_buff0_used~0_In1220761953)) (and (= |ULTIMATE.start_main_#t~ite36_Out1220761953| ~y$w_buff0_used~0_In1220761953) (not .cse0) (= |ULTIMATE.start_main_#t~ite35_In1220761953| |ULTIMATE.start_main_#t~ite35_Out1220761953|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1220761953, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1220761953, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In1220761953|, ~weak$$choice2~0=~weak$$choice2~0_In1220761953, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1220761953, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1220761953} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1220761953, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1220761953, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1220761953|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1220761953|, ~weak$$choice2~0=~weak$$choice2~0_In1220761953, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1220761953, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1220761953} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 06:36:27,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L835-->L835-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1699965945 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_In1699965945| |ULTIMATE.start_main_#t~ite38_Out1699965945|) (not .cse0) (= |ULTIMATE.start_main_#t~ite39_Out1699965945| ~y$w_buff1_used~0_In1699965945)) (and (= |ULTIMATE.start_main_#t~ite38_Out1699965945| ~y$w_buff1_used~0_In1699965945) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1699965945 256) 0))) (or (and (= (mod ~y$r_buff1_thd0~0_In1699965945 256) 0) .cse1) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1699965945 256))) (= (mod ~y$w_buff0_used~0_In1699965945 256) 0))) (= |ULTIMATE.start_main_#t~ite38_Out1699965945| |ULTIMATE.start_main_#t~ite39_Out1699965945|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1699965945, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1699965945, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In1699965945|, ~weak$$choice2~0=~weak$$choice2~0_In1699965945, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1699965945, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1699965945} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1699965945, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1699965945|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1699965945, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1699965945|, ~weak$$choice2~0=~weak$$choice2~0_In1699965945, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1699965945, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1699965945} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 06:36:27,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L836-->L837: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~y$r_buff0_thd0~0_64 v_~y$r_buff0_thd0~0_63)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_21, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 06:36:27,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L839-->L4: Formula: (and (= 0 v_~y$flush_delayed~0_10) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_8 256)) (= v_~y~0_23 v_~y$mem_tmp~0_7) (not (= 0 (mod v_~y$flush_delayed~0_11 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y~0=v_~y~0_23, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:36:27,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} 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_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 06:36:27,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:36:27 BasicIcfg [2019-12-27 06:36:27,265 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:36:27,267 INFO L168 Benchmark]: Toolchain (without parser) took 16233.73 ms. Allocated memory was 141.0 MB in the beginning and 875.6 MB in the end (delta: 734.5 MB). Free memory was 100.7 MB in the beginning and 552.5 MB in the end (delta: -451.8 MB). Peak memory consumption was 282.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:36:27,268 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 141.0 MB. Free memory was 121.2 MB in the beginning and 121.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 06:36:27,268 INFO L168 Benchmark]: CACSL2BoogieTranslator took 835.36 ms. Allocated memory was 141.0 MB in the beginning and 202.4 MB in the end (delta: 61.3 MB). Free memory was 100.5 MB in the beginning and 156.2 MB in the end (delta: -55.7 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. [2019-12-27 06:36:27,269 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.83 ms. Allocated memory is still 202.4 MB. Free memory was 156.2 MB in the beginning and 152.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 06:36:27,270 INFO L168 Benchmark]: Boogie Preprocessor took 71.56 ms. Allocated memory is still 202.4 MB. Free memory was 152.9 MB in the beginning and 150.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:36:27,270 INFO L168 Benchmark]: RCFGBuilder took 842.09 ms. Allocated memory is still 202.4 MB. Free memory was 150.3 MB in the beginning and 103.8 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. [2019-12-27 06:36:27,271 INFO L168 Benchmark]: TraceAbstraction took 14409.20 ms. Allocated memory was 202.4 MB in the beginning and 875.6 MB in the end (delta: 673.2 MB). Free memory was 103.1 MB in the beginning and 552.5 MB in the end (delta: -449.4 MB). Peak memory consumption was 223.8 MB. Max. memory is 7.1 GB. [2019-12-27 06:36:27,276 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 141.0 MB. Free memory was 121.2 MB in the beginning and 121.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 835.36 ms. Allocated memory was 141.0 MB in the beginning and 202.4 MB in the end (delta: 61.3 MB). Free memory was 100.5 MB in the beginning and 156.2 MB in the end (delta: -55.7 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.83 ms. Allocated memory is still 202.4 MB. Free memory was 156.2 MB in the beginning and 152.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 71.56 ms. Allocated memory is still 202.4 MB. Free memory was 152.9 MB in the beginning and 150.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 842.09 ms. Allocated memory is still 202.4 MB. Free memory was 150.3 MB in the beginning and 103.8 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14409.20 ms. Allocated memory was 202.4 MB in the beginning and 875.6 MB in the end (delta: 673.2 MB). Free memory was 103.1 MB in the beginning and 552.5 MB in the end (delta: -449.4 MB). Peak memory consumption was 223.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 164 ProgramPointsBefore, 84 ProgramPointsAfterwards, 195 TransitionsBefore, 93 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 26 ChoiceCompositions, 4106 VarBasedMoverChecksPositive, 151 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 48939 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t1214, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t1215, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t1216, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L771] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L772] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L773] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L774] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L775] 3 y$r_buff0_thd3 = (_Bool)1 [L778] 3 z = 1 [L781] 3 __unbuffered_p2_EAX = z [L784] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 2 x = 2 [L749] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L788] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L789] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L752] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L754] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L755] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L820] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L822] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L823] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L824] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L827] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L828] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L829] 0 y$flush_delayed = weak$$choice2 [L830] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L832] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L832] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L833] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L834] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L835] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L837] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.1s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1157 SDtfs, 940 SDslu, 1931 SDs, 0 SdLazy, 801 SolverSat, 82 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24300occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 2804 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 519 NumberOfCodeBlocks, 519 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 450 ConstructedInterpolants, 0 QuantifiedInterpolants, 69017 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...