/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix001_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 19:38:34,842 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 19:38:34,845 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 19:38:34,864 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 19:38:34,865 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 19:38:34,867 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 19:38:34,869 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 19:38:34,879 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 19:38:34,882 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 19:38:34,885 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 19:38:34,887 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 19:38:34,889 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 19:38:34,890 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 19:38:34,891 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 19:38:34,894 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 19:38:34,895 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 19:38:34,897 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 19:38:34,898 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 19:38:34,899 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 19:38:34,904 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 19:38:34,908 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 19:38:34,910 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 19:38:34,910 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 19:38:34,911 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 19:38:34,913 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 19:38:34,913 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 19:38:34,913 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 19:38:34,914 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 19:38:34,915 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 19:38:34,915 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 19:38:34,916 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 19:38:34,916 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 19:38:34,917 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 19:38:34,918 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 19:38:34,919 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 19:38:34,919 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 19:38:34,919 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 19:38:34,920 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 19:38:34,920 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 19:38:34,921 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 19:38:34,921 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 19:38:34,922 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 19:38:34,936 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 19:38:34,936 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 19:38:34,941 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 19:38:34,941 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 19:38:34,941 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 19:38:34,941 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 19:38:34,942 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 19:38:34,942 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 19:38:34,942 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 19:38:34,942 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 19:38:34,942 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 19:38:34,942 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 19:38:34,944 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 19:38:34,944 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 19:38:34,944 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 19:38:34,944 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 19:38:34,944 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 19:38:34,945 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 19:38:34,945 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 19:38:34,945 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 19:38:34,945 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 19:38:34,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 19:38:34,946 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 19:38:34,946 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 19:38:34,946 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 19:38:34,947 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 19:38:34,947 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 19:38:34,947 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 19:38:34,947 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 19:38:34,947 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 19:38:34,947 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 19:38:34,948 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 19:38:35,226 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 19:38:35,248 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 19:38:35,251 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 19:38:35,253 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 19:38:35,253 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 19:38:35,254 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix001_tso.opt.i [2019-12-27 19:38:35,321 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a2f7506b/69ab426cfb7147d598de7f037babfc43/FLAGa4df0c24f [2019-12-27 19:38:35,877 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 19:38:35,879 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix001_tso.opt.i [2019-12-27 19:38:35,903 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a2f7506b/69ab426cfb7147d598de7f037babfc43/FLAGa4df0c24f [2019-12-27 19:38:36,108 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a2f7506b/69ab426cfb7147d598de7f037babfc43 [2019-12-27 19:38:36,118 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 19:38:36,120 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 19:38:36,121 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 19:38:36,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 19:38:36,125 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 19:38:36,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:38:36" (1/1) ... [2019-12-27 19:38:36,130 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32b5cce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:36, skipping insertion in model container [2019-12-27 19:38:36,130 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:38:36" (1/1) ... [2019-12-27 19:38:36,138 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 19:38:36,187 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 19:38:36,743 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:38:36,756 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 19:38:36,849 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:38:36,921 INFO L208 MainTranslator]: Completed translation [2019-12-27 19:38:36,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:36 WrapperNode [2019-12-27 19:38:36,921 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 19:38:36,922 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 19:38:36,922 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 19:38:36,923 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 19:38:36,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:36" (1/1) ... [2019-12-27 19:38:36,953 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:36" (1/1) ... [2019-12-27 19:38:36,994 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 19:38:36,994 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 19:38:36,995 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 19:38:36,995 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 19:38:37,005 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:36" (1/1) ... [2019-12-27 19:38:37,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:36" (1/1) ... [2019-12-27 19:38:37,011 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:36" (1/1) ... [2019-12-27 19:38:37,011 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:36" (1/1) ... [2019-12-27 19:38:37,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:36" (1/1) ... [2019-12-27 19:38:37,028 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:36" (1/1) ... [2019-12-27 19:38:37,032 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:36" (1/1) ... [2019-12-27 19:38:37,040 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 19:38:37,041 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 19:38:37,041 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 19:38:37,041 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 19:38:37,042 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 19:38:37,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 19:38:37,137 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 19:38:37,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 19:38:37,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 19:38:37,137 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 19:38:37,138 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 19:38:37,138 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 19:38:37,138 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 19:38:37,138 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 19:38:37,138 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 19:38:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 19:38:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 19:38:37,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 19:38:37,141 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 19:38:38,007 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 19:38:38,007 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 19:38:38,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:38:38 BoogieIcfgContainer [2019-12-27 19:38:38,009 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 19:38:38,011 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 19:38:38,013 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 19:38:38,017 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 19:38:38,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:38:36" (1/3) ... [2019-12-27 19:38:38,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e7c7849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:38:38, skipping insertion in model container [2019-12-27 19:38:38,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:38:36" (2/3) ... [2019-12-27 19:38:38,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e7c7849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:38:38, skipping insertion in model container [2019-12-27 19:38:38,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:38:38" (3/3) ... [2019-12-27 19:38:38,023 INFO L109 eAbstractionObserver]: Analyzing ICFG mix001_tso.opt.i [2019-12-27 19:38:38,033 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 19:38:38,034 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 19:38:38,041 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 19:38:38,042 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 19:38:38,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,109 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,109 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,112 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,112 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,133 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,133 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,133 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,134 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,134 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,134 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,162 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,162 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,164 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,172 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,172 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,186 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,189 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:38:38,205 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 19:38:38,228 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:38:38,228 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:38:38,228 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:38:38,228 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:38:38,228 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:38:38,228 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:38:38,229 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:38:38,229 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:38:38,255 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 243 transitions [2019-12-27 19:38:38,257 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-27 19:38:38,393 INFO L132 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-27 19:38:38,393 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:38:38,410 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 561 event pairs. 0/182 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-27 19:38:38,440 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-27 19:38:38,534 INFO L132 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-27 19:38:38,534 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:38:38,545 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 561 event pairs. 0/182 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-27 19:38:38,578 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-27 19:38:38,579 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 19:38:42,258 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-27 19:38:42,369 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-27 19:38:42,694 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 19:38:42,841 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 19:38:42,868 INFO L206 etLargeBlockEncoding]: Checked pairs total: 134958 [2019-12-27 19:38:42,869 INFO L214 etLargeBlockEncoding]: Total number of compositions: 125 [2019-12-27 19:38:42,872 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 107 places, 127 transitions [2019-12-27 19:38:46,528 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 43566 states. [2019-12-27 19:38:46,530 INFO L276 IsEmpty]: Start isEmpty. Operand 43566 states. [2019-12-27 19:38:46,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 19:38:46,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:38:46,537 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:38:46,537 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 19:38:46,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:38:46,542 INFO L82 PathProgramCache]: Analyzing trace with hash -616580539, now seen corresponding path program 1 times [2019-12-27 19:38:46,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:38:46,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919936130] [2019-12-27 19:38:46,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:38:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:38:46,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:38:46,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919936130] [2019-12-27 19:38:46,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:38:46,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:38:46,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [802259243] [2019-12-27 19:38:46,818 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:38:46,825 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:38:46,841 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 19:38:46,841 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:38:46,845 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:38:46,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:38:46,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:38:46,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:38:46,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:38:46,865 INFO L87 Difference]: Start difference. First operand 43566 states. Second operand 3 states. [2019-12-27 19:38:47,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:38:47,676 INFO L93 Difference]: Finished difference Result 43014 states and 174370 transitions. [2019-12-27 19:38:47,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:38:47,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 19:38:47,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:38:48,011 INFO L225 Difference]: With dead ends: 43014 [2019-12-27 19:38:48,011 INFO L226 Difference]: Without dead ends: 40044 [2019-12-27 19:38:48,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:38:49,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40044 states. [2019-12-27 19:38:51,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40044 to 40044. [2019-12-27 19:38:51,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40044 states. [2019-12-27 19:38:52,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40044 states to 40044 states and 162217 transitions. [2019-12-27 19:38:52,787 INFO L78 Accepts]: Start accepts. Automaton has 40044 states and 162217 transitions. Word has length 7 [2019-12-27 19:38:52,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:38:52,788 INFO L462 AbstractCegarLoop]: Abstraction has 40044 states and 162217 transitions. [2019-12-27 19:38:52,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:38:52,789 INFO L276 IsEmpty]: Start isEmpty. Operand 40044 states and 162217 transitions. [2019-12-27 19:38:52,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 19:38:52,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:38:52,795 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:38:52,796 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 19:38:52,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:38:52,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1408183665, now seen corresponding path program 1 times [2019-12-27 19:38:52,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:38:52,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162033807] [2019-12-27 19:38:52,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:38:52,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:38:52,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:38:52,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162033807] [2019-12-27 19:38:52,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:38:52,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:38:52,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1758874378] [2019-12-27 19:38:52,964 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:38:52,965 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:38:52,969 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 19:38:52,969 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:38:52,970 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:38:52,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:38:52,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:38:52,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:38:52,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:38:52,972 INFO L87 Difference]: Start difference. First operand 40044 states and 162217 transitions. Second operand 4 states. [2019-12-27 19:38:54,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:38:54,162 INFO L93 Difference]: Finished difference Result 63338 states and 247308 transitions. [2019-12-27 19:38:54,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:38:54,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 19:38:54,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:38:54,749 INFO L225 Difference]: With dead ends: 63338 [2019-12-27 19:38:54,749 INFO L226 Difference]: Without dead ends: 63310 [2019-12-27 19:38:54,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:38:55,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63310 states. [2019-12-27 19:38:57,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63310 to 60640. [2019-12-27 19:38:57,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60640 states. [2019-12-27 19:38:57,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60640 states to 60640 states and 238729 transitions. [2019-12-27 19:38:57,670 INFO L78 Accepts]: Start accepts. Automaton has 60640 states and 238729 transitions. Word has length 13 [2019-12-27 19:38:57,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:38:57,670 INFO L462 AbstractCegarLoop]: Abstraction has 60640 states and 238729 transitions. [2019-12-27 19:38:57,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:38:57,670 INFO L276 IsEmpty]: Start isEmpty. Operand 60640 states and 238729 transitions. [2019-12-27 19:38:57,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 19:38:57,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:38:57,679 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:38:57,679 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 19:38:57,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:38:57,680 INFO L82 PathProgramCache]: Analyzing trace with hash -903300069, now seen corresponding path program 1 times [2019-12-27 19:38:57,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:38:57,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086875673] [2019-12-27 19:38:57,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:38:57,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:38:57,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:38:57,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086875673] [2019-12-27 19:38:57,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:38:57,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:38:57,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [967048877] [2019-12-27 19:38:57,787 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:38:57,789 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:38:57,793 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 19:38:57,793 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:38:57,861 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:38:57,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:38:57,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:38:57,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:38:57,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:38:57,863 INFO L87 Difference]: Start difference. First operand 60640 states and 238729 transitions. Second operand 5 states. [2019-12-27 19:38:59,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:38:59,100 INFO L93 Difference]: Finished difference Result 77848 states and 302341 transitions. [2019-12-27 19:38:59,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:38:59,100 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 19:38:59,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:38:59,348 INFO L225 Difference]: With dead ends: 77848 [2019-12-27 19:38:59,348 INFO L226 Difference]: Without dead ends: 77820 [2019-12-27 19:38:59,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:39:02,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77820 states. [2019-12-27 19:39:03,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77820 to 68750. [2019-12-27 19:39:03,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68750 states. [2019-12-27 19:39:04,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68750 states to 68750 states and 269586 transitions. [2019-12-27 19:39:04,301 INFO L78 Accepts]: Start accepts. Automaton has 68750 states and 269586 transitions. Word has length 16 [2019-12-27 19:39:04,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:39:04,302 INFO L462 AbstractCegarLoop]: Abstraction has 68750 states and 269586 transitions. [2019-12-27 19:39:04,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:39:04,302 INFO L276 IsEmpty]: Start isEmpty. Operand 68750 states and 269586 transitions. [2019-12-27 19:39:04,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 19:39:04,311 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:39:04,311 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:39:04,312 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 19:39:04,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:39:04,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1875943098, now seen corresponding path program 1 times [2019-12-27 19:39:04,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:39:04,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646355650] [2019-12-27 19:39:04,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:39:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:39:04,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:39:04,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646355650] [2019-12-27 19:39:04,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:39:04,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:39:04,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [674393146] [2019-12-27 19:39:04,379 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:39:04,382 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:39:04,384 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 19 states and 18 transitions. [2019-12-27 19:39:04,384 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:39:04,384 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:39:04,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:39:04,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:39:04,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:39:04,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:39:04,386 INFO L87 Difference]: Start difference. First operand 68750 states and 269586 transitions. Second operand 3 states. [2019-12-27 19:39:04,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:39:04,727 INFO L93 Difference]: Finished difference Result 65858 states and 256753 transitions. [2019-12-27 19:39:04,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:39:04,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 19:39:04,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:39:04,897 INFO L225 Difference]: With dead ends: 65858 [2019-12-27 19:39:04,897 INFO L226 Difference]: Without dead ends: 65858 [2019-12-27 19:39:04,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:39:08,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65858 states. [2019-12-27 19:39:09,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65858 to 65858. [2019-12-27 19:39:09,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65858 states. [2019-12-27 19:39:09,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65858 states to 65858 states and 256753 transitions. [2019-12-27 19:39:09,526 INFO L78 Accepts]: Start accepts. Automaton has 65858 states and 256753 transitions. Word has length 18 [2019-12-27 19:39:09,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:39:09,527 INFO L462 AbstractCegarLoop]: Abstraction has 65858 states and 256753 transitions. [2019-12-27 19:39:09,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:39:09,527 INFO L276 IsEmpty]: Start isEmpty. Operand 65858 states and 256753 transitions. [2019-12-27 19:39:09,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 19:39:09,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:39:09,536 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:39:09,537 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 19:39:09,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:39:09,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1842577503, now seen corresponding path program 1 times [2019-12-27 19:39:09,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:39:09,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265389204] [2019-12-27 19:39:09,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:39:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:39:09,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:39:09,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265389204] [2019-12-27 19:39:09,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:39:09,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:39:09,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [735223266] [2019-12-27 19:39:09,608 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:39:09,611 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:39:09,615 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 27 transitions. [2019-12-27 19:39:09,615 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:39:09,616 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:39:09,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:39:09,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:39:09,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:39:09,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:39:09,617 INFO L87 Difference]: Start difference. First operand 65858 states and 256753 transitions. Second operand 3 states. [2019-12-27 19:39:09,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:39:09,935 INFO L93 Difference]: Finished difference Result 63720 states and 249248 transitions. [2019-12-27 19:39:09,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:39:09,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-27 19:39:09,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:39:10,091 INFO L225 Difference]: With dead ends: 63720 [2019-12-27 19:39:10,091 INFO L226 Difference]: Without dead ends: 63552 [2019-12-27 19:39:10,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:39:11,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63552 states. [2019-12-27 19:39:14,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63552 to 63552. [2019-12-27 19:39:14,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63552 states. [2019-12-27 19:39:15,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63552 states to 63552 states and 248652 transitions. [2019-12-27 19:39:15,025 INFO L78 Accepts]: Start accepts. Automaton has 63552 states and 248652 transitions. Word has length 19 [2019-12-27 19:39:15,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:39:15,026 INFO L462 AbstractCegarLoop]: Abstraction has 63552 states and 248652 transitions. [2019-12-27 19:39:15,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:39:15,026 INFO L276 IsEmpty]: Start isEmpty. Operand 63552 states and 248652 transitions. [2019-12-27 19:39:15,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 19:39:15,046 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:39:15,046 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:39:15,047 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 19:39:15,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:39:15,047 INFO L82 PathProgramCache]: Analyzing trace with hash -813341911, now seen corresponding path program 1 times [2019-12-27 19:39:15,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:39:15,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409818867] [2019-12-27 19:39:15,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:39:15,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:39:15,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:39:15,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409818867] [2019-12-27 19:39:15,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:39:15,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:39:15,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1875733730] [2019-12-27 19:39:15,146 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:39:15,148 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:39:15,156 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 72 transitions. [2019-12-27 19:39:15,156 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:39:15,157 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:39:15,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:39:15,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:39:15,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:39:15,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:39:15,159 INFO L87 Difference]: Start difference. First operand 63552 states and 248652 transitions. Second operand 5 states. [2019-12-27 19:39:16,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:39:16,786 INFO L93 Difference]: Finished difference Result 75918 states and 293174 transitions. [2019-12-27 19:39:16,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 19:39:16,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 19:39:16,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:39:16,986 INFO L225 Difference]: With dead ends: 75918 [2019-12-27 19:39:16,986 INFO L226 Difference]: Without dead ends: 75866 [2019-12-27 19:39:16,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:39:17,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75866 states. [2019-12-27 19:39:21,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75866 to 63240. [2019-12-27 19:39:21,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63240 states. [2019-12-27 19:39:21,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63240 states to 63240 states and 247578 transitions. [2019-12-27 19:39:21,203 INFO L78 Accepts]: Start accepts. Automaton has 63240 states and 247578 transitions. Word has length 22 [2019-12-27 19:39:21,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:39:21,204 INFO L462 AbstractCegarLoop]: Abstraction has 63240 states and 247578 transitions. [2019-12-27 19:39:21,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:39:21,204 INFO L276 IsEmpty]: Start isEmpty. Operand 63240 states and 247578 transitions. [2019-12-27 19:39:21,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 19:39:21,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:39:21,274 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:39:21,274 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 19:39:21,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:39:21,275 INFO L82 PathProgramCache]: Analyzing trace with hash 905995009, now seen corresponding path program 1 times [2019-12-27 19:39:21,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:39:21,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46678523] [2019-12-27 19:39:21,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:39:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:39:21,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:39:21,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46678523] [2019-12-27 19:39:21,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:39:21,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:39:21,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1000010009] [2019-12-27 19:39:21,359 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:39:21,365 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:39:21,386 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 132 transitions. [2019-12-27 19:39:21,387 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:39:21,440 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 19:39:21,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 19:39:21,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:39:21,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 19:39:21,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 19:39:21,442 INFO L87 Difference]: Start difference. First operand 63240 states and 247578 transitions. Second operand 8 states. [2019-12-27 19:39:23,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:39:23,954 INFO L93 Difference]: Finished difference Result 143092 states and 559760 transitions. [2019-12-27 19:39:23,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 19:39:23,954 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 19:39:23,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:39:24,284 INFO L225 Difference]: With dead ends: 143092 [2019-12-27 19:39:24,284 INFO L226 Difference]: Without dead ends: 121792 [2019-12-27 19:39:24,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2019-12-27 19:39:26,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121792 states. [2019-12-27 19:39:31,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121792 to 92036. [2019-12-27 19:39:31,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92036 states. [2019-12-27 19:39:31,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92036 states to 92036 states and 365860 transitions. [2019-12-27 19:39:31,463 INFO L78 Accepts]: Start accepts. Automaton has 92036 states and 365860 transitions. Word has length 33 [2019-12-27 19:39:31,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:39:31,463 INFO L462 AbstractCegarLoop]: Abstraction has 92036 states and 365860 transitions. [2019-12-27 19:39:31,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 19:39:31,464 INFO L276 IsEmpty]: Start isEmpty. Operand 92036 states and 365860 transitions. [2019-12-27 19:39:31,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 19:39:31,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:39:31,578 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:39:31,578 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 19:39:31,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:39:31,579 INFO L82 PathProgramCache]: Analyzing trace with hash 830115435, now seen corresponding path program 2 times [2019-12-27 19:39:31,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:39:31,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407804278] [2019-12-27 19:39:31,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:39:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:39:31,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:39:31,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407804278] [2019-12-27 19:39:31,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:39:31,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:39:31,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [398812940] [2019-12-27 19:39:31,640 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:39:31,646 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:39:31,667 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 140 transitions. [2019-12-27 19:39:31,667 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:39:31,668 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:39:31,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:39:31,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:39:31,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:39:31,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:39:31,669 INFO L87 Difference]: Start difference. First operand 92036 states and 365860 transitions. Second operand 3 states. [2019-12-27 19:39:32,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:39:32,270 INFO L93 Difference]: Finished difference Result 92010 states and 365783 transitions. [2019-12-27 19:39:32,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:39:32,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-27 19:39:32,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:39:33,223 INFO L225 Difference]: With dead ends: 92010 [2019-12-27 19:39:33,223 INFO L226 Difference]: Without dead ends: 92010 [2019-12-27 19:39:33,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:39:34,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92010 states. [2019-12-27 19:39:35,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92010 to 92010. [2019-12-27 19:39:35,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92010 states. [2019-12-27 19:39:36,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92010 states to 92010 states and 365783 transitions. [2019-12-27 19:39:36,185 INFO L78 Accepts]: Start accepts. Automaton has 92010 states and 365783 transitions. Word has length 33 [2019-12-27 19:39:36,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:39:36,185 INFO L462 AbstractCegarLoop]: Abstraction has 92010 states and 365783 transitions. [2019-12-27 19:39:36,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:39:36,185 INFO L276 IsEmpty]: Start isEmpty. Operand 92010 states and 365783 transitions. [2019-12-27 19:39:36,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 19:39:36,316 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:39:36,317 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] [2019-12-27 19:39:36,317 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 19:39:36,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:39:36,317 INFO L82 PathProgramCache]: Analyzing trace with hash -893352396, now seen corresponding path program 1 times [2019-12-27 19:39:36,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:39:36,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47931152] [2019-12-27 19:39:36,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:39:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:39:36,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:39:36,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47931152] [2019-12-27 19:39:36,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:39:36,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:39:36,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1977314395] [2019-12-27 19:39:36,419 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:39:36,425 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:39:36,448 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 99 states and 160 transitions. [2019-12-27 19:39:36,449 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:39:36,453 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:39:36,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:39:36,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:39:36,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:39:36,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:39:36,454 INFO L87 Difference]: Start difference. First operand 92010 states and 365783 transitions. Second operand 3 states. [2019-12-27 19:39:40,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:39:40,544 INFO L93 Difference]: Finished difference Result 92010 states and 361019 transitions. [2019-12-27 19:39:40,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:39:40,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-27 19:39:40,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:39:40,786 INFO L225 Difference]: With dead ends: 92010 [2019-12-27 19:39:40,787 INFO L226 Difference]: Without dead ends: 92010 [2019-12-27 19:39:40,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:39:41,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92010 states. [2019-12-27 19:39:42,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92010 to 91690. [2019-12-27 19:39:42,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91690 states. [2019-12-27 19:39:43,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91690 states to 91690 states and 359931 transitions. [2019-12-27 19:39:43,256 INFO L78 Accepts]: Start accepts. Automaton has 91690 states and 359931 transitions. Word has length 34 [2019-12-27 19:39:43,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:39:43,257 INFO L462 AbstractCegarLoop]: Abstraction has 91690 states and 359931 transitions. [2019-12-27 19:39:43,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:39:43,257 INFO L276 IsEmpty]: Start isEmpty. Operand 91690 states and 359931 transitions. [2019-12-27 19:39:43,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 19:39:43,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:39:43,392 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] [2019-12-27 19:39:43,392 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 19:39:43,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:39:43,392 INFO L82 PathProgramCache]: Analyzing trace with hash 641538334, now seen corresponding path program 1 times [2019-12-27 19:39:43,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:39:43,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699375704] [2019-12-27 19:39:43,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:39:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:39:43,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:39:43,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699375704] [2019-12-27 19:39:43,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:39:43,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 19:39:43,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [176563535] [2019-12-27 19:39:43,476 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:39:43,483 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:39:43,505 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 84 states and 128 transitions. [2019-12-27 19:39:43,505 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:39:43,507 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:39:43,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:39:43,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:39:43,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:39:43,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:39:43,508 INFO L87 Difference]: Start difference. First operand 91690 states and 359931 transitions. Second operand 4 states. [2019-12-27 19:39:44,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:39:44,114 INFO L93 Difference]: Finished difference Result 85444 states and 330368 transitions. [2019-12-27 19:39:44,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 19:39:44,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-27 19:39:44,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:39:45,201 INFO L225 Difference]: With dead ends: 85444 [2019-12-27 19:39:45,201 INFO L226 Difference]: Without dead ends: 85444 [2019-12-27 19:39:45,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:39:46,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85444 states. [2019-12-27 19:39:48,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85444 to 83632. [2019-12-27 19:39:48,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83632 states. [2019-12-27 19:39:48,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83632 states to 83632 states and 323744 transitions. [2019-12-27 19:39:48,369 INFO L78 Accepts]: Start accepts. Automaton has 83632 states and 323744 transitions. Word has length 35 [2019-12-27 19:39:48,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:39:48,370 INFO L462 AbstractCegarLoop]: Abstraction has 83632 states and 323744 transitions. [2019-12-27 19:39:48,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:39:48,370 INFO L276 IsEmpty]: Start isEmpty. Operand 83632 states and 323744 transitions. [2019-12-27 19:39:48,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 19:39:48,470 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:39:48,470 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] [2019-12-27 19:39:48,471 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 19:39:48,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:39:48,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1194202532, now seen corresponding path program 2 times [2019-12-27 19:39:48,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:39:48,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616680402] [2019-12-27 19:39:48,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:39:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:39:48,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:39:48,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616680402] [2019-12-27 19:39:48,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:39:48,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:39:48,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [895658090] [2019-12-27 19:39:48,579 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:39:48,586 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:39:48,606 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 78 states and 118 transitions. [2019-12-27 19:39:48,606 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:39:48,610 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:39:48,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:39:48,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:39:48,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:39:48,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:39:48,611 INFO L87 Difference]: Start difference. First operand 83632 states and 323744 transitions. Second operand 7 states. [2019-12-27 19:39:49,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:39:49,528 INFO L93 Difference]: Finished difference Result 139090 states and 535669 transitions. [2019-12-27 19:39:49,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 19:39:49,528 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-27 19:39:49,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:39:50,799 INFO L225 Difference]: With dead ends: 139090 [2019-12-27 19:39:50,800 INFO L226 Difference]: Without dead ends: 128258 [2019-12-27 19:39:50,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-12-27 19:39:51,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128258 states. [2019-12-27 19:39:57,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128258 to 104358. [2019-12-27 19:39:57,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104358 states. [2019-12-27 19:39:57,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104358 states to 104358 states and 405681 transitions. [2019-12-27 19:39:57,431 INFO L78 Accepts]: Start accepts. Automaton has 104358 states and 405681 transitions. Word has length 35 [2019-12-27 19:39:57,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:39:57,432 INFO L462 AbstractCegarLoop]: Abstraction has 104358 states and 405681 transitions. [2019-12-27 19:39:57,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:39:57,432 INFO L276 IsEmpty]: Start isEmpty. Operand 104358 states and 405681 transitions. [2019-12-27 19:39:58,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 19:39:58,228 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:39:58,229 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] [2019-12-27 19:39:58,229 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 19:39:58,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:39:58,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1813895010, now seen corresponding path program 3 times [2019-12-27 19:39:58,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:39:58,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179542763] [2019-12-27 19:39:58,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:39:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:39:58,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:39:58,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179542763] [2019-12-27 19:39:58,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:39:58,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:39:58,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [621247634] [2019-12-27 19:39:58,307 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:39:58,313 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:39:58,335 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 78 states and 117 transitions. [2019-12-27 19:39:58,335 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:39:58,337 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:39:58,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:39:58,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:39:58,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:39:58,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:39:58,338 INFO L87 Difference]: Start difference. First operand 104358 states and 405681 transitions. Second operand 7 states. [2019-12-27 19:39:59,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:39:59,702 INFO L93 Difference]: Finished difference Result 161380 states and 627294 transitions. [2019-12-27 19:39:59,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 19:39:59,702 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-27 19:39:59,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:40:00,110 INFO L225 Difference]: With dead ends: 161380 [2019-12-27 19:40:00,110 INFO L226 Difference]: Without dead ends: 153172 [2019-12-27 19:40:00,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-12-27 19:40:05,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153172 states. [2019-12-27 19:40:07,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153172 to 104098. [2019-12-27 19:40:07,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104098 states. [2019-12-27 19:40:07,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104098 states to 104098 states and 404689 transitions. [2019-12-27 19:40:07,559 INFO L78 Accepts]: Start accepts. Automaton has 104098 states and 404689 transitions. Word has length 35 [2019-12-27 19:40:07,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:40:07,559 INFO L462 AbstractCegarLoop]: Abstraction has 104098 states and 404689 transitions. [2019-12-27 19:40:07,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:40:07,559 INFO L276 IsEmpty]: Start isEmpty. Operand 104098 states and 404689 transitions. [2019-12-27 19:40:07,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 19:40:07,698 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:40:07,699 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:40:07,699 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 19:40:07,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:40:07,699 INFO L82 PathProgramCache]: Analyzing trace with hash 954140499, now seen corresponding path program 1 times [2019-12-27 19:40:07,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:40:07,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221997214] [2019-12-27 19:40:07,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:40:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:40:07,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:40:07,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221997214] [2019-12-27 19:40:07,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:40:07,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 19:40:07,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1847634428] [2019-12-27 19:40:07,787 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:40:07,793 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:40:08,526 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 126 transitions. [2019-12-27 19:40:08,526 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:40:08,533 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:40:08,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:40:08,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:40:08,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:40:08,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:40:08,540 INFO L87 Difference]: Start difference. First operand 104098 states and 404689 transitions. Second operand 5 states. [2019-12-27 19:40:08,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:40:08,672 INFO L93 Difference]: Finished difference Result 10606 states and 34509 transitions. [2019-12-27 19:40:08,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:40:08,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-12-27 19:40:08,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:40:08,690 INFO L225 Difference]: With dead ends: 10606 [2019-12-27 19:40:08,690 INFO L226 Difference]: Without dead ends: 6170 [2019-12-27 19:40:08,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:40:08,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6170 states. [2019-12-27 19:40:08,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6170 to 6170. [2019-12-27 19:40:08,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6170 states. [2019-12-27 19:40:08,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6170 states to 6170 states and 17083 transitions. [2019-12-27 19:40:08,842 INFO L78 Accepts]: Start accepts. Automaton has 6170 states and 17083 transitions. Word has length 36 [2019-12-27 19:40:08,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:40:08,842 INFO L462 AbstractCegarLoop]: Abstraction has 6170 states and 17083 transitions. [2019-12-27 19:40:08,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:40:08,843 INFO L276 IsEmpty]: Start isEmpty. Operand 6170 states and 17083 transitions. [2019-12-27 19:40:08,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 19:40:08,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:40:08,853 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] [2019-12-27 19:40:08,853 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:40:08,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:40:08,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1591197695, now seen corresponding path program 1 times [2019-12-27 19:40:08,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:40:08,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871460292] [2019-12-27 19:40:08,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:40:08,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:40:08,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:40:08,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871460292] [2019-12-27 19:40:08,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:40:08,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:40:08,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [23292927] [2019-12-27 19:40:08,954 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:40:08,966 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:40:08,998 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 72 transitions. [2019-12-27 19:40:08,998 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:40:08,999 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:40:08,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:40:08,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:40:08,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:40:08,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:40:09,000 INFO L87 Difference]: Start difference. First operand 6170 states and 17083 transitions. Second operand 4 states. [2019-12-27 19:40:09,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:40:09,043 INFO L93 Difference]: Finished difference Result 7174 states and 19351 transitions. [2019-12-27 19:40:09,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 19:40:09,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-27 19:40:09,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:40:09,054 INFO L225 Difference]: With dead ends: 7174 [2019-12-27 19:40:09,054 INFO L226 Difference]: Without dead ends: 6181 [2019-12-27 19:40:09,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:40:09,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6181 states. [2019-12-27 19:40:09,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6181 to 6163. [2019-12-27 19:40:09,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6163 states. [2019-12-27 19:40:09,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6163 states to 6163 states and 16998 transitions. [2019-12-27 19:40:09,170 INFO L78 Accepts]: Start accepts. Automaton has 6163 states and 16998 transitions. Word has length 47 [2019-12-27 19:40:09,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:40:09,171 INFO L462 AbstractCegarLoop]: Abstraction has 6163 states and 16998 transitions. [2019-12-27 19:40:09,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:40:09,171 INFO L276 IsEmpty]: Start isEmpty. Operand 6163 states and 16998 transitions. [2019-12-27 19:40:09,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 19:40:09,179 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:40:09,179 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] [2019-12-27 19:40:09,180 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:40:09,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:40:09,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1988438419, now seen corresponding path program 2 times [2019-12-27 19:40:09,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:40:09,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187022745] [2019-12-27 19:40:09,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:40:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:40:09,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:40:09,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187022745] [2019-12-27 19:40:09,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:40:09,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:40:09,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [940401175] [2019-12-27 19:40:09,249 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:40:09,260 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:40:09,290 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 72 transitions. [2019-12-27 19:40:09,291 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:40:09,302 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:40:09,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:40:09,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:40:09,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:40:09,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:40:09,303 INFO L87 Difference]: Start difference. First operand 6163 states and 16998 transitions. Second operand 5 states. [2019-12-27 19:40:09,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:40:09,624 INFO L93 Difference]: Finished difference Result 12844 states and 34205 transitions. [2019-12-27 19:40:09,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 19:40:09,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-27 19:40:09,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:40:09,632 INFO L225 Difference]: With dead ends: 12844 [2019-12-27 19:40:09,632 INFO L226 Difference]: Without dead ends: 5508 [2019-12-27 19:40:09,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:40:09,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5508 states. [2019-12-27 19:40:09,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5508 to 3766. [2019-12-27 19:40:09,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3766 states. [2019-12-27 19:40:09,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3766 states to 3766 states and 8871 transitions. [2019-12-27 19:40:09,689 INFO L78 Accepts]: Start accepts. Automaton has 3766 states and 8871 transitions. Word has length 47 [2019-12-27 19:40:09,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:40:09,689 INFO L462 AbstractCegarLoop]: Abstraction has 3766 states and 8871 transitions. [2019-12-27 19:40:09,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:40:09,690 INFO L276 IsEmpty]: Start isEmpty. Operand 3766 states and 8871 transitions. [2019-12-27 19:40:09,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 19:40:09,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:40:09,693 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:40:09,693 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:40:09,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:40:09,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1930278651, now seen corresponding path program 3 times [2019-12-27 19:40:09,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:40:09,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338851206] [2019-12-27 19:40:09,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:40:09,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:40:09,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:40:09,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338851206] [2019-12-27 19:40:09,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:40:09,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:40:09,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1520540580] [2019-12-27 19:40:09,768 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:40:09,779 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:40:09,814 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 83 transitions. [2019-12-27 19:40:09,814 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:40:09,831 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 19:40:09,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:40:09,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:40:09,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:40:09,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:40:09,832 INFO L87 Difference]: Start difference. First operand 3766 states and 8871 transitions. Second operand 7 states. [2019-12-27 19:40:10,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:40:10,030 INFO L93 Difference]: Finished difference Result 2486 states and 5930 transitions. [2019-12-27 19:40:10,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 19:40:10,031 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-12-27 19:40:10,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:40:10,032 INFO L225 Difference]: With dead ends: 2486 [2019-12-27 19:40:10,032 INFO L226 Difference]: Without dead ends: 431 [2019-12-27 19:40:10,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-12-27 19:40:10,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-12-27 19:40:10,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 425. [2019-12-27 19:40:10,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-12-27 19:40:10,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 917 transitions. [2019-12-27 19:40:10,038 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 917 transitions. Word has length 47 [2019-12-27 19:40:10,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:40:10,038 INFO L462 AbstractCegarLoop]: Abstraction has 425 states and 917 transitions. [2019-12-27 19:40:10,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:40:10,038 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 917 transitions. [2019-12-27 19:40:10,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 19:40:10,039 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:40:10,039 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:40:10,039 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:40:10,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:40:10,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1123212478, now seen corresponding path program 1 times [2019-12-27 19:40:10,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:40:10,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991890647] [2019-12-27 19:40:10,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:40:10,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:40:10,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:40:10,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991890647] [2019-12-27 19:40:10,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:40:10,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:40:10,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1150552051] [2019-12-27 19:40:10,139 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:40:10,161 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:40:10,251 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 111 states and 157 transitions. [2019-12-27 19:40:10,252 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:40:10,284 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 19:40:10,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 19:40:10,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:40:10,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 19:40:10,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 19:40:10,285 INFO L87 Difference]: Start difference. First operand 425 states and 917 transitions. Second operand 8 states. [2019-12-27 19:40:10,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:40:10,496 INFO L93 Difference]: Finished difference Result 921 states and 1957 transitions. [2019-12-27 19:40:10,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 19:40:10,497 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-27 19:40:10,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:40:10,498 INFO L225 Difference]: With dead ends: 921 [2019-12-27 19:40:10,498 INFO L226 Difference]: Without dead ends: 678 [2019-12-27 19:40:10,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-27 19:40:10,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2019-12-27 19:40:10,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 514. [2019-12-27 19:40:10,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2019-12-27 19:40:10,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 1076 transitions. [2019-12-27 19:40:10,505 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 1076 transitions. Word has length 63 [2019-12-27 19:40:10,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:40:10,505 INFO L462 AbstractCegarLoop]: Abstraction has 514 states and 1076 transitions. [2019-12-27 19:40:10,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 19:40:10,505 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 1076 transitions. [2019-12-27 19:40:10,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 19:40:10,506 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:40:10,506 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:40:10,506 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:40:10,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:40:10,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1377954014, now seen corresponding path program 2 times [2019-12-27 19:40:10,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:40:10,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113258298] [2019-12-27 19:40:10,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:40:10,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:40:10,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:40:10,638 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 19:40:10,638 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 19:40:10,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_58| 0 0))) (and (= v_~y$w_buff1_used~0_73 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t35~0.base_24| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t35~0.base_24|) |v_ULTIMATE.start_main_~#t35~0.offset_19| 0)) |v_#memory_int_21|) (= 0 v_~__unbuffered_p1_EAX~0_13) (= v_~main$tmp_guard1~0_18 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 v_~weak$$choice0~0_9) (= 0 v_~y$r_buff1_thd2~0_31) (= v_~__unbuffered_p1_EBX~0_14 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t35~0.base_24|) (= v_~y$read_delayed~0_7 0) (= |v_#valid_56| (store .cse0 |v_ULTIMATE.start_main_~#t35~0.base_24| 1)) (= v_~main$tmp_guard0~0_12 0) (= v_~y~0_30 0) (= v_~y$r_buff0_thd1~0_9 0) (= v_~__unbuffered_p2_EBX~0_16 0) (= 0 v_~weak$$choice2~0_34) (= v_~x~0_10 0) (= 0 v_~y$w_buff1~0_31) (= 0 v_~y$r_buff1_thd0~0_25) (= v_~y$mem_tmp~0_11 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$r_buff1_thd1~0_9 0) (= v_~y$r_buff0_thd3~0_76 0) (= 0 v_~y$flush_delayed~0_18) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t35~0.base_24|)) (= 0 v_~__unbuffered_cnt~0_19) (= 0 v_~y$w_buff0~0_37) (= v_~y$r_buff0_thd0~0_21 0) (= 0 v_~y$read_delayed_var~0.base_7) (= |v_#NULL.offset_5| 0) (= v_~y$r_buff0_thd2~0_55 0) (= 0 v_~__unbuffered_p0_EAX~0_16) (= 0 v_~z~0_9) (= 0 v_~__unbuffered_p2_EAX~0_14) (= v_~y$w_buff0_used~0_133 0) (= 0 |v_ULTIMATE.start_main_~#t35~0.offset_19|) (= v_~__unbuffered_p0_EBX~0_16 0) (= 0 v_~y$r_buff1_thd3~0_39) (= 0 |v_#NULL.base_5|) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t35~0.base_24| 4)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t37~0.base=|v_ULTIMATE.start_main_~#t37~0.base_19|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_8|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, #NULL.offset=|v_#NULL.offset_5|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_39, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_9, ~y$flush_delayed~0=v_~y$flush_delayed~0_18, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ULTIMATE.start_main_~#t35~0.offset=|v_ULTIMATE.start_main_~#t35~0.offset_19|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_16, ULTIMATE.start_main_~#t35~0.base=|v_ULTIMATE.start_main_~#t35~0.base_24|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_13|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_25|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_~#t36~0.base=|v_ULTIMATE.start_main_~#t36~0.base_20|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_11|, ~y$w_buff1~0=v_~y$w_buff1~0_31, ~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_55, ULTIMATE.start_main_~#t37~0.offset=|v_ULTIMATE.start_main_~#t37~0.offset_16|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_25, ~x~0=v_~x~0_10, ~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_133, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_10|, ULTIMATE.start_main_~#t36~0.offset=|v_ULTIMATE.start_main_~#t36~0.offset_16|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_9, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_76, ~y~0=v_~y~0_30, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_14, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_11|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_31, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_11|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_73} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t37~0.base, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, #NULL.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t35~0.offset, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t35~0.base, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_~#t36~0.base, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_~#t37~0.offset, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ULTIMATE.start_main_~#t36~0.offset, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 19:40:10,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [998] [998] L840-1-->L842: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t36~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t36~0.base_11|)) (= (select |v_#valid_33| |v_ULTIMATE.start_main_~#t36~0.base_11|) 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t36~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t36~0.base_11|) |v_ULTIMATE.start_main_~#t36~0.offset_10| 1)) |v_#memory_int_11|) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t36~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t36~0.offset_10|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t36~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t36~0.base=|v_ULTIMATE.start_main_~#t36~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t36~0.offset=|v_ULTIMATE.start_main_~#t36~0.offset_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t36~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t36~0.offset, #length] because there is no mapped edge [2019-12-27 19:40:10,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L842-1-->L844: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t37~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t37~0.base_11|) |v_ULTIMATE.start_main_~#t37~0.offset_10| 2)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t37~0.offset_10|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t37~0.base_11| 1)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t37~0.base_11|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t37~0.base_11| 4)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t37~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t37~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t37~0.base=|v_ULTIMATE.start_main_~#t37~0.base_11|, #valid=|v_#valid_34|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t37~0.offset=|v_ULTIMATE.start_main_~#t37~0.offset_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t37~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t37~0.offset, #length] because there is no mapped edge [2019-12-27 19:40:10,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [927] [927] P2ENTRY-->L4-3: Formula: (and (= (mod v_~y$w_buff1_used~0_57 256) 0) (= v_~y$w_buff0~0_26 v_~y$w_buff1~0_21) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5| v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_7) (= 1 v_~y$w_buff0~0_25) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= v_~y$w_buff0_used~0_104 1) (= v_~y$w_buff1_used~0_57 v_~y$w_buff0_used~0_105)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff0~0=v_~y$w_buff0~0_26, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_104, ~y$w_buff1~0=v_~y$w_buff1~0_21, ~y$w_buff0~0=v_~y$w_buff0~0_25, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_7, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_57} 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 19:40:10,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L802-2-->L802-4: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-938953307 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-938953307 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out-938953307| ~y$w_buff0~0_In-938953307)) (and (= |P2Thread1of1ForFork0_#t~ite28_Out-938953307| ~y$w_buff1~0_In-938953307) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-938953307, ~y$w_buff1~0=~y$w_buff1~0_In-938953307, ~y$w_buff0~0=~y$w_buff0~0_In-938953307, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-938953307} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-938953307|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-938953307, ~y$w_buff1~0=~y$w_buff1~0_In-938953307, ~y$w_buff0~0=~y$w_buff0~0_In-938953307, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-938953307} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 19:40:10,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L802-4-->L803: Formula: (= v_~y~0_18 |v_P2Thread1of1ForFork0_#t~ite28_8|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_8|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_7|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_7|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-27 19:40:10,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L807-->L808: Formula: (and (= v_~y$r_buff0_thd3~0_46 v_~y$r_buff0_thd3~0_45) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_46, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_45, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 19:40:10,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-2015901754 256) 0))) (or (and (not .cse0) (= ~y$mem_tmp~0_In-2015901754 |P2Thread1of1ForFork0_#t~ite48_Out-2015901754|)) (and .cse0 (= ~y~0_In-2015901754 |P2Thread1of1ForFork0_#t~ite48_Out-2015901754|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-2015901754, ~y$flush_delayed~0=~y$flush_delayed~0_In-2015901754, ~y~0=~y~0_In-2015901754} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-2015901754|, ~y$mem_tmp~0=~y$mem_tmp~0_In-2015901754, ~y$flush_delayed~0=~y$flush_delayed~0_In-2015901754, ~y~0=~y~0_In-2015901754} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-27 19:40:10,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_4 |v_P0Thread1of1ForFork1_#in~arg.base_4|) (= v_P0Thread1of1ForFork1_~arg.offset_4 |v_P0Thread1of1ForFork1_#in~arg.offset_4|) (= 1 v_~z~0_5) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= v_~__unbuffered_p0_EBX~0_7 v_~x~0_5) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_p0_EAX~0_7 v_~z~0_5)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_4|, ~x~0=v_~x~0_5} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_4|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z~0=v_~z~0_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_4|, ~x~0=v_~x~0_5, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_4} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 19:40:10,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-571366106 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-571366106 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite51_Out-571366106| 0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite51_Out-571366106| ~y$w_buff0_used~0_In-571366106) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-571366106, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-571366106} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-571366106, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-571366106, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out-571366106|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-27 19:40:10,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L819-->L819-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd3~0_In228603756 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In228603756 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In228603756 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In228603756 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite52_Out228603756|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite52_Out228603756| ~y$w_buff1_used~0_In228603756) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In228603756, ~y$w_buff0_used~0=~y$w_buff0_used~0_In228603756, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In228603756, ~y$w_buff1_used~0=~y$w_buff1_used~0_In228603756} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In228603756, ~y$w_buff0_used~0=~y$w_buff0_used~0_In228603756, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In228603756, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out228603756|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In228603756} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-27 19:40:10,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L820-->L821: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In558721392 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In558721392 256) 0))) (or (and (not .cse0) (= 0 ~y$r_buff0_thd3~0_Out558721392) (not .cse1)) (and (= ~y$r_buff0_thd3~0_In558721392 ~y$r_buff0_thd3~0_Out558721392) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In558721392, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In558721392} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In558721392, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out558721392, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out558721392|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-27 19:40:10,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1512785816 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-1512785816 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-1512785816 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1512785816 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite54_Out-1512785816|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In-1512785816 |P2Thread1of1ForFork0_#t~ite54_Out-1512785816|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1512785816, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1512785816, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1512785816, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1512785816} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1512785816, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1512785816, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out-1512785816|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1512785816, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1512785816} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-27 19:40:10,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L821-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= v_~y$r_buff1_thd3~0_33 |v_P2Thread1of1ForFork0_#t~ite54_8|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_33, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 19:40:10,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1486251346 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite25_Out1486251346| ~y$mem_tmp~0_In1486251346) (not .cse0)) (and (= ~y~0_In1486251346 |P1Thread1of1ForFork2_#t~ite25_Out1486251346|) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1486251346, ~y$flush_delayed~0=~y$flush_delayed~0_In1486251346, ~y~0=~y~0_In1486251346} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1486251346, ~y$flush_delayed~0=~y$flush_delayed~0_In1486251346, ~y~0=~y~0_In1486251346, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out1486251346|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 19:40:10,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L773-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite25_8| v_~y~0_25) (= 0 v_~y$flush_delayed~0_13) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~y~0=v_~y~0_25, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 19:40:10,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [898] [898] L848-->L850-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_16 256)) (= 0 (mod v_~y$w_buff0_used~0_93 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_93, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_93, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 19:40:10,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L850-2-->L850-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite59_Out1499619676| |ULTIMATE.start_main_#t~ite58_Out1499619676|)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1499619676 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1499619676 256) 0))) (or (and (= ~y$w_buff1~0_In1499619676 |ULTIMATE.start_main_#t~ite58_Out1499619676|) (not .cse0) .cse1 (not .cse2)) (and (= ~y~0_In1499619676 |ULTIMATE.start_main_#t~ite58_Out1499619676|) .cse1 (or .cse2 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1499619676, ~y~0=~y~0_In1499619676, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1499619676, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1499619676} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1499619676, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out1499619676|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1499619676|, ~y~0=~y~0_In1499619676, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1499619676, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1499619676} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-27 19:40:10,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L851-->L851-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-49766065 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-49766065 256)))) (or (and (= |ULTIMATE.start_main_#t~ite60_Out-49766065| 0) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-49766065 |ULTIMATE.start_main_#t~ite60_Out-49766065|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-49766065, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-49766065} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-49766065|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-49766065, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-49766065} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-27 19:40:10,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L852-->L852-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In1518270522 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1518270522 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1518270522 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1518270522 256)))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out1518270522| ~y$w_buff1_used~0_In1518270522) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite61_Out1518270522| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1518270522, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1518270522, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1518270522, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1518270522} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1518270522|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1518270522, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1518270522, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1518270522, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1518270522} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-27 19:40:10,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L853-->L853-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In2070561035 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In2070561035 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite62_Out2070561035| ~y$r_buff0_thd0~0_In2070561035)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite62_Out2070561035| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2070561035, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2070561035} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out2070561035|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2070561035, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2070561035} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-27 19:40:10,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L854-->L854-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In1389077810 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1389077810 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1389077810 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1389077810 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite63_Out1389077810|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite63_Out1389077810| ~y$r_buff1_thd0~0_In1389077810)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1389077810, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1389077810, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1389077810, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1389077810} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1389077810|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1389077810, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1389077810, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1389077810, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1389077810} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-27 19:40:10,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p1_EAX~0_6) (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p0_EBX~0_8 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~__unbuffered_p2_EAX~0_7 1) (= v_~__unbuffered_p0_EAX~0_8 1) (= 0 v_~__unbuffered_p1_EBX~0_7) (= v_~__unbuffered_p2_EBX~0_7 0) (= |v_ULTIMATE.start_main_#t~ite63_11| v_~y$r_buff1_thd0~0_17)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_11|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_6, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_6, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_17, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 19:40:10,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:40:10 BasicIcfg [2019-12-27 19:40:10,804 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 19:40:10,805 INFO L168 Benchmark]: Toolchain (without parser) took 94685.70 ms. Allocated memory was 144.7 MB in the beginning and 3.6 GB in the end (delta: 3.5 GB). Free memory was 101.1 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-27 19:40:10,806 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 144.7 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 19:40:10,807 INFO L168 Benchmark]: CACSL2BoogieTranslator took 800.35 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 100.7 MB in the beginning and 154.5 MB in the end (delta: -53.8 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-12-27 19:40:10,808 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.07 ms. Allocated memory is still 202.4 MB. Free memory was 154.5 MB in the beginning and 151.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 19:40:10,808 INFO L168 Benchmark]: Boogie Preprocessor took 46.10 ms. Allocated memory is still 202.4 MB. Free memory was 151.8 MB in the beginning and 149.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 19:40:10,809 INFO L168 Benchmark]: RCFGBuilder took 968.19 ms. Allocated memory is still 202.4 MB. Free memory was 149.1 MB in the beginning and 93.1 MB in the end (delta: 55.9 MB). Peak memory consumption was 55.9 MB. Max. memory is 7.1 GB. [2019-12-27 19:40:10,809 INFO L168 Benchmark]: TraceAbstraction took 92792.57 ms. Allocated memory was 202.4 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 92.4 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-27 19:40:10,816 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.25 ms. Allocated memory is still 144.7 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 800.35 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 100.7 MB in the beginning and 154.5 MB in the end (delta: -53.8 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.07 ms. Allocated memory is still 202.4 MB. Free memory was 154.5 MB in the beginning and 151.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.10 ms. Allocated memory is still 202.4 MB. Free memory was 151.8 MB in the beginning and 149.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 968.19 ms. Allocated memory is still 202.4 MB. Free memory was 149.1 MB in the beginning and 93.1 MB in the end (delta: 55.9 MB). Peak memory consumption was 55.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 92792.57 ms. Allocated memory was 202.4 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 92.4 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.6s, 197 ProgramPointsBefore, 107 ProgramPointsAfterwards, 243 TransitionsBefore, 127 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 49 ConcurrentYvCompositions, 30 ChoiceCompositions, 9080 VarBasedMoverChecksPositive, 248 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 134958 CheckedPairsTotal, 125 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L840] FCALL, FORK 0 pthread_create(&t35, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L842] FCALL, FORK 0 pthread_create(&t36, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L844] FCALL, FORK 0 pthread_create(&t37, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L791] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L792] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L793] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L794] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L795] 3 y$r_buff0_thd3 = (_Bool)1 [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 y$flush_delayed = weak$$choice2 [L801] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L804] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L805] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L805] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L808] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L810] 3 y = y$flush_delayed ? y$mem_tmp : y [L811] 3 y$flush_delayed = (_Bool)0 [L814] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L755] 2 x = 1 [L758] 2 __unbuffered_p1_EAX = x [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 y$flush_delayed = weak$$choice2 [L764] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L817] 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) [L818] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L819] 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 [L765] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L766] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L767] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L768] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L769] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L771] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L771] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L846] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L850] 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) [L851] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L852] 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 [L853] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 188 locations, 2 error locations. Result: UNSAFE, OverallTime: 92.4s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 22.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3653 SDtfs, 5874 SDslu, 7217 SDs, 0 SdLazy, 2776 SolverSat, 159 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 36 SyntacticMatches, 8 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104358occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 56.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 131158 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 603 NumberOfCodeBlocks, 603 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 523 ConstructedInterpolants, 0 QuantifiedInterpolants, 61207 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...