/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/mix010_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 19:58:34,841 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 19:58:34,844 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 19:58:34,861 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 19:58:34,861 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 19:58:34,862 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 19:58:34,863 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 19:58:34,865 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 19:58:34,867 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 19:58:34,868 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 19:58:34,869 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 19:58:34,870 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 19:58:34,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 19:58:34,871 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 19:58:34,872 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 19:58:34,873 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 19:58:34,874 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 19:58:34,875 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 19:58:34,876 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 19:58:34,878 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 19:58:34,880 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 19:58:34,881 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 19:58:34,882 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 19:58:34,883 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 19:58:34,885 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 19:58:34,885 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 19:58:34,885 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 19:58:34,886 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 19:58:34,887 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 19:58:34,888 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 19:58:34,888 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 19:58:34,889 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 19:58:34,889 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 19:58:34,890 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 19:58:34,891 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 19:58:34,891 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 19:58:34,892 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 19:58:34,892 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 19:58:34,892 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 19:58:34,893 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 19:58:34,894 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 19:58:34,895 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:58:34,908 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 19:58:34,909 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 19:58:34,910 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 19:58:34,910 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 19:58:34,910 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 19:58:34,911 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 19:58:34,911 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 19:58:34,911 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 19:58:34,911 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 19:58:34,911 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 19:58:34,912 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 19:58:34,912 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 19:58:34,912 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 19:58:34,912 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 19:58:34,912 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 19:58:34,913 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 19:58:34,913 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 19:58:34,913 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 19:58:34,913 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 19:58:34,913 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 19:58:34,914 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 19:58:34,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 19:58:34,914 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 19:58:34,914 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 19:58:34,914 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 19:58:34,915 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 19:58:34,915 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 19:58:34,915 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 19:58:34,915 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 19:58:34,915 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 19:58:34,916 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 19:58:34,916 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 19:58:35,221 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 19:58:35,245 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 19:58:35,249 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 19:58:35,250 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 19:58:35,252 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 19:58:35,253 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix010_pso.opt.i [2019-12-27 19:58:35,319 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ff205dc2/5e08da0ef2164ed7acb44e314abe7210/FLAG13afdbfb7 [2019-12-27 19:58:35,849 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 19:58:35,850 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010_pso.opt.i [2019-12-27 19:58:35,878 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ff205dc2/5e08da0ef2164ed7acb44e314abe7210/FLAG13afdbfb7 [2019-12-27 19:58:36,154 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ff205dc2/5e08da0ef2164ed7acb44e314abe7210 [2019-12-27 19:58:36,162 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 19:58:36,164 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 19:58:36,165 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 19:58:36,165 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 19:58:36,168 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 19:58:36,169 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:58:36" (1/1) ... [2019-12-27 19:58:36,172 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ef2d690 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:58:36, skipping insertion in model container [2019-12-27 19:58:36,173 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:58:36" (1/1) ... [2019-12-27 19:58:36,181 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 19:58:36,249 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 19:58:36,756 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:58:36,777 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 19:58:36,880 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:58:36,948 INFO L208 MainTranslator]: Completed translation [2019-12-27 19:58:36,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:58:36 WrapperNode [2019-12-27 19:58:36,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 19:58:36,950 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 19:58:36,950 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 19:58:36,950 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 19:58:36,959 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:58:36" (1/1) ... [2019-12-27 19:58:36,980 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:58:36" (1/1) ... [2019-12-27 19:58:37,017 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 19:58:37,017 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 19:58:37,017 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 19:58:37,017 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 19:58:37,027 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:58:36" (1/1) ... [2019-12-27 19:58:37,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:58:36" (1/1) ... [2019-12-27 19:58:37,032 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:58:36" (1/1) ... [2019-12-27 19:58:37,032 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:58:36" (1/1) ... [2019-12-27 19:58:37,044 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:58:36" (1/1) ... [2019-12-27 19:58:37,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:58:36" (1/1) ... [2019-12-27 19:58:37,053 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:58:36" (1/1) ... [2019-12-27 19:58:37,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 19:58:37,059 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 19:58:37,060 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 19:58:37,060 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 19:58:37,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:58: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:58:37,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 19:58:37,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 19:58:37,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 19:58:37,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 19:58:37,147 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 19:58:37,148 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 19:58:37,148 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 19:58:37,149 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 19:58:37,149 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 19:58:37,149 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 19:58:37,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 19:58:37,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 19:58:37,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 19:58:37,152 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:58:38,018 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 19:58:38,018 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 19:58:38,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:58:38 BoogieIcfgContainer [2019-12-27 19:58:38,019 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 19:58:38,021 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 19:58:38,022 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 19:58:38,026 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 19:58:38,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:58:36" (1/3) ... [2019-12-27 19:58:38,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd3fa5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:58:38, skipping insertion in model container [2019-12-27 19:58:38,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:58:36" (2/3) ... [2019-12-27 19:58:38,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd3fa5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:58:38, skipping insertion in model container [2019-12-27 19:58:38,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:58:38" (3/3) ... [2019-12-27 19:58:38,031 INFO L109 eAbstractionObserver]: Analyzing ICFG mix010_pso.opt.i [2019-12-27 19:58:38,042 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 19:58:38,042 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 19:58:38,056 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 19:58:38,057 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 19:58:38,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,121 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,121 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,124 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,124 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,138 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,144 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,144 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,144 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,145 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,145 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,173 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,173 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,175 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,181 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,182 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,186 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,188 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:58:38,205 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 19:58:38,225 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:58:38,225 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:58:38,225 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:58:38,225 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:58:38,226 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:58:38,226 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:58:38,226 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:58:38,226 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:58:38,244 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 243 transitions [2019-12-27 19:58:38,246 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-27 19:58:38,366 INFO L132 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-27 19:58:38,366 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:58:38,386 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 568 event pairs. 0/182 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-27 19:58:38,416 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-27 19:58:38,480 INFO L132 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-27 19:58:38,480 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:58:38,492 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 568 event pairs. 0/182 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-27 19:58:38,525 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-27 19:58:38,526 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 19:58:42,602 WARN L192 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 19:58:42,735 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 19:58:42,784 INFO L206 etLargeBlockEncoding]: Checked pairs total: 134090 [2019-12-27 19:58:42,784 INFO L214 etLargeBlockEncoding]: Total number of compositions: 127 [2019-12-27 19:58:42,788 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 106 places, 126 transitions [2019-12-27 19:58:46,495 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 42246 states. [2019-12-27 19:58:46,497 INFO L276 IsEmpty]: Start isEmpty. Operand 42246 states. [2019-12-27 19:58:46,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 19:58:46,503 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:58:46,504 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:58:46,505 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:58:46,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:58:46,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1163944889, now seen corresponding path program 1 times [2019-12-27 19:58:46,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:58:46,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421407333] [2019-12-27 19:58:46,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:58:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:58:46,732 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:58:46,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421407333] [2019-12-27 19:58:46,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:58:46,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:58:46,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [741556037] [2019-12-27 19:58:46,736 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:58:46,740 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:58:46,754 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 19:58:46,755 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:58:46,759 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:58:46,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:58:46,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:58:46,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:58:46,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:58:46,777 INFO L87 Difference]: Start difference. First operand 42246 states. Second operand 3 states. [2019-12-27 19:58:47,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:58:47,488 INFO L93 Difference]: Finished difference Result 41734 states and 169560 transitions. [2019-12-27 19:58:47,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:58:47,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 19:58:47,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:58:48,050 INFO L225 Difference]: With dead ends: 41734 [2019-12-27 19:58:48,051 INFO L226 Difference]: Without dead ends: 38854 [2019-12-27 19:58:48,055 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:58:48,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38854 states. [2019-12-27 19:58:51,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38854 to 38854. [2019-12-27 19:58:51,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38854 states. [2019-12-27 19:58:51,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38854 states to 38854 states and 157748 transitions. [2019-12-27 19:58:51,784 INFO L78 Accepts]: Start accepts. Automaton has 38854 states and 157748 transitions. Word has length 7 [2019-12-27 19:58:51,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:58:51,785 INFO L462 AbstractCegarLoop]: Abstraction has 38854 states and 157748 transitions. [2019-12-27 19:58:51,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:58:51,785 INFO L276 IsEmpty]: Start isEmpty. Operand 38854 states and 157748 transitions. [2019-12-27 19:58:51,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 19:58:51,790 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:58:51,790 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:58:51,791 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:58:51,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:58:51,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1542231911, now seen corresponding path program 1 times [2019-12-27 19:58:51,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:58:51,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871675151] [2019-12-27 19:58:51,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:58:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:58:51,906 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:58:51,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871675151] [2019-12-27 19:58:51,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:58:51,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:58:51,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1763816532] [2019-12-27 19:58:51,908 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:58:51,911 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:58:51,915 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 19:58:51,916 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:58:51,916 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:58:51,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:58:51,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:58:51,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:58:51,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:58:51,918 INFO L87 Difference]: Start difference. First operand 38854 states and 157748 transitions. Second operand 4 states. [2019-12-27 19:58:53,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:58:53,023 INFO L93 Difference]: Finished difference Result 61490 states and 240522 transitions. [2019-12-27 19:58:53,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:58:53,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 19:58:53,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:58:55,151 INFO L225 Difference]: With dead ends: 61490 [2019-12-27 19:58:55,151 INFO L226 Difference]: Without dead ends: 61462 [2019-12-27 19:58:55,154 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:58:55,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61462 states. [2019-12-27 19:58:57,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61462 to 58792. [2019-12-27 19:58:57,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58792 states. [2019-12-27 19:58:57,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58792 states to 58792 states and 231943 transitions. [2019-12-27 19:58:57,508 INFO L78 Accepts]: Start accepts. Automaton has 58792 states and 231943 transitions. Word has length 13 [2019-12-27 19:58:57,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:58:57,508 INFO L462 AbstractCegarLoop]: Abstraction has 58792 states and 231943 transitions. [2019-12-27 19:58:57,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:58:57,509 INFO L276 IsEmpty]: Start isEmpty. Operand 58792 states and 231943 transitions. [2019-12-27 19:58:57,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 19:58:57,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:58:57,516 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:58:57,516 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:58:57,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:58:57,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1747872827, now seen corresponding path program 1 times [2019-12-27 19:58:57,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:58:57,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989081386] [2019-12-27 19:58:57,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:58:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:58:57,632 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:58:57,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989081386] [2019-12-27 19:58:57,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:58:57,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:58:57,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [183206119] [2019-12-27 19:58:57,634 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:58:57,636 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:58:57,640 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 19:58:57,640 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:58:57,695 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:58:57,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:58:57,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:58:57,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:58:57,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:58:57,696 INFO L87 Difference]: Start difference. First operand 58792 states and 231943 transitions. Second operand 5 states. [2019-12-27 19:59:00,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:59:00,611 INFO L93 Difference]: Finished difference Result 76000 states and 295555 transitions. [2019-12-27 19:59:00,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:59:00,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 19:59:00,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:59:00,917 INFO L225 Difference]: With dead ends: 76000 [2019-12-27 19:59:00,917 INFO L226 Difference]: Without dead ends: 75972 [2019-12-27 19:59:00,918 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:59:01,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75972 states. [2019-12-27 19:59:03,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75972 to 66902. [2019-12-27 19:59:03,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66902 states. [2019-12-27 19:59:03,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66902 states to 66902 states and 262800 transitions. [2019-12-27 19:59:03,366 INFO L78 Accepts]: Start accepts. Automaton has 66902 states and 262800 transitions. Word has length 16 [2019-12-27 19:59:03,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:59:03,366 INFO L462 AbstractCegarLoop]: Abstraction has 66902 states and 262800 transitions. [2019-12-27 19:59:03,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:59:03,366 INFO L276 IsEmpty]: Start isEmpty. Operand 66902 states and 262800 transitions. [2019-12-27 19:59:03,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 19:59:03,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:59:03,374 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:59:03,374 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:59:03,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:59:03,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1292040923, now seen corresponding path program 1 times [2019-12-27 19:59:03,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:59:03,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399410901] [2019-12-27 19:59:03,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:59:03,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:59:03,443 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:59:03,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399410901] [2019-12-27 19:59:03,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:59:03,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:59:03,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [14382147] [2019-12-27 19:59:03,444 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:59:03,446 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:59:03,448 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 20 transitions. [2019-12-27 19:59:03,449 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:59:03,449 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:59:03,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:59:03,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:59:03,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:59:03,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:59:03,450 INFO L87 Difference]: Start difference. First operand 66902 states and 262800 transitions. Second operand 3 states. [2019-12-27 19:59:04,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:59:04,379 INFO L93 Difference]: Finished difference Result 62750 states and 246122 transitions. [2019-12-27 19:59:04,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:59:04,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 19:59:04,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:59:04,586 INFO L225 Difference]: With dead ends: 62750 [2019-12-27 19:59:04,586 INFO L226 Difference]: Without dead ends: 62582 [2019-12-27 19:59:04,587 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:59:05,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62582 states. [2019-12-27 19:59:06,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62582 to 62582. [2019-12-27 19:59:06,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62582 states. [2019-12-27 19:59:10,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62582 states to 62582 states and 245526 transitions. [2019-12-27 19:59:10,416 INFO L78 Accepts]: Start accepts. Automaton has 62582 states and 245526 transitions. Word has length 18 [2019-12-27 19:59:10,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:59:10,416 INFO L462 AbstractCegarLoop]: Abstraction has 62582 states and 245526 transitions. [2019-12-27 19:59:10,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:59:10,416 INFO L276 IsEmpty]: Start isEmpty. Operand 62582 states and 245526 transitions. [2019-12-27 19:59:10,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 19:59:10,438 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:59:10,438 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:59:10,438 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:59:10,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:59:10,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1307614695, now seen corresponding path program 1 times [2019-12-27 19:59:10,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:59:10,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958121567] [2019-12-27 19:59:10,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:59:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:59:10,523 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:59:10,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958121567] [2019-12-27 19:59:10,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:59:10,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:59:10,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [789512589] [2019-12-27 19:59:10,524 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:59:10,527 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:59:10,534 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 72 transitions. [2019-12-27 19:59:10,535 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:59:10,536 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:59:10,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:59:10,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:59:10,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:59:10,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:59:10,537 INFO L87 Difference]: Start difference. First operand 62582 states and 245526 transitions. Second operand 5 states. [2019-12-27 19:59:11,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:59:11,488 INFO L93 Difference]: Finished difference Result 75196 states and 291047 transitions. [2019-12-27 19:59:11,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 19:59:11,488 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 19:59:11,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:59:11,658 INFO L225 Difference]: With dead ends: 75196 [2019-12-27 19:59:11,659 INFO L226 Difference]: Without dead ends: 75144 [2019-12-27 19:59:11,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:59:12,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75144 states. [2019-12-27 19:59:13,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75144 to 62270. [2019-12-27 19:59:13,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62270 states. [2019-12-27 19:59:13,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62270 states to 62270 states and 244452 transitions. [2019-12-27 19:59:13,945 INFO L78 Accepts]: Start accepts. Automaton has 62270 states and 244452 transitions. Word has length 22 [2019-12-27 19:59:13,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:59:13,945 INFO L462 AbstractCegarLoop]: Abstraction has 62270 states and 244452 transitions. [2019-12-27 19:59:13,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:59:13,946 INFO L276 IsEmpty]: Start isEmpty. Operand 62270 states and 244452 transitions. [2019-12-27 19:59:14,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 19:59:14,011 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:59:14,011 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] [2019-12-27 19:59:14,011 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:59:14,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:59:14,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1189986838, now seen corresponding path program 1 times [2019-12-27 19:59:14,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:59:14,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704834473] [2019-12-27 19:59:14,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:59:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:59:14,091 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:59:14,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704834473] [2019-12-27 19:59:14,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:59:14,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:59:14,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1563101692] [2019-12-27 19:59:14,092 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:59:14,098 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:59:14,117 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 79 states and 113 transitions. [2019-12-27 19:59:14,117 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:59:14,118 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:59:14,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:59:14,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:59:14,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:59:14,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:59:14,119 INFO L87 Difference]: Start difference. First operand 62270 states and 244452 transitions. Second operand 5 states. [2019-12-27 19:59:15,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:59:15,251 INFO L93 Difference]: Finished difference Result 94430 states and 375492 transitions. [2019-12-27 19:59:15,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:59:15,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-12-27 19:59:15,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:59:15,469 INFO L225 Difference]: With dead ends: 94430 [2019-12-27 19:59:15,469 INFO L226 Difference]: Without dead ends: 82542 [2019-12-27 19:59:15,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 19:59:16,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82542 states. [2019-12-27 19:59:20,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82542 to 82542. [2019-12-27 19:59:20,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82542 states. [2019-12-27 19:59:20,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82542 states to 82542 states and 329856 transitions. [2019-12-27 19:59:21,000 INFO L78 Accepts]: Start accepts. Automaton has 82542 states and 329856 transitions. Word has length 32 [2019-12-27 19:59:21,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:59:21,000 INFO L462 AbstractCegarLoop]: Abstraction has 82542 states and 329856 transitions. [2019-12-27 19:59:21,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:59:21,000 INFO L276 IsEmpty]: Start isEmpty. Operand 82542 states and 329856 transitions. [2019-12-27 19:59:21,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 19:59:21,095 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:59:21,095 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] [2019-12-27 19:59:21,095 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:59:21,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:59:21,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1971502230, now seen corresponding path program 2 times [2019-12-27 19:59:21,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:59:21,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672733230] [2019-12-27 19:59:21,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:59:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:59:21,153 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:59:21,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672733230] [2019-12-27 19:59:21,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:59:21,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:59:21,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2032543627] [2019-12-27 19:59:21,155 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:59:21,160 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:59:21,176 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 78 states and 121 transitions. [2019-12-27 19:59:21,176 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:59:21,177 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:59:21,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:59:21,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:59:21,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:59:21,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:59:21,178 INFO L87 Difference]: Start difference. First operand 82542 states and 329856 transitions. Second operand 3 states. [2019-12-27 19:59:21,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:59:21,557 INFO L93 Difference]: Finished difference Result 82490 states and 329676 transitions. [2019-12-27 19:59:21,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:59:21,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-27 19:59:21,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:59:21,751 INFO L225 Difference]: With dead ends: 82490 [2019-12-27 19:59:21,751 INFO L226 Difference]: Without dead ends: 82490 [2019-12-27 19:59:21,751 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:59:22,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82490 states. [2019-12-27 19:59:26,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82490 to 82490. [2019-12-27 19:59:26,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82490 states. [2019-12-27 19:59:27,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82490 states to 82490 states and 329676 transitions. [2019-12-27 19:59:27,363 INFO L78 Accepts]: Start accepts. Automaton has 82490 states and 329676 transitions. Word has length 32 [2019-12-27 19:59:27,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:59:27,364 INFO L462 AbstractCegarLoop]: Abstraction has 82490 states and 329676 transitions. [2019-12-27 19:59:27,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:59:27,364 INFO L276 IsEmpty]: Start isEmpty. Operand 82490 states and 329676 transitions. [2019-12-27 19:59:27,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 19:59:27,477 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:59:27,478 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:59:27,478 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:59:27,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:59:27,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1739657011, now seen corresponding path program 1 times [2019-12-27 19:59:27,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:59:27,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984754218] [2019-12-27 19:59:27,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:59:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:59:27,558 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:59:27,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984754218] [2019-12-27 19:59:27,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:59:27,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:59:27,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1882325173] [2019-12-27 19:59:27,559 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:59:27,565 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:59:27,585 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 81 states and 126 transitions. [2019-12-27 19:59:27,585 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:59:27,631 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 19:59:27,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:59:27,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:59:27,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:59:27,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:59:27,632 INFO L87 Difference]: Start difference. First operand 82490 states and 329676 transitions. Second operand 7 states. [2019-12-27 19:59:28,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:59:28,781 INFO L93 Difference]: Finished difference Result 65725 states and 225232 transitions. [2019-12-27 19:59:28,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 19:59:28,782 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 19:59:28,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:59:28,891 INFO L225 Difference]: With dead ends: 65725 [2019-12-27 19:59:28,891 INFO L226 Difference]: Without dead ends: 59115 [2019-12-27 19:59:28,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-12-27 19:59:29,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59115 states. [2019-12-27 19:59:30,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59115 to 39552. [2019-12-27 19:59:30,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39552 states. [2019-12-27 19:59:30,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39552 states to 39552 states and 134707 transitions. [2019-12-27 19:59:30,540 INFO L78 Accepts]: Start accepts. Automaton has 39552 states and 134707 transitions. Word has length 33 [2019-12-27 19:59:30,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:59:30,540 INFO L462 AbstractCegarLoop]: Abstraction has 39552 states and 134707 transitions. [2019-12-27 19:59:30,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:59:30,540 INFO L276 IsEmpty]: Start isEmpty. Operand 39552 states and 134707 transitions. [2019-12-27 19:59:30,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 19:59:30,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:59:30,575 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:59:30,575 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:59:30,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:59:30,575 INFO L82 PathProgramCache]: Analyzing trace with hash 608813654, now seen corresponding path program 1 times [2019-12-27 19:59:30,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:59:30,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336037870] [2019-12-27 19:59:30,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:59:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:59:30,657 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:59:30,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336037870] [2019-12-27 19:59:30,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:59:30,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:59:30,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1674654687] [2019-12-27 19:59:30,658 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:59:30,664 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:59:30,682 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 86 transitions. [2019-12-27 19:59:30,683 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:59:30,683 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:59:30,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:59:30,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:59:30,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:59:30,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:59:30,684 INFO L87 Difference]: Start difference. First operand 39552 states and 134707 transitions. Second operand 4 states. [2019-12-27 19:59:31,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:59:31,099 INFO L93 Difference]: Finished difference Result 73665 states and 251207 transitions. [2019-12-27 19:59:31,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 19:59:31,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-27 19:59:31,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:59:31,211 INFO L225 Difference]: With dead ends: 73665 [2019-12-27 19:59:31,211 INFO L226 Difference]: Without dead ends: 39604 [2019-12-27 19:59:31,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:59:31,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39604 states. [2019-12-27 19:59:32,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39604 to 39552. [2019-12-27 19:59:32,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39552 states. [2019-12-27 19:59:33,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39552 states to 39552 states and 130972 transitions. [2019-12-27 19:59:33,110 INFO L78 Accepts]: Start accepts. Automaton has 39552 states and 130972 transitions. Word has length 34 [2019-12-27 19:59:33,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:59:33,111 INFO L462 AbstractCegarLoop]: Abstraction has 39552 states and 130972 transitions. [2019-12-27 19:59:33,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:59:33,111 INFO L276 IsEmpty]: Start isEmpty. Operand 39552 states and 130972 transitions. [2019-12-27 19:59:33,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 19:59:33,148 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:59:33,148 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:59:33,148 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:59:33,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:59:33,149 INFO L82 PathProgramCache]: Analyzing trace with hash -375253438, now seen corresponding path program 2 times [2019-12-27 19:59:33,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:59:33,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948762787] [2019-12-27 19:59:33,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:59:33,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:59:33,215 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:59:33,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948762787] [2019-12-27 19:59:33,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:59:33,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:59:33,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1117493827] [2019-12-27 19:59:33,216 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:59:33,222 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:59:33,241 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 104 transitions. [2019-12-27 19:59:33,241 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:59:33,243 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:59:33,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:59:33,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:59:33,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:59:33,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:59:33,244 INFO L87 Difference]: Start difference. First operand 39552 states and 130972 transitions. Second operand 3 states. [2019-12-27 19:59:33,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:59:33,393 INFO L93 Difference]: Finished difference Result 39552 states and 129224 transitions. [2019-12-27 19:59:33,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:59:33,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-27 19:59:33,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:59:33,459 INFO L225 Difference]: With dead ends: 39552 [2019-12-27 19:59:33,459 INFO L226 Difference]: Without dead ends: 39552 [2019-12-27 19:59:33,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:59:33,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39552 states. [2019-12-27 19:59:34,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39552 to 39295. [2019-12-27 19:59:34,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39295 states. [2019-12-27 19:59:34,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39295 states to 39295 states and 128557 transitions. [2019-12-27 19:59:34,343 INFO L78 Accepts]: Start accepts. Automaton has 39295 states and 128557 transitions. Word has length 34 [2019-12-27 19:59:34,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:59:34,343 INFO L462 AbstractCegarLoop]: Abstraction has 39295 states and 128557 transitions. [2019-12-27 19:59:34,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:59:34,343 INFO L276 IsEmpty]: Start isEmpty. Operand 39295 states and 128557 transitions. [2019-12-27 19:59:34,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 19:59:34,384 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:59:34,384 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:59:34,384 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:59:34,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:59:34,385 INFO L82 PathProgramCache]: Analyzing trace with hash -521746831, now seen corresponding path program 1 times [2019-12-27 19:59:34,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:59:34,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206618536] [2019-12-27 19:59:34,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:59:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:59:34,521 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:59:34,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206618536] [2019-12-27 19:59:34,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:59:34,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:59:34,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [85648677] [2019-12-27 19:59:34,522 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:59:34,529 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:59:34,549 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 107 transitions. [2019-12-27 19:59:34,549 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:59:34,550 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:59:34,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:59:34,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:59:34,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:59:34,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:59:34,551 INFO L87 Difference]: Start difference. First operand 39295 states and 128557 transitions. Second operand 7 states. [2019-12-27 19:59:36,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:59:36,680 INFO L93 Difference]: Finished difference Result 72907 states and 241314 transitions. [2019-12-27 19:59:36,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 19:59:36,680 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-27 19:59:36,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:59:36,816 INFO L225 Difference]: With dead ends: 72907 [2019-12-27 19:59:36,816 INFO L226 Difference]: Without dead ends: 67462 [2019-12-27 19:59:36,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 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:59:37,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67462 states. [2019-12-27 19:59:37,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67462 to 55746. [2019-12-27 19:59:37,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55746 states. [2019-12-27 19:59:38,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55746 states to 55746 states and 185539 transitions. [2019-12-27 19:59:38,458 INFO L78 Accepts]: Start accepts. Automaton has 55746 states and 185539 transitions. Word has length 35 [2019-12-27 19:59:38,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:59:38,459 INFO L462 AbstractCegarLoop]: Abstraction has 55746 states and 185539 transitions. [2019-12-27 19:59:38,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:59:38,459 INFO L276 IsEmpty]: Start isEmpty. Operand 55746 states and 185539 transitions. [2019-12-27 19:59:38,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 19:59:38,511 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:59:38,511 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:59:38,512 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:59:38,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:59:38,512 INFO L82 PathProgramCache]: Analyzing trace with hash -140155408, now seen corresponding path program 1 times [2019-12-27 19:59:38,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:59:38,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884062477] [2019-12-27 19:59:38,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:59:38,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:59:38,575 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:59:38,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884062477] [2019-12-27 19:59:38,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:59:38,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 19:59:38,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [448822534] [2019-12-27 19:59:38,576 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:59:38,583 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:59:38,611 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 141 transitions. [2019-12-27 19:59:38,611 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:59:38,955 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 41 times. [2019-12-27 19:59:38,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 19:59:38,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:59:38,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 19:59:38,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2019-12-27 19:59:38,958 INFO L87 Difference]: Start difference. First operand 55746 states and 185539 transitions. Second operand 17 states. [2019-12-27 19:59:41,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:59:41,396 INFO L93 Difference]: Finished difference Result 15819 states and 38990 transitions. [2019-12-27 19:59:41,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 19:59:41,396 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2019-12-27 19:59:41,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:59:41,412 INFO L225 Difference]: With dead ends: 15819 [2019-12-27 19:59:41,412 INFO L226 Difference]: Without dead ends: 11806 [2019-12-27 19:59:41,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=304, Invalid=752, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 19:59:41,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11806 states. [2019-12-27 19:59:41,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11806 to 9645. [2019-12-27 19:59:41,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9645 states. [2019-12-27 19:59:41,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9645 states to 9645 states and 22102 transitions. [2019-12-27 19:59:41,528 INFO L78 Accepts]: Start accepts. Automaton has 9645 states and 22102 transitions. Word has length 36 [2019-12-27 19:59:41,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:59:41,528 INFO L462 AbstractCegarLoop]: Abstraction has 9645 states and 22102 transitions. [2019-12-27 19:59:41,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 19:59:41,529 INFO L276 IsEmpty]: Start isEmpty. Operand 9645 states and 22102 transitions. [2019-12-27 19:59:41,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 19:59:41,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:59:41,537 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:59:41,537 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:59:41,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:59:41,537 INFO L82 PathProgramCache]: Analyzing trace with hash -944953888, now seen corresponding path program 1 times [2019-12-27 19:59:41,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:59:41,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333759397] [2019-12-27 19:59:41,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:59:41,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:59:41,635 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:59:41,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333759397] [2019-12-27 19:59:41,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:59:41,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:59:41,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1660215792] [2019-12-27 19:59:41,636 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:59:41,647 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:59:41,671 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 51 states and 53 transitions. [2019-12-27 19:59:41,671 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:59:41,672 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:59:41,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 19:59:41,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:59:41,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 19:59:41,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:59:41,673 INFO L87 Difference]: Start difference. First operand 9645 states and 22102 transitions. Second operand 6 states. [2019-12-27 19:59:41,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:59:41,744 INFO L93 Difference]: Finished difference Result 7403 states and 17129 transitions. [2019-12-27 19:59:41,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:59:41,744 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-27 19:59:41,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:59:41,748 INFO L225 Difference]: With dead ends: 7403 [2019-12-27 19:59:41,749 INFO L226 Difference]: Without dead ends: 3668 [2019-12-27 19:59:41,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:59:41,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3668 states. [2019-12-27 19:59:41,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3668 to 3638. [2019-12-27 19:59:41,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3638 states. [2019-12-27 19:59:41,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3638 states to 3638 states and 8392 transitions. [2019-12-27 19:59:41,785 INFO L78 Accepts]: Start accepts. Automaton has 3638 states and 8392 transitions. Word has length 47 [2019-12-27 19:59:41,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:59:41,785 INFO L462 AbstractCegarLoop]: Abstraction has 3638 states and 8392 transitions. [2019-12-27 19:59:41,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 19:59:41,785 INFO L276 IsEmpty]: Start isEmpty. Operand 3638 states and 8392 transitions. [2019-12-27 19:59:41,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 19:59:41,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:59:41,788 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:59:41,789 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:59:41,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:59:41,789 INFO L82 PathProgramCache]: Analyzing trace with hash 34894533, now seen corresponding path program 1 times [2019-12-27 19:59:41,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:59:41,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058123939] [2019-12-27 19:59:41,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:59:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:59:41,860 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:59:41,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058123939] [2019-12-27 19:59:41,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:59:41,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:59:41,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1327653221] [2019-12-27 19:59:41,861 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:59:41,880 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:59:42,011 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 237 transitions. [2019-12-27 19:59:42,012 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:59:42,064 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 19:59:42,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:59:42,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:59:42,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:59:42,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:59:42,065 INFO L87 Difference]: Start difference. First operand 3638 states and 8392 transitions. Second operand 7 states. [2019-12-27 19:59:42,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:59:42,195 INFO L93 Difference]: Finished difference Result 4102 states and 9421 transitions. [2019-12-27 19:59:42,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 19:59:42,195 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-12-27 19:59:42,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:59:42,196 INFO L225 Difference]: With dead ends: 4102 [2019-12-27 19:59:42,196 INFO L226 Difference]: Without dead ends: 520 [2019-12-27 19:59:42,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 19:59:42,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2019-12-27 19:59:42,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 507. [2019-12-27 19:59:42,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2019-12-27 19:59:42,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 1076 transitions. [2019-12-27 19:59:42,202 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 1076 transitions. Word has length 62 [2019-12-27 19:59:42,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:59:42,202 INFO L462 AbstractCegarLoop]: Abstraction has 507 states and 1076 transitions. [2019-12-27 19:59:42,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:59:42,202 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 1076 transitions. [2019-12-27 19:59:42,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 19:59:42,203 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:59:42,203 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:59:42,203 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:59:42,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:59:42,203 INFO L82 PathProgramCache]: Analyzing trace with hash 183287320, now seen corresponding path program 1 times [2019-12-27 19:59:42,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:59:42,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972130285] [2019-12-27 19:59:42,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:59:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:59:42,295 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:59:42,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972130285] [2019-12-27 19:59:42,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:59:42,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:59:42,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [346848617] [2019-12-27 19:59:42,296 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:59:42,316 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:59:42,523 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 63 transitions. [2019-12-27 19:59:42,524 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:59:42,524 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:59:42,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 19:59:42,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:59:42,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 19:59:42,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 19:59:42,525 INFO L87 Difference]: Start difference. First operand 507 states and 1076 transitions. Second operand 8 states. [2019-12-27 19:59:42,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:59:42,744 INFO L93 Difference]: Finished difference Result 1051 states and 2204 transitions. [2019-12-27 19:59:42,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 19:59:42,744 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-27 19:59:42,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:59:42,746 INFO L225 Difference]: With dead ends: 1051 [2019-12-27 19:59:42,746 INFO L226 Difference]: Without dead ends: 744 [2019-12-27 19:59:42,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-27 19:59:42,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2019-12-27 19:59:42,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 598. [2019-12-27 19:59:42,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-12-27 19:59:42,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 1229 transitions. [2019-12-27 19:59:42,754 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 1229 transitions. Word has length 63 [2019-12-27 19:59:42,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:59:42,755 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 1229 transitions. [2019-12-27 19:59:42,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 19:59:42,755 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 1229 transitions. [2019-12-27 19:59:42,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 19:59:42,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:59:42,756 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:59:42,756 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:59:42,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:59:42,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1420483866, now seen corresponding path program 2 times [2019-12-27 19:59:42,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:59:42,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654168113] [2019-12-27 19:59:42,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:59:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:59:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:59:42,874 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 19:59:42,874 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 19:59:42,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= v_~z$w_buff0_used~0_138 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~a~0_9) (= 0 v_~z$r_buff1_thd3~0_41) (= 0 v_~weak$$choice0~0_8) (= v_~main$tmp_guard1~0_16 0) (= v_~z$r_buff0_thd3~0_79 0) (= v_~z$r_buff0_thd1~0_10 0) (= 0 v_~z$r_buff1_thd2~0_32) (= 0 v_~__unbuffered_p1_EAX~0_15) (= v_~__unbuffered_p1_EBX~0_14 0) (= v_~z~0_28 0) (= v_~z$r_buff1_thd1~0_8 0) (= v_~z$read_delayed~0_8 0) (= 0 v_~__unbuffered_cnt~0_21) (= v_~z$read_delayed_var~0.base_8 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~z$r_buff0_thd0~0_21 0) (= v_~x~0_10 0) (= 0 v_~z$flush_delayed~0_17) (= v_~z$r_buff0_thd2~0_58 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t266~0.base_23|) (= 0 v_~__unbuffered_p2_EAX~0_15) (= 0 v_~weak$$choice2~0_33) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t266~0.base_23|)) (= v_~__unbuffered_p2_EBX~0_15 0) (= 0 v_~z$r_buff1_thd0~0_26) (= 0 v_~z$w_buff1_used~0_74) (= 0 v_~__unbuffered_p0_EAX~0_17) (= |v_#NULL.offset_5| 0) (= 0 v_~y~0_8) (= 0 v_~z$w_buff1~0_33) (= |v_#valid_54| (store .cse0 |v_ULTIMATE.start_main_~#t266~0.base_23| 1)) (= v_~z$mem_tmp~0_12 0) (= 0 v_~z$w_buff0~0_39) (= |v_ULTIMATE.start_main_~#t266~0.offset_18| 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t266~0.base_23| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t266~0.base_23|) |v_ULTIMATE.start_main_~#t266~0.offset_18| 0)) |v_#memory_int_19|) (= 0 |v_#NULL.base_5|) (= v_~z$read_delayed_var~0.offset_8 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t266~0.base_23| 4)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_32, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t268~0.offset=|v_ULTIMATE.start_main_~#t268~0.offset_15|, ULTIMATE.start_main_~#t267~0.base=|v_ULTIMATE.start_main_~#t267~0.base_19|, ~a~0=v_~a~0_9, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_21, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, ULTIMATE.start_main_~#t266~0.offset=|v_ULTIMATE.start_main_~#t266~0.offset_18|, ~z$mem_tmp~0=v_~z$mem_tmp~0_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_15, ULTIMATE.start_main_~#t266~0.base=|v_ULTIMATE.start_main_~#t266~0.base_23|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_12|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_74, ~z$flush_delayed~0=v_~z$flush_delayed~0_17, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_24|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_10|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_79, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_10, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t267~0.offset=|v_ULTIMATE.start_main_~#t267~0.offset_15|, ULTIMATE.start_main_~#t268~0.base=|v_ULTIMATE.start_main_~#t268~0.base_18|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_26, ~y~0=v_~y~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_58, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_138, ~z$w_buff0~0=v_~z$w_buff0~0_39, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_41, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_13|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_10|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_28, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t268~0.offset, ULTIMATE.start_main_~#t267~0.base, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t266~0.offset, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t266~0.base, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t267~0.offset, ULTIMATE.start_main_~#t268~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 19:59:42,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L840-1-->L842: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t267~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t267~0.base_11| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t267~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t267~0.base_11|) |v_ULTIMATE.start_main_~#t267~0.offset_10| 1)) |v_#memory_int_13|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t267~0.base_11|)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t267~0.base_11| 1)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t267~0.base_11| 4) |v_#length_17|) (= |v_ULTIMATE.start_main_~#t267~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t267~0.offset=|v_ULTIMATE.start_main_~#t267~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t267~0.base=|v_ULTIMATE.start_main_~#t267~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t267~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t267~0.base] because there is no mapped edge [2019-12-27 19:59:42,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L842-1-->L844: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t268~0.base_9|)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t268~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t268~0.base_9|) |v_ULTIMATE.start_main_~#t268~0.offset_8| 2)) |v_#memory_int_9|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t268~0.base_9| 1) |v_#valid_27|) (not (= 0 |v_ULTIMATE.start_main_~#t268~0.base_9|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t268~0.base_9|) (= |v_ULTIMATE.start_main_~#t268~0.offset_8| 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t268~0.base_9| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t268~0.base=|v_ULTIMATE.start_main_~#t268~0.base_9|, #valid=|v_#valid_27|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t268~0.offset=|v_ULTIMATE.start_main_~#t268~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t268~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t268~0.offset] because there is no mapped edge [2019-12-27 19:59:42,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [929] [929] P2ENTRY-->L4-3: Formula: (and (= (mod v_~z$w_buff1_used~0_58 256) 0) (= 1 v_~z$w_buff0~0_25) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= v_~z$w_buff0_used~0_108 v_~z$w_buff1_used~0_58) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5| v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_7) (= v_~z$w_buff0_used~0_107 1) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= v_~z$w_buff0~0_26 v_~z$w_buff1~0_23)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_108, ~z$w_buff0~0=v_~z$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|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~z$w_buff0~0=v_~z$w_buff0~0_25, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_58, ~z$w_buff1~0=v_~z$w_buff1~0_23, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 19:59:42,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [969] [969] L802-2-->L802-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In215579615 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In215579615 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out215579615| ~z$w_buff1~0_In215579615)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite28_Out215579615| ~z$w_buff0~0_In215579615) (not .cse1)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In215579615, ~z$w_buff0_used~0=~z$w_buff0_used~0_In215579615, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In215579615, ~z$w_buff1~0=~z$w_buff1~0_In215579615} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out215579615|, ~z$w_buff0~0=~z$w_buff0~0_In215579615, ~z$w_buff0_used~0=~z$w_buff0_used~0_In215579615, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In215579615, ~z$w_buff1~0=~z$w_buff1~0_In215579615} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 19:59:42,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [886] [886] L802-4-->L803: Formula: (= v_~z~0_19 |v_P2Thread1of1ForFork0_#t~ite28_8|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_8|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_7|, ~z~0=v_~z~0_19, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, ~z~0, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 19:59:42,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L807-->L808: Formula: (and (= v_~z$r_buff0_thd3~0_48 v_~z$r_buff0_thd3~0_47) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_48, ~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|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 19:59:42,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [956] [956] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In1363153133 256) 0))) (or (and (= ~z~0_In1363153133 |P2Thread1of1ForFork0_#t~ite48_Out1363153133|) .cse0) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite48_Out1363153133| ~z$mem_tmp~0_In1363153133)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1363153133, ~z$flush_delayed~0=~z$flush_delayed~0_In1363153133, ~z~0=~z~0_In1363153133} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out1363153133|, ~z$mem_tmp~0=~z$mem_tmp~0_In1363153133, ~z$flush_delayed~0=~z$flush_delayed~0_In1363153133, ~z~0=~z~0_In1363153133} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-27 19:59:42,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 1 v_~a~0_5) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= v_~__unbuffered_p0_EAX~0_6 v_~x~0_5) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_5} OutVars{~a~0=v_~a~0_5, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_5, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 19:59:42,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [967] [967] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In983433190 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In983433190 256) 0))) (or (and (= ~z$w_buff0_used~0_In983433190 |P2Thread1of1ForFork0_#t~ite51_Out983433190|) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite51_Out983433190| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In983433190, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In983433190} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In983433190, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In983433190, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out983433190|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-27 19:59:42,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L819-->L819-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-2000127119 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-2000127119 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-2000127119 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-2000127119 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite52_Out-2000127119| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite52_Out-2000127119| ~z$w_buff1_used~0_In-2000127119)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2000127119, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2000127119, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2000127119, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2000127119} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2000127119, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2000127119, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2000127119, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-2000127119|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2000127119} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-27 19:59:42,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L820-->L821: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-2007888322 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-2007888322 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd3~0_Out-2007888322)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd3~0_In-2007888322 ~z$r_buff0_thd3~0_Out-2007888322)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2007888322, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2007888322} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2007888322, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-2007888322, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-2007888322|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-27 19:59:42,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1087718293 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-1087718293 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1087718293 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-1087718293 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-1087718293 |P2Thread1of1ForFork0_#t~ite54_Out-1087718293|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite54_Out-1087718293|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1087718293, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1087718293, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1087718293, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1087718293} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1087718293, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out-1087718293|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1087718293, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1087718293, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1087718293} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-27 19:59:42,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L821-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_35 |v_P2Thread1of1ForFork0_#t~ite54_8|)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_35, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 19:59:42,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-937059522 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite25_Out-937059522| ~z$mem_tmp~0_In-937059522)) (and (= ~z~0_In-937059522 |P1Thread1of1ForFork2_#t~ite25_Out-937059522|) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-937059522, ~z$flush_delayed~0=~z$flush_delayed~0_In-937059522, ~z~0=~z~0_In-937059522} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-937059522, ~z$flush_delayed~0=~z$flush_delayed~0_In-937059522, ~z~0=~z~0_In-937059522, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-937059522|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 19:59:42,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L773-2-->P1EXIT: Formula: (and (= 0 v_~z$flush_delayed~0_13) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= |v_P1Thread1of1ForFork2_#t~ite25_8| v_~z~0_24) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~z~0=v_~z~0_24, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 19:59:42,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [902] [902] L848-->L850-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_96 256)) (= 0 (mod v_~z$r_buff0_thd0~0_15 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_96, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_96, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 19:59:42,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L850-2-->L850-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In742039121 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite58_Out742039121| |ULTIMATE.start_main_#t~ite59_Out742039121|)) (.cse0 (= (mod ~z$w_buff1_used~0_In742039121 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite58_Out742039121| ~z~0_In742039121) (or .cse0 .cse1) .cse2) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite58_Out742039121| ~z$w_buff1~0_In742039121) .cse2 (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In742039121, ~z$w_buff1_used~0=~z$w_buff1_used~0_In742039121, ~z$w_buff1~0=~z$w_buff1~0_In742039121, ~z~0=~z~0_In742039121} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In742039121, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out742039121|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In742039121, ~z$w_buff1~0=~z$w_buff1~0_In742039121, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out742039121|, ~z~0=~z~0_In742039121} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-27 19:59:42,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L851-->L851-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-564919480 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-564919480 256)))) (or (and (= ~z$w_buff0_used~0_In-564919480 |ULTIMATE.start_main_#t~ite60_Out-564919480|) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite60_Out-564919480| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-564919480, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-564919480} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-564919480|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-564919480, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-564919480} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-27 19:59:42,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L852-->L852-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd0~0_In329381337 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In329381337 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In329381337 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In329381337 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In329381337 |ULTIMATE.start_main_#t~ite61_Out329381337|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite61_Out329381337|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In329381337, ~z$w_buff0_used~0=~z$w_buff0_used~0_In329381337, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In329381337, ~z$w_buff1_used~0=~z$w_buff1_used~0_In329381337} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In329381337, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out329381337|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In329381337, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In329381337, ~z$w_buff1_used~0=~z$w_buff1_used~0_In329381337} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-27 19:59:42,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L853-->L853-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In374506256 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In374506256 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite62_Out374506256| 0)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In374506256 |ULTIMATE.start_main_#t~ite62_Out374506256|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In374506256, ~z$w_buff0_used~0=~z$w_buff0_used~0_In374506256} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out374506256|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In374506256, ~z$w_buff0_used~0=~z$w_buff0_used~0_In374506256} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-27 19:59:42,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L854-->L854-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In266850286 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In266850286 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In266850286 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In266850286 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite63_Out266850286|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~z$r_buff1_thd0~0_In266850286 |ULTIMATE.start_main_#t~ite63_Out266850286|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In266850286, ~z$w_buff0_used~0=~z$w_buff0_used~0_In266850286, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In266850286, ~z$w_buff1_used~0=~z$w_buff1_used~0_In266850286} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out266850286|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In266850286, ~z$w_buff0_used~0=~z$w_buff0_used~0_In266850286, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In266850286, ~z$w_buff1_used~0=~z$w_buff1_used~0_In266850286} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-27 19:59:42,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1011] [1011] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_10 256)) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~main$tmp_guard1~0_10 0) (= v_~__unbuffered_p2_EBX~0_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start_main_#t~ite63_15| v_~z$r_buff1_thd0~0_18) (= 0 v_~__unbuffered_p0_EAX~0_11) (= 1 v_~__unbuffered_p1_EAX~0_9) (= v_~__unbuffered_p2_EAX~0_9 1)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_15|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_14|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 19:59:43,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:59:43 BasicIcfg [2019-12-27 19:59:43,055 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 19:59:43,056 INFO L168 Benchmark]: Toolchain (without parser) took 66892.58 ms. Allocated memory was 145.8 MB in the beginning and 2.5 GB in the end (delta: 2.4 GB). Free memory was 102.2 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 456.5 MB. Max. memory is 7.1 GB. [2019-12-27 19:59:43,057 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 19:59:43,058 INFO L168 Benchmark]: CACSL2BoogieTranslator took 784.29 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 102.0 MB in the beginning and 156.3 MB in the end (delta: -54.4 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-12-27 19:59:43,059 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.28 ms. Allocated memory is still 203.4 MB. Free memory was 156.3 MB in the beginning and 153.0 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 19:59:43,059 INFO L168 Benchmark]: Boogie Preprocessor took 42.08 ms. Allocated memory is still 203.4 MB. Free memory was 153.0 MB in the beginning and 150.3 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:59:43,060 INFO L168 Benchmark]: RCFGBuilder took 959.94 ms. Allocated memory is still 203.4 MB. Free memory was 150.3 MB in the beginning and 94.7 MB in the end (delta: 55.6 MB). Peak memory consumption was 55.6 MB. Max. memory is 7.1 GB. [2019-12-27 19:59:43,061 INFO L168 Benchmark]: TraceAbstraction took 65034.17 ms. Allocated memory was 203.4 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 94.7 MB in the beginning and 2.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 391.4 MB. Max. memory is 7.1 GB. [2019-12-27 19:59:43,064 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.31 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 784.29 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 102.0 MB in the beginning and 156.3 MB in the end (delta: -54.4 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.28 ms. Allocated memory is still 203.4 MB. Free memory was 156.3 MB in the beginning and 153.0 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.08 ms. Allocated memory is still 203.4 MB. Free memory was 153.0 MB in the beginning and 150.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 959.94 ms. Allocated memory is still 203.4 MB. Free memory was 150.3 MB in the beginning and 94.7 MB in the end (delta: 55.6 MB). Peak memory consumption was 55.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 65034.17 ms. Allocated memory was 203.4 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 94.7 MB in the beginning and 2.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 391.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.5s, 197 ProgramPointsBefore, 106 ProgramPointsAfterwards, 243 TransitionsBefore, 126 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 30 ChoiceCompositions, 8928 VarBasedMoverChecksPositive, 249 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 134090 CheckedPairsTotal, 127 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(&t266, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] FCALL, FORK 0 pthread_create(&t267, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L844] FCALL, FORK 0 pthread_create(&t268, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L792] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L793] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L794] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L795] 3 z$r_buff0_thd3 = (_Bool)1 [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 z$flush_delayed = weak$$choice2 [L801] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L804] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L804] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L805] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L805] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L806] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 3 z = z$flush_delayed ? z$mem_tmp : z [L811] 3 z$flush_delayed = (_Bool)0 [L814] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 2 x = 1 [L755] 2 y = 1 [L758] 2 __unbuffered_p1_EAX = y [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 z$flush_delayed = weak$$choice2 [L764] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L818] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L765] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L819] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L766] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L767] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L768] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L771] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L851] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L852] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L853] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 188 locations, 2 error locations. Result: UNSAFE, OverallTime: 64.6s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 19.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3123 SDtfs, 9347 SDslu, 6076 SDs, 0 SdLazy, 2993 SolverSat, 581 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82542occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 33.9s AutomataMinimizationTime, 15 MinimizatonAttempts, 58552 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 547 NumberOfCodeBlocks, 547 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 469 ConstructedInterpolants, 0 QuantifiedInterpolants, 50847 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...