/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-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix016_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:02:19,144 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:02:19,147 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:02:19,165 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:02:19,165 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:02:19,167 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:02:19,169 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:02:19,179 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:02:19,182 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:02:19,185 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:02:19,187 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:02:19,188 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:02:19,189 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:02:19,190 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:02:19,193 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:02:19,194 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:02:19,195 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:02:19,195 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:02:19,197 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:02:19,198 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:02:19,200 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:02:19,201 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:02:19,202 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:02:19,202 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:02:19,204 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:02:19,204 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:02:19,205 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:02:19,205 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:02:19,206 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:02:19,207 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:02:19,207 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:02:19,208 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:02:19,208 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:02:19,209 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:02:19,210 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:02:19,210 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:02:19,211 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:02:19,211 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:02:19,211 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:02:19,212 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:02:19,212 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:02:19,213 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-SemanticLbe-MCR.epf [2019-12-27 16:02:19,227 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:02:19,227 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:02:19,228 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:02:19,229 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:02:19,229 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:02:19,229 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:02:19,229 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:02:19,229 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:02:19,230 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:02:19,230 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:02:19,230 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:02:19,230 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:02:19,230 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:02:19,231 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:02:19,231 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:02:19,231 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:02:19,231 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:02:19,231 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:02:19,232 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:02:19,232 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:02:19,232 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:02:19,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:02:19,232 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:02:19,233 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:02:19,233 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:02:19,233 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:02:19,233 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:02:19,233 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:02:19,234 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:02:19,234 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:02:19,234 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:02:19,504 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:02:19,525 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:02:19,528 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:02:19,529 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:02:19,530 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:02:19,531 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_pso.opt.i [2019-12-27 16:02:19,599 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ed11cf61/da64bcd3ce3447ec8364896d0d25e5f3/FLAGc6d0b3935 [2019-12-27 16:02:20,175 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:02:20,176 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_pso.opt.i [2019-12-27 16:02:20,191 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ed11cf61/da64bcd3ce3447ec8364896d0d25e5f3/FLAGc6d0b3935 [2019-12-27 16:02:20,463 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ed11cf61/da64bcd3ce3447ec8364896d0d25e5f3 [2019-12-27 16:02:20,476 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:02:20,478 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:02:20,482 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:02:20,482 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:02:20,485 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:02:20,486 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:02:20" (1/1) ... [2019-12-27 16:02:20,490 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1709cc9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:02:20, skipping insertion in model container [2019-12-27 16:02:20,490 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:02:20" (1/1) ... [2019-12-27 16:02:20,497 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:02:20,556 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:02:21,076 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:02:21,094 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:02:21,168 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:02:21,243 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:02:21,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:02:21 WrapperNode [2019-12-27 16:02:21,244 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:02:21,245 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:02:21,245 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:02:21,245 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:02:21,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:02:21" (1/1) ... [2019-12-27 16:02:21,276 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:02:21" (1/1) ... [2019-12-27 16:02:21,314 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:02:21,314 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:02:21,314 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:02:21,315 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:02:21,325 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:02:21" (1/1) ... [2019-12-27 16:02:21,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:02:21" (1/1) ... [2019-12-27 16:02:21,331 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:02:21" (1/1) ... [2019-12-27 16:02:21,331 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:02:21" (1/1) ... [2019-12-27 16:02:21,342 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:02:21" (1/1) ... [2019-12-27 16:02:21,347 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:02:21" (1/1) ... [2019-12-27 16:02:21,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:02:21" (1/1) ... [2019-12-27 16:02:21,357 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:02:21,357 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:02:21,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:02:21,357 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:02:21,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:02:21" (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 16:02:21,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:02:21,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:02:21,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:02:21,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:02:21,441 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:02:21,442 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:02:21,443 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:02:21,443 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:02:21,444 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 16:02:21,444 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 16:02:21,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:02:21,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:02:21,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:02:21,448 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 16:02:22,509 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:02:22,510 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:02:22,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:02:22 BoogieIcfgContainer [2019-12-27 16:02:22,512 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:02:22,514 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:02:22,515 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:02:22,520 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:02:22,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:02:20" (1/3) ... [2019-12-27 16:02:22,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ef7fd17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:02:22, skipping insertion in model container [2019-12-27 16:02:22,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:02:21" (2/3) ... [2019-12-27 16:02:22,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ef7fd17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:02:22, skipping insertion in model container [2019-12-27 16:02:22,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:02:22" (3/3) ... [2019-12-27 16:02:22,525 INFO L109 eAbstractionObserver]: Analyzing ICFG mix016_pso.opt.i [2019-12-27 16:02:22,537 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:02:22,537 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:02:22,550 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:02:22,551 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:02:22,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,630 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,630 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,633 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,633 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,653 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,653 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,654 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,654 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,654 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,663 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,664 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,681 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,682 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,684 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,686 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,691 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,691 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,694 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,697 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:02:22,713 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 16:02:22,733 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:02:22,733 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:02:22,733 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:02:22,733 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:02:22,733 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:02:22,734 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:02:22,734 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:02:22,734 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:02:22,752 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 195 places, 241 transitions [2019-12-27 16:02:22,754 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 195 places, 241 transitions [2019-12-27 16:02:22,870 INFO L132 PetriNetUnfolder]: 56/238 cut-off events. [2019-12-27 16:02:22,871 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:02:22,890 INFO L76 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 238 events. 56/238 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 563 event pairs. 0/180 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-27 16:02:22,922 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 195 places, 241 transitions [2019-12-27 16:02:22,987 INFO L132 PetriNetUnfolder]: 56/238 cut-off events. [2019-12-27 16:02:22,987 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:02:22,999 INFO L76 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 238 events. 56/238 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 563 event pairs. 0/180 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-27 16:02:23,035 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-27 16:02:23,036 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:02:29,262 WARN L192 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 16:02:29,384 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 16:02:29,423 INFO L206 etLargeBlockEncoding]: Checked pairs total: 147047 [2019-12-27 16:02:29,424 INFO L214 etLargeBlockEncoding]: Total number of compositions: 124 [2019-12-27 16:02:29,426 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 111 places, 134 transitions [2019-12-27 16:02:33,712 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 48534 states. [2019-12-27 16:02:33,714 INFO L276 IsEmpty]: Start isEmpty. Operand 48534 states. [2019-12-27 16:02:33,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 16:02:33,721 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:33,722 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:02:33,722 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 16:02:33,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:33,727 INFO L82 PathProgramCache]: Analyzing trace with hash 746662760, now seen corresponding path program 1 times [2019-12-27 16:02:33,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:33,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166524997] [2019-12-27 16:02:33,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:34,028 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 16:02:34,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166524997] [2019-12-27 16:02:34,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:34,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:02:34,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2050231256] [2019-12-27 16:02:34,033 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:34,038 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:34,053 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 16:02:34,054 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:34,058 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:02:34,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:02:34,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:34,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:02:34,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:02:34,076 INFO L87 Difference]: Start difference. First operand 48534 states. Second operand 3 states. [2019-12-27 16:02:35,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:35,003 INFO L93 Difference]: Finished difference Result 48214 states and 197664 transitions. [2019-12-27 16:02:35,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:02:35,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 16:02:35,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:35,334 INFO L225 Difference]: With dead ends: 48214 [2019-12-27 16:02:35,335 INFO L226 Difference]: Without dead ends: 44902 [2019-12-27 16:02:35,336 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 16:02:37,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44902 states. [2019-12-27 16:02:38,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44902 to 44902. [2019-12-27 16:02:38,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44902 states. [2019-12-27 16:02:39,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44902 states to 44902 states and 183960 transitions. [2019-12-27 16:02:39,141 INFO L78 Accepts]: Start accepts. Automaton has 44902 states and 183960 transitions. Word has length 7 [2019-12-27 16:02:39,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:39,142 INFO L462 AbstractCegarLoop]: Abstraction has 44902 states and 183960 transitions. [2019-12-27 16:02:39,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:02:39,143 INFO L276 IsEmpty]: Start isEmpty. Operand 44902 states and 183960 transitions. [2019-12-27 16:02:39,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 16:02:39,150 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:39,150 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:02:39,150 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 16:02:39,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:39,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1082779043, now seen corresponding path program 1 times [2019-12-27 16:02:39,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:39,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611622969] [2019-12-27 16:02:39,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:39,271 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 16:02:39,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611622969] [2019-12-27 16:02:39,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:39,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:02:39,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [590073289] [2019-12-27 16:02:39,272 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:39,273 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:39,277 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 16:02:39,277 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:39,277 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:02:39,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:02:39,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:39,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:02:39,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:02:39,280 INFO L87 Difference]: Start difference. First operand 44902 states and 183960 transitions. Second operand 4 states. [2019-12-27 16:02:41,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:41,838 INFO L93 Difference]: Finished difference Result 71574 states and 281396 transitions. [2019-12-27 16:02:41,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:02:41,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 16:02:41,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:42,204 INFO L225 Difference]: With dead ends: 71574 [2019-12-27 16:02:42,205 INFO L226 Difference]: Without dead ends: 71542 [2019-12-27 16:02:42,206 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 16:02:43,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71542 states. [2019-12-27 16:02:44,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71542 to 69774. [2019-12-27 16:02:44,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69774 states. [2019-12-27 16:02:45,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69774 states to 69774 states and 275806 transitions. [2019-12-27 16:02:45,640 INFO L78 Accepts]: Start accepts. Automaton has 69774 states and 275806 transitions. Word has length 13 [2019-12-27 16:02:45,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:45,641 INFO L462 AbstractCegarLoop]: Abstraction has 69774 states and 275806 transitions. [2019-12-27 16:02:45,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:02:45,641 INFO L276 IsEmpty]: Start isEmpty. Operand 69774 states and 275806 transitions. [2019-12-27 16:02:45,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:02:45,649 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:45,649 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:02:45,650 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 16:02:45,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:45,650 INFO L82 PathProgramCache]: Analyzing trace with hash 837864252, now seen corresponding path program 1 times [2019-12-27 16:02:45,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:45,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086208279] [2019-12-27 16:02:45,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:45,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:02:45,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086208279] [2019-12-27 16:02:45,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:45,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:02:45,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [743340185] [2019-12-27 16:02:45,749 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:45,751 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:45,754 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 16:02:45,755 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:45,789 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:02:45,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:02:45,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:45,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:02:45,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:02:45,791 INFO L87 Difference]: Start difference. First operand 69774 states and 275806 transitions. Second operand 5 states. [2019-12-27 16:02:49,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:49,464 INFO L93 Difference]: Finished difference Result 88624 states and 345355 transitions. [2019-12-27 16:02:49,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:02:49,465 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 16:02:49,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:49,747 INFO L225 Difference]: With dead ends: 88624 [2019-12-27 16:02:49,748 INFO L226 Difference]: Without dead ends: 88596 [2019-12-27 16:02:49,748 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 16:02:50,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88596 states. [2019-12-27 16:02:51,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88596 to 79570. [2019-12-27 16:02:51,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79570 states. [2019-12-27 16:02:52,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79570 states to 79570 states and 312836 transitions. [2019-12-27 16:02:52,165 INFO L78 Accepts]: Start accepts. Automaton has 79570 states and 312836 transitions. Word has length 16 [2019-12-27 16:02:52,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:02:52,166 INFO L462 AbstractCegarLoop]: Abstraction has 79570 states and 312836 transitions. [2019-12-27 16:02:52,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:02:52,166 INFO L276 IsEmpty]: Start isEmpty. Operand 79570 states and 312836 transitions. [2019-12-27 16:02:52,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 16:02:52,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:02:52,173 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:02:52,173 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 16:02:52,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:02:52,174 INFO L82 PathProgramCache]: Analyzing trace with hash 204017463, now seen corresponding path program 1 times [2019-12-27 16:02:52,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:02:52,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581365480] [2019-12-27 16:02:52,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:02:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:02:52,239 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 16:02:52,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581365480] [2019-12-27 16:02:52,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:02:52,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:02:52,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1394925828] [2019-12-27 16:02:52,240 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:02:52,242 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:02:52,247 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 57 transitions. [2019-12-27 16:02:52,247 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:02:52,273 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:02:52,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:02:52,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:02:52,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:02:52,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:02:52,275 INFO L87 Difference]: Start difference. First operand 79570 states and 312836 transitions. Second operand 5 states. [2019-12-27 16:02:53,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:02:53,653 INFO L93 Difference]: Finished difference Result 132064 states and 498805 transitions. [2019-12-27 16:02:53,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:02:53,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 16:02:53,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:02:54,094 INFO L225 Difference]: With dead ends: 132064 [2019-12-27 16:02:54,095 INFO L226 Difference]: Without dead ends: 132064 [2019-12-27 16:02:54,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:02:58,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132064 states. [2019-12-27 16:03:00,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132064 to 117574. [2019-12-27 16:03:00,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117574 states. [2019-12-27 16:03:01,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117574 states to 117574 states and 450334 transitions. [2019-12-27 16:03:01,086 INFO L78 Accepts]: Start accepts. Automaton has 117574 states and 450334 transitions. Word has length 17 [2019-12-27 16:03:01,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:03:01,086 INFO L462 AbstractCegarLoop]: Abstraction has 117574 states and 450334 transitions. [2019-12-27 16:03:01,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:03:01,086 INFO L276 IsEmpty]: Start isEmpty. Operand 117574 states and 450334 transitions. [2019-12-27 16:03:01,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 16:03:01,095 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:03:01,095 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 16:03:01,095 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 16:03:01,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:03:01,096 INFO L82 PathProgramCache]: Analyzing trace with hash 628271860, now seen corresponding path program 1 times [2019-12-27 16:03:01,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:03:01,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449185038] [2019-12-27 16:03:01,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:03:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:03:01,168 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 16:03:01,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449185038] [2019-12-27 16:03:01,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:03:01,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:03:01,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [380466049] [2019-12-27 16:03:01,169 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:03:01,171 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:03:01,174 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 20 transitions. [2019-12-27 16:03:01,174 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:03:01,174 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:03:01,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:03:01,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:03:01,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:03:01,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:03:01,175 INFO L87 Difference]: Start difference. First operand 117574 states and 450334 transitions. Second operand 3 states. [2019-12-27 16:03:02,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:03:02,422 INFO L93 Difference]: Finished difference Result 110770 states and 423756 transitions. [2019-12-27 16:03:02,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:03:02,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 16:03:02,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:03:02,702 INFO L225 Difference]: With dead ends: 110770 [2019-12-27 16:03:02,702 INFO L226 Difference]: Without dead ends: 110770 [2019-12-27 16:03:02,703 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 16:03:07,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110770 states. [2019-12-27 16:03:09,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110770 to 110770. [2019-12-27 16:03:09,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110770 states. [2019-12-27 16:03:09,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110770 states to 110770 states and 423756 transitions. [2019-12-27 16:03:09,495 INFO L78 Accepts]: Start accepts. Automaton has 110770 states and 423756 transitions. Word has length 18 [2019-12-27 16:03:09,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:03:09,496 INFO L462 AbstractCegarLoop]: Abstraction has 110770 states and 423756 transitions. [2019-12-27 16:03:09,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:03:09,496 INFO L276 IsEmpty]: Start isEmpty. Operand 110770 states and 423756 transitions. [2019-12-27 16:03:09,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 16:03:09,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:03:09,509 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:03:09,509 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 16:03:09,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:03:09,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1364222767, now seen corresponding path program 1 times [2019-12-27 16:03:09,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:03:09,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576604399] [2019-12-27 16:03:09,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:03:09,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:03:09,567 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 16:03:09,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576604399] [2019-12-27 16:03:09,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:03:09,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:03:09,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [138540793] [2019-12-27 16:03:09,568 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:03:09,570 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:03:09,576 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 44 states and 67 transitions. [2019-12-27 16:03:09,576 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:03:09,591 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:03:09,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:03:09,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:03:09,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:03:09,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:03:09,593 INFO L87 Difference]: Start difference. First operand 110770 states and 423756 transitions. Second operand 5 states. [2019-12-27 16:03:11,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:03:11,344 INFO L93 Difference]: Finished difference Result 136240 states and 514357 transitions. [2019-12-27 16:03:11,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:03:11,344 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 16:03:11,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:03:11,716 INFO L225 Difference]: With dead ends: 136240 [2019-12-27 16:03:11,716 INFO L226 Difference]: Without dead ends: 136206 [2019-12-27 16:03:11,717 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 16:03:12,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136206 states. [2019-12-27 16:03:18,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136206 to 112236. [2019-12-27 16:03:18,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112236 states. [2019-12-27 16:03:18,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112236 states to 112236 states and 429275 transitions. [2019-12-27 16:03:18,931 INFO L78 Accepts]: Start accepts. Automaton has 112236 states and 429275 transitions. Word has length 19 [2019-12-27 16:03:18,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:03:18,932 INFO L462 AbstractCegarLoop]: Abstraction has 112236 states and 429275 transitions. [2019-12-27 16:03:18,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:03:18,932 INFO L276 IsEmpty]: Start isEmpty. Operand 112236 states and 429275 transitions. [2019-12-27 16:03:18,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 16:03:18,951 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:03:18,951 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 16:03:18,951 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 16:03:18,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:03:18,952 INFO L82 PathProgramCache]: Analyzing trace with hash -353279239, now seen corresponding path program 1 times [2019-12-27 16:03:18,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:03:18,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604088817] [2019-12-27 16:03:18,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:03:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:03:19,060 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 16:03:19,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604088817] [2019-12-27 16:03:19,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:03:19,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:03:19,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1478853447] [2019-12-27 16:03:19,061 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:03:19,065 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:03:19,076 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 100 transitions. [2019-12-27 16:03:19,076 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:03:19,086 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:03:19,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:03:19,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:03:19,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:03:19,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:03:19,087 INFO L87 Difference]: Start difference. First operand 112236 states and 429275 transitions. Second operand 6 states. [2019-12-27 16:03:22,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:03:22,651 INFO L93 Difference]: Finished difference Result 339392 states and 1269863 transitions. [2019-12-27 16:03:22,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:03:22,652 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 16:03:22,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:03:29,677 INFO L225 Difference]: With dead ends: 339392 [2019-12-27 16:03:29,677 INFO L226 Difference]: Without dead ends: 339310 [2019-12-27 16:03:29,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:03:31,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339310 states. [2019-12-27 16:03:35,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339310 to 121726. [2019-12-27 16:03:35,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121726 states. [2019-12-27 16:03:35,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121726 states to 121726 states and 463570 transitions. [2019-12-27 16:03:35,393 INFO L78 Accepts]: Start accepts. Automaton has 121726 states and 463570 transitions. Word has length 22 [2019-12-27 16:03:35,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:03:35,394 INFO L462 AbstractCegarLoop]: Abstraction has 121726 states and 463570 transitions. [2019-12-27 16:03:35,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:03:35,394 INFO L276 IsEmpty]: Start isEmpty. Operand 121726 states and 463570 transitions. [2019-12-27 16:03:35,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 16:03:35,435 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:03:35,435 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] [2019-12-27 16:03:35,435 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 16:03:35,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:03:35,435 INFO L82 PathProgramCache]: Analyzing trace with hash -2009208716, now seen corresponding path program 1 times [2019-12-27 16:03:35,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:03:35,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713394041] [2019-12-27 16:03:35,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:03:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:03:35,507 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 16:03:35,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713394041] [2019-12-27 16:03:35,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:03:35,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:03:35,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [60517378] [2019-12-27 16:03:35,508 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:03:35,511 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:03:35,519 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 65 transitions. [2019-12-27 16:03:35,520 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:03:35,559 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 16:03:35,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:03:35,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:03:35,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:03:35,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:03:35,560 INFO L87 Difference]: Start difference. First operand 121726 states and 463570 transitions. Second operand 5 states. [2019-12-27 16:03:37,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:03:37,428 INFO L93 Difference]: Finished difference Result 100107 states and 330782 transitions. [2019-12-27 16:03:37,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:03:37,429 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 16:03:37,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:03:37,600 INFO L225 Difference]: With dead ends: 100107 [2019-12-27 16:03:37,600 INFO L226 Difference]: Without dead ends: 88315 [2019-12-27 16:03:37,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:03:38,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88315 states. [2019-12-27 16:03:40,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88315 to 76795. [2019-12-27 16:03:40,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76795 states. [2019-12-27 16:03:40,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76795 states to 76795 states and 255753 transitions. [2019-12-27 16:03:40,464 INFO L78 Accepts]: Start accepts. Automaton has 76795 states and 255753 transitions. Word has length 25 [2019-12-27 16:03:40,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:03:40,465 INFO L462 AbstractCegarLoop]: Abstraction has 76795 states and 255753 transitions. [2019-12-27 16:03:40,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:03:40,465 INFO L276 IsEmpty]: Start isEmpty. Operand 76795 states and 255753 transitions. [2019-12-27 16:03:40,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 16:03:40,491 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:03:40,492 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:03:40,492 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 16:03:40,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:03:40,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1299418381, now seen corresponding path program 1 times [2019-12-27 16:03:40,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:03:40,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93785662] [2019-12-27 16:03:40,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:03:40,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:03:40,561 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 16:03:40,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93785662] [2019-12-27 16:03:40,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:03:40,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:03:40,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [407394824] [2019-12-27 16:03:40,562 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:03:40,566 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:03:40,577 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 51 states and 74 transitions. [2019-12-27 16:03:40,577 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:03:40,607 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 16:03:40,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:03:40,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:03:40,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:03:40,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:03:40,608 INFO L87 Difference]: Start difference. First operand 76795 states and 255753 transitions. Second operand 6 states. [2019-12-27 16:03:41,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:03:41,291 INFO L93 Difference]: Finished difference Result 21340 states and 61329 transitions. [2019-12-27 16:03:41,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:03:41,292 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-27 16:03:41,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:03:41,312 INFO L225 Difference]: With dead ends: 21340 [2019-12-27 16:03:41,313 INFO L226 Difference]: Without dead ends: 15113 [2019-12-27 16:03:41,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:03:41,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15113 states. [2019-12-27 16:03:41,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15113 to 13171. [2019-12-27 16:03:41,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13171 states. [2019-12-27 16:03:41,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13171 states to 13171 states and 36003 transitions. [2019-12-27 16:03:41,477 INFO L78 Accepts]: Start accepts. Automaton has 13171 states and 36003 transitions. Word has length 26 [2019-12-27 16:03:41,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:03:41,477 INFO L462 AbstractCegarLoop]: Abstraction has 13171 states and 36003 transitions. [2019-12-27 16:03:41,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:03:41,478 INFO L276 IsEmpty]: Start isEmpty. Operand 13171 states and 36003 transitions. [2019-12-27 16:03:41,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 16:03:41,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:03:41,489 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 16:03:41,489 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 16:03:41,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:03:41,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1846791940, now seen corresponding path program 1 times [2019-12-27 16:03:41,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:03:41,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724534765] [2019-12-27 16:03:41,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:03:41,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:03:41,535 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 16:03:41,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724534765] [2019-12-27 16:03:41,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:03:41,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:03:41,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1788397310] [2019-12-27 16:03:41,536 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:03:41,542 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:03:41,558 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 79 states and 122 transitions. [2019-12-27 16:03:41,558 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:03:41,577 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:03:41,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:03:41,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:03:41,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:03:41,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:03:41,578 INFO L87 Difference]: Start difference. First operand 13171 states and 36003 transitions. Second operand 5 states. [2019-12-27 16:03:41,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:03:41,727 INFO L93 Difference]: Finished difference Result 14080 states and 36363 transitions. [2019-12-27 16:03:41,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:03:41,727 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-27 16:03:41,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:03:41,744 INFO L225 Difference]: With dead ends: 14080 [2019-12-27 16:03:41,744 INFO L226 Difference]: Without dead ends: 14080 [2019-12-27 16:03:41,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:03:41,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14080 states. [2019-12-27 16:03:41,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14080 to 13328. [2019-12-27 16:03:41,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13328 states. [2019-12-27 16:03:41,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13328 states to 13328 states and 34646 transitions. [2019-12-27 16:03:41,903 INFO L78 Accepts]: Start accepts. Automaton has 13328 states and 34646 transitions. Word has length 34 [2019-12-27 16:03:41,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:03:41,904 INFO L462 AbstractCegarLoop]: Abstraction has 13328 states and 34646 transitions. [2019-12-27 16:03:41,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:03:41,904 INFO L276 IsEmpty]: Start isEmpty. Operand 13328 states and 34646 transitions. [2019-12-27 16:03:41,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 16:03:41,914 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:03:41,914 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:03:41,915 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 16:03:41,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:03:41,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1321912617, now seen corresponding path program 1 times [2019-12-27 16:03:41,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:03:41,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38242896] [2019-12-27 16:03:41,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:03:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:03:42,008 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 16:03:42,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38242896] [2019-12-27 16:03:42,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:03:42,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:03:42,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1126700368] [2019-12-27 16:03:42,009 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:03:42,017 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:03:42,047 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 137 transitions. [2019-12-27 16:03:42,047 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:03:42,086 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:03:42,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:03:42,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:03:42,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:03:42,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:03:42,088 INFO L87 Difference]: Start difference. First operand 13328 states and 34646 transitions. Second operand 7 states. [2019-12-27 16:03:42,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:03:42,233 INFO L93 Difference]: Finished difference Result 10712 states and 28804 transitions. [2019-12-27 16:03:42,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:03:42,234 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-12-27 16:03:42,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:03:42,249 INFO L225 Difference]: With dead ends: 10712 [2019-12-27 16:03:42,250 INFO L226 Difference]: Without dead ends: 10409 [2019-12-27 16:03:42,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:03:42,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10409 states. [2019-12-27 16:03:42,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10409 to 8959. [2019-12-27 16:03:42,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8959 states. [2019-12-27 16:03:42,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8959 states to 8959 states and 24657 transitions. [2019-12-27 16:03:42,411 INFO L78 Accepts]: Start accepts. Automaton has 8959 states and 24657 transitions. Word has length 37 [2019-12-27 16:03:42,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:03:42,411 INFO L462 AbstractCegarLoop]: Abstraction has 8959 states and 24657 transitions. [2019-12-27 16:03:42,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:03:42,411 INFO L276 IsEmpty]: Start isEmpty. Operand 8959 states and 24657 transitions. [2019-12-27 16:03:42,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-27 16:03:42,420 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:03:42,420 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:03:42,420 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 16:03:42,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:03:42,421 INFO L82 PathProgramCache]: Analyzing trace with hash 96055285, now seen corresponding path program 1 times [2019-12-27 16:03:42,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:03:42,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194306733] [2019-12-27 16:03:42,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:03:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:03:42,504 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 16:03:42,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194306733] [2019-12-27 16:03:42,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:03:42,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:03:42,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [979764168] [2019-12-27 16:03:42,505 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:03:42,842 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:03:42,905 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 98 states and 131 transitions. [2019-12-27 16:03:42,905 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:03:42,906 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:03:42,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:03:42,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:03:42,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:03:42,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:03:42,907 INFO L87 Difference]: Start difference. First operand 8959 states and 24657 transitions. Second operand 4 states. [2019-12-27 16:03:42,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:03:42,958 INFO L93 Difference]: Finished difference Result 10186 states and 27255 transitions. [2019-12-27 16:03:42,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:03:42,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-12-27 16:03:42,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:03:42,969 INFO L225 Difference]: With dead ends: 10186 [2019-12-27 16:03:42,969 INFO L226 Difference]: Without dead ends: 5702 [2019-12-27 16:03:42,969 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 16:03:42,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5702 states. [2019-12-27 16:03:43,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5702 to 5702. [2019-12-27 16:03:43,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5702 states. [2019-12-27 16:03:43,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5702 states to 5702 states and 13900 transitions. [2019-12-27 16:03:43,032 INFO L78 Accepts]: Start accepts. Automaton has 5702 states and 13900 transitions. Word has length 61 [2019-12-27 16:03:43,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:03:43,033 INFO L462 AbstractCegarLoop]: Abstraction has 5702 states and 13900 transitions. [2019-12-27 16:03:43,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:03:43,033 INFO L276 IsEmpty]: Start isEmpty. Operand 5702 states and 13900 transitions. [2019-12-27 16:03:43,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-27 16:03:43,038 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:03:43,039 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:03:43,039 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 16:03:43,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:03:43,039 INFO L82 PathProgramCache]: Analyzing trace with hash -346046383, now seen corresponding path program 2 times [2019-12-27 16:03:43,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:03:43,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723828048] [2019-12-27 16:03:43,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:03:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:03:43,132 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 16:03:43,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723828048] [2019-12-27 16:03:43,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:03:43,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:03:43,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1559154790] [2019-12-27 16:03:43,134 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:03:43,152 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:03:43,236 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 110 states and 155 transitions. [2019-12-27 16:03:43,236 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:03:43,249 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:03:43,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:03:43,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:03:43,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:03:43,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:03:43,252 INFO L87 Difference]: Start difference. First operand 5702 states and 13900 transitions. Second operand 7 states. [2019-12-27 16:03:43,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:03:43,637 INFO L93 Difference]: Finished difference Result 15430 states and 38417 transitions. [2019-12-27 16:03:43,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 16:03:43,637 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2019-12-27 16:03:43,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:03:43,650 INFO L225 Difference]: With dead ends: 15430 [2019-12-27 16:03:43,650 INFO L226 Difference]: Without dead ends: 10617 [2019-12-27 16:03:43,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-12-27 16:03:43,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10617 states. [2019-12-27 16:03:43,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10617 to 8187. [2019-12-27 16:03:43,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8187 states. [2019-12-27 16:03:43,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8187 states to 8187 states and 19565 transitions. [2019-12-27 16:03:43,750 INFO L78 Accepts]: Start accepts. Automaton has 8187 states and 19565 transitions. Word has length 61 [2019-12-27 16:03:43,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:03:43,751 INFO L462 AbstractCegarLoop]: Abstraction has 8187 states and 19565 transitions. [2019-12-27 16:03:43,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:03:43,751 INFO L276 IsEmpty]: Start isEmpty. Operand 8187 states and 19565 transitions. [2019-12-27 16:03:43,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-27 16:03:43,758 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:03:43,758 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:03:43,758 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 16:03:43,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:03:43,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1127471651, now seen corresponding path program 3 times [2019-12-27 16:03:43,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:03:43,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192317121] [2019-12-27 16:03:43,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:03:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:03:43,830 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 16:03:43,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192317121] [2019-12-27 16:03:43,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:03:43,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:03:43,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1638244707] [2019-12-27 16:03:43,831 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:03:43,849 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:03:43,940 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 112 states and 160 transitions. [2019-12-27 16:03:43,940 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:03:43,941 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:03:43,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:03:43,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:03:43,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:03:43,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:03:43,942 INFO L87 Difference]: Start difference. First operand 8187 states and 19565 transitions. Second operand 4 states. [2019-12-27 16:03:43,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:03:43,981 INFO L93 Difference]: Finished difference Result 8810 states and 20893 transitions. [2019-12-27 16:03:43,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:03:43,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-12-27 16:03:43,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:03:43,983 INFO L225 Difference]: With dead ends: 8810 [2019-12-27 16:03:43,983 INFO L226 Difference]: Without dead ends: 694 [2019-12-27 16:03:43,983 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 16:03:43,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2019-12-27 16:03:43,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 694. [2019-12-27 16:03:43,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2019-12-27 16:03:43,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1430 transitions. [2019-12-27 16:03:43,990 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1430 transitions. Word has length 61 [2019-12-27 16:03:43,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:03:43,990 INFO L462 AbstractCegarLoop]: Abstraction has 694 states and 1430 transitions. [2019-12-27 16:03:43,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:03:43,990 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1430 transitions. [2019-12-27 16:03:43,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 16:03:43,991 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:03:43,991 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 16:03:43,992 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 16:03:43,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:03:43,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1007960676, now seen corresponding path program 1 times [2019-12-27 16:03:43,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:03:43,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970476636] [2019-12-27 16:03:43,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:03:44,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:03:44,096 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 16:03:44,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970476636] [2019-12-27 16:03:44,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:03:44,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:03:44,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1857234583] [2019-12-27 16:03:44,098 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:03:44,137 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:03:44,211 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 121 states and 170 transitions. [2019-12-27 16:03:44,212 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:03:44,304 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:03:44,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 16:03:44,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:03:44,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 16:03:44,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:03:44,306 INFO L87 Difference]: Start difference. First operand 694 states and 1430 transitions. Second operand 11 states. [2019-12-27 16:03:46,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:03:46,103 INFO L93 Difference]: Finished difference Result 2657 states and 5374 transitions. [2019-12-27 16:03:46,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 16:03:46,103 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2019-12-27 16:03:46,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:03:46,106 INFO L225 Difference]: With dead ends: 2657 [2019-12-27 16:03:46,106 INFO L226 Difference]: Without dead ends: 1913 [2019-12-27 16:03:46,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=225, Invalid=831, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 16:03:46,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1913 states. [2019-12-27 16:03:46,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1913 to 758. [2019-12-27 16:03:46,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2019-12-27 16:03:46,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1541 transitions. [2019-12-27 16:03:46,119 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1541 transitions. Word has length 62 [2019-12-27 16:03:46,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:03:46,119 INFO L462 AbstractCegarLoop]: Abstraction has 758 states and 1541 transitions. [2019-12-27 16:03:46,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 16:03:46,119 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1541 transitions. [2019-12-27 16:03:46,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 16:03:46,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:03:46,120 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 16:03:46,120 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 16:03:46,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:03:46,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1552326044, now seen corresponding path program 2 times [2019-12-27 16:03:46,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:03:46,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449364173] [2019-12-27 16:03:46,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:03:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:03:46,243 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 16:03:46,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449364173] [2019-12-27 16:03:46,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:03:46,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:03:46,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1770388859] [2019-12-27 16:03:46,244 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:03:46,262 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:03:46,358 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 121 states and 165 transitions. [2019-12-27 16:03:46,358 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:03:46,506 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 16:03:46,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 16:03:46,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:03:46,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 16:03:46,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:03:46,507 INFO L87 Difference]: Start difference. First operand 758 states and 1541 transitions. Second operand 13 states. [2019-12-27 16:03:47,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:03:47,951 INFO L93 Difference]: Finished difference Result 1501 states and 2891 transitions. [2019-12-27 16:03:47,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 16:03:47,952 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2019-12-27 16:03:47,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:03:47,954 INFO L225 Difference]: With dead ends: 1501 [2019-12-27 16:03:47,954 INFO L226 Difference]: Without dead ends: 1501 [2019-12-27 16:03:47,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2019-12-27 16:03:47,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2019-12-27 16:03:47,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1119. [2019-12-27 16:03:47,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2019-12-27 16:03:47,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 2224 transitions. [2019-12-27 16:03:47,966 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 2224 transitions. Word has length 62 [2019-12-27 16:03:47,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:03:47,967 INFO L462 AbstractCegarLoop]: Abstraction has 1119 states and 2224 transitions. [2019-12-27 16:03:47,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 16:03:47,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 2224 transitions. [2019-12-27 16:03:47,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 16:03:47,968 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:03:47,968 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 16:03:47,968 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:03:47,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:03:47,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1744889270, now seen corresponding path program 3 times [2019-12-27 16:03:47,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:03:47,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592224549] [2019-12-27 16:03:47,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:03:47,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:03:48,056 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 16:03:48,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592224549] [2019-12-27 16:03:48,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:03:48,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:03:48,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1678068692] [2019-12-27 16:03:48,058 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:03:48,074 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:03:48,133 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 81 states and 97 transitions. [2019-12-27 16:03:48,133 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:03:48,164 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:03:48,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 16:03:48,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:03:48,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 16:03:48,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:03:48,166 INFO L87 Difference]: Start difference. First operand 1119 states and 2224 transitions. Second operand 10 states. [2019-12-27 16:03:48,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:03:48,672 INFO L93 Difference]: Finished difference Result 2189 states and 4257 transitions. [2019-12-27 16:03:48,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 16:03:48,672 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 62 [2019-12-27 16:03:48,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:03:48,675 INFO L225 Difference]: With dead ends: 2189 [2019-12-27 16:03:48,675 INFO L226 Difference]: Without dead ends: 2019 [2019-12-27 16:03:48,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2019-12-27 16:03:48,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2019 states. [2019-12-27 16:03:48,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2019 to 1109. [2019-12-27 16:03:48,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1109 states. [2019-12-27 16:03:48,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 2204 transitions. [2019-12-27 16:03:48,688 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 2204 transitions. Word has length 62 [2019-12-27 16:03:48,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:03:48,689 INFO L462 AbstractCegarLoop]: Abstraction has 1109 states and 2204 transitions. [2019-12-27 16:03:48,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 16:03:48,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 2204 transitions. [2019-12-27 16:03:48,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 16:03:48,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:03:48,690 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 16:03:48,690 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:03:48,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:03:48,690 INFO L82 PathProgramCache]: Analyzing trace with hash -2036190378, now seen corresponding path program 4 times [2019-12-27 16:03:48,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:03:48,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089659747] [2019-12-27 16:03:48,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:03:48,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:03:48,784 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 16:03:48,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089659747] [2019-12-27 16:03:48,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:03:48,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:03:48,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [278711913] [2019-12-27 16:03:48,786 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:03:48,806 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:03:48,910 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 121 states and 173 transitions. [2019-12-27 16:03:48,910 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:03:48,999 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 16:03:48,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:03:48,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:03:49,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:03:49,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:03:49,000 INFO L87 Difference]: Start difference. First operand 1109 states and 2204 transitions. Second operand 7 states. [2019-12-27 16:03:49,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:03:49,735 INFO L93 Difference]: Finished difference Result 1746 states and 3411 transitions. [2019-12-27 16:03:49,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:03:49,736 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-12-27 16:03:49,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:03:49,737 INFO L225 Difference]: With dead ends: 1746 [2019-12-27 16:03:49,738 INFO L226 Difference]: Without dead ends: 1746 [2019-12-27 16:03:49,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:03:49,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1746 states. [2019-12-27 16:03:49,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1746 to 1167. [2019-12-27 16:03:49,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1167 states. [2019-12-27 16:03:49,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 2322 transitions. [2019-12-27 16:03:49,752 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 2322 transitions. Word has length 62 [2019-12-27 16:03:49,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:03:49,752 INFO L462 AbstractCegarLoop]: Abstraction has 1167 states and 2322 transitions. [2019-12-27 16:03:49,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:03:49,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 2322 transitions. [2019-12-27 16:03:49,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 16:03:49,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:03:49,753 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 16:03:49,754 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:03:49,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:03:49,754 INFO L82 PathProgramCache]: Analyzing trace with hash 229898378, now seen corresponding path program 5 times [2019-12-27 16:03:49,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:03:49,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571662538] [2019-12-27 16:03:49,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:03:49,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:03:49,820 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 16:03:49,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571662538] [2019-12-27 16:03:49,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:03:49,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:03:49,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [398504713] [2019-12-27 16:03:49,821 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:03:49,838 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:03:49,900 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 107 transitions. [2019-12-27 16:03:49,900 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:03:49,900 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:03:49,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:03:49,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:03:49,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:03:49,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:03:49,902 INFO L87 Difference]: Start difference. First operand 1167 states and 2322 transitions. Second operand 3 states. [2019-12-27 16:03:49,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:03:49,918 INFO L93 Difference]: Finished difference Result 1167 states and 2321 transitions. [2019-12-27 16:03:49,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:03:49,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-12-27 16:03:49,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:03:49,920 INFO L225 Difference]: With dead ends: 1167 [2019-12-27 16:03:49,921 INFO L226 Difference]: Without dead ends: 1167 [2019-12-27 16:03:49,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:03:49,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2019-12-27 16:03:49,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1022. [2019-12-27 16:03:49,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1022 states. [2019-12-27 16:03:49,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 2053 transitions. [2019-12-27 16:03:49,930 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 2053 transitions. Word has length 62 [2019-12-27 16:03:49,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:03:49,931 INFO L462 AbstractCegarLoop]: Abstraction has 1022 states and 2053 transitions. [2019-12-27 16:03:49,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:03:49,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 2053 transitions. [2019-12-27 16:03:49,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 16:03:49,932 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:03:49,932 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 16:03:49,932 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:03:49,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:03:49,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1358707696, now seen corresponding path program 1 times [2019-12-27 16:03:49,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:03:49,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601135317] [2019-12-27 16:03:49,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:03:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:03:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:03:50,036 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:03:50,036 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:03:50,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~weak$$choice2~0_331 0) (= v_~y$mem_tmp~0_262 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t418~0.base_35|) (= v_~main$tmp_guard0~0_31 0) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~y$w_buff1_used~0_559 0) (= |v_#NULL.offset_6| 0) (= v_~y$r_buff0_thd0~0_210 0) (= v_~y$read_delayed~0_8 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t418~0.base_35| 4) |v_#length_23|) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$w_buff1~0_273 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t418~0.base_35| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t418~0.base_35|) |v_ULTIMATE.start_main_~#t418~0.offset_24| 0)) |v_#memory_int_19|) (= 0 v_~y$w_buff0~0_396) (= v_~y$flush_delayed~0_331 0) (= v_~y$r_buff1_thd1~0_223 0) (= 0 v_~y$r_buff0_thd2~0_420) (= 0 v_~__unbuffered_p1_EAX~0_45) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t418~0.base_35| 1)) (= 0 v_~weak$$choice0~0_251) (= v_~y$r_buff1_thd0~0_289 0) (= v_~__unbuffered_cnt~0_185 0) (= v_~y$w_buff0_used~0_892 0) (= v_~y$r_buff0_thd1~0_153 0) (= 0 |v_#NULL.base_6|) (= v_~x~0_52 0) (= 0 |v_ULTIMATE.start_main_~#t418~0.offset_24|) (= v_~main$tmp_guard1~0_36 0) (= v_~y~0_382 0) (= 0 v_~y$r_buff0_thd3~0_625) (= 0 v_~y$r_buff1_thd3~0_388) (= 0 v_~y$read_delayed_var~0.base_8) (= v_~z~0_29 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t418~0.base_35|) 0) (= 0 v_~y$r_buff1_thd2~0_385) (= v_~__unbuffered_p2_EBX~0_39 0) (= 0 v_~__unbuffered_p2_EAX~0_52) (= 0 v_~__unbuffered_p0_EAX~0_47))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_21|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ULTIMATE.start_main_~#t418~0.offset=|v_ULTIMATE.start_main_~#t418~0.offset_24|, #NULL.offset=|v_#NULL.offset_6|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~y$mem_tmp~0=v_~y$mem_tmp~0_262, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_388, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_45, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_153, ~y$flush_delayed~0=v_~y$flush_delayed~0_331, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_52, ULTIMATE.start_main_~#t420~0.base=|v_ULTIMATE.start_main_~#t420~0.base_18|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_39, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_66|, ULTIMATE.start_main_~#t420~0.offset=|v_ULTIMATE.start_main_~#t420~0.offset_15|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_72|, ~weak$$choice0~0=v_~weak$$choice0~0_251, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_196|, ~y$w_buff1~0=v_~y$w_buff1~0_273, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_420, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_185, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_289, ~x~0=v_~x~0_52, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_892, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_223, ULTIMATE.start_main_~#t419~0.base=|v_ULTIMATE.start_main_~#t419~0.base_31|, ~y$w_buff0~0=v_~y$w_buff0~0_396, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_625, ~y~0=v_~y~0_382, ULTIMATE.start_main_~#t419~0.offset=|v_ULTIMATE.start_main_~#t419~0.offset_22|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_99|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_28|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_385, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_46|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_210, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t418~0.base=|v_ULTIMATE.start_main_~#t418~0.base_35|, ~z~0=v_~z~0_29, ~weak$$choice2~0=v_~weak$$choice2~0_331, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_559} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t418~0.offset, #NULL.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t420~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_~#t420~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t419~0.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t419~0.offset, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_~#t418~0.base, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 16:03:50,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L830-1-->L832: Formula: (and (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t419~0.base_11|) 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t419~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t419~0.base_11| 0)) (= 0 |v_ULTIMATE.start_main_~#t419~0.offset_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t419~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t419~0.base_11|) |v_ULTIMATE.start_main_~#t419~0.offset_10| 1)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t419~0.base_11|) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t419~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t419~0.base=|v_ULTIMATE.start_main_~#t419~0.base_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t419~0.offset=|v_ULTIMATE.start_main_~#t419~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t419~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t419~0.offset] because there is no mapped edge [2019-12-27 16:03:50,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L832-1-->L834: Formula: (and (not (= |v_ULTIMATE.start_main_~#t420~0.base_13| 0)) (= |v_ULTIMATE.start_main_~#t420~0.offset_11| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t420~0.base_13|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t420~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t420~0.base_13|) |v_ULTIMATE.start_main_~#t420~0.offset_11| 2)) |v_#memory_int_11|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t420~0.base_13|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t420~0.base_13| 4)) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t420~0.base_13| 1) |v_#valid_37|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t420~0.base=|v_ULTIMATE.start_main_~#t420~0.base_13|, ULTIMATE.start_main_~#t420~0.offset=|v_ULTIMATE.start_main_~#t420~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t420~0.base, ULTIMATE.start_main_~#t420~0.offset] because there is no mapped edge [2019-12-27 16:03:50,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] P2ENTRY-->L4-3: Formula: (and (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_39|) (= v_~y$w_buff0_used~0_219 v_~y$w_buff1_used~0_122) (= |v_P2Thread1of1ForFork0_#in~arg.offset_39| v_P2Thread1of1ForFork0_~arg.offset_39) (= |v_P2Thread1of1ForFork0_#in~arg.base_39| v_P2Thread1of1ForFork0_~arg.base_39) (= 1 v_~y$w_buff0~0_91) (= (mod v_~y$w_buff1_used~0_122 256) 0) (= v_~y$w_buff0~0_92 v_~y$w_buff1~0_64) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_41 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_39|) (= v_~y$w_buff0_used~0_218 1)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_39|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_219, ~y$w_buff0~0=v_~y$w_buff0~0_92, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_39|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_39, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_39|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_39|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_218, ~y$w_buff1~0=v_~y$w_buff1~0_64, ~y$w_buff0~0=v_~y$w_buff0~0_91, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_39, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_39|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_41, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_122} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 16:03:50,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L792-2-->L792-4: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-832088746 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-832088746 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_Out-832088746| ~y$w_buff0~0_In-832088746) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite28_Out-832088746| ~y$w_buff1~0_In-832088746)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-832088746, ~y$w_buff1~0=~y$w_buff1~0_In-832088746, ~y$w_buff0~0=~y$w_buff0~0_In-832088746, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-832088746} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-832088746|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-832088746, ~y$w_buff1~0=~y$w_buff1~0_In-832088746, ~y$w_buff0~0=~y$w_buff0~0_In-832088746, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-832088746} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 16:03:50,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L792-4-->L793: Formula: (= v_~y~0_37 |v_P2Thread1of1ForFork0_#t~ite28_8|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_8|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_7|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_7|, ~y~0=v_~y~0_37} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-27 16:03:50,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [888] [888] L797-->L798: Formula: (and (= v_~y$r_buff0_thd3~0_101 v_~y$r_buff0_thd3~0_100) (not (= (mod v_~weak$$choice2~0_47 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_101, ~weak$$choice2~0=v_~weak$$choice2~0_47} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_9|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_11|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_100, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_13|, ~weak$$choice2~0=v_~weak$$choice2~0_47} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 16:03:50,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In679133777 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite48_Out679133777| ~y$mem_tmp~0_In679133777)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite48_Out679133777| ~y~0_In679133777)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In679133777, ~y$flush_delayed~0=~y$flush_delayed~0_In679133777, ~y~0=~y~0_In679133777} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out679133777|, ~y$mem_tmp~0=~y$mem_tmp~0_In679133777, ~y$flush_delayed~0=~y$flush_delayed~0_In679133777, ~y~0=~y~0_In679133777} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-27 16:03:50,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_9|) (= v_~z~0_15 1) (= v_~__unbuffered_cnt~0_112 (+ v_~__unbuffered_cnt~0_113 1)) (= v_P0Thread1of1ForFork1_~arg.offset_11 |v_P0Thread1of1ForFork1_#in~arg.offset_11|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_9|) (= |v_P0Thread1of1ForFork1_#in~arg.base_11| v_P0Thread1of1ForFork1_~arg.base_11) (= v_~x~0_36 v_~__unbuffered_p0_EAX~0_14)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_36} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_14, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_112, ~z~0=v_~z~0_15, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_36, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_11} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 16:03:50,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L763-->L763-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1279386832 256) 0))) (or (and (= ~y~0_In1279386832 |P1Thread1of1ForFork2_#t~ite25_Out1279386832|) .cse0) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite25_Out1279386832| ~y$mem_tmp~0_In1279386832)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1279386832, ~y$flush_delayed~0=~y$flush_delayed~0_In1279386832, ~y~0=~y~0_In1279386832} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1279386832, ~y$flush_delayed~0=~y$flush_delayed~0_In1279386832, ~y~0=~y~0_In1279386832, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out1279386832|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 16:03:50,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In431376429 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In431376429 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite51_Out431376429| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In431376429 |P2Thread1of1ForFork0_#t~ite51_Out431376429|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In431376429, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In431376429} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In431376429, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In431376429, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out431376429|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-27 16:03:50,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [949] [949] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In1953953174 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1953953174 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1953953174 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In1953953174 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite52_Out1953953174| ~y$w_buff1_used~0_In1953953174)) (and (= |P2Thread1of1ForFork0_#t~ite52_Out1953953174| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1953953174, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1953953174, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1953953174, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1953953174} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1953953174, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1953953174, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1953953174, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out1953953174|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1953953174} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-27 16:03:50,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L810-->L811: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In246765690 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In246765690 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In246765690 ~y$r_buff0_thd3~0_Out246765690)) (and (= 0 ~y$r_buff0_thd3~0_Out246765690) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In246765690, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In246765690} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In246765690, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out246765690, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out246765690|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-27 16:03:50,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L811-->L811-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In1609955967 256))) (.cse3 (= (mod ~y$r_buff0_thd3~0_In1609955967 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In1609955967 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1609955967 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In1609955967 |P2Thread1of1ForFork0_#t~ite54_Out1609955967|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite54_Out1609955967|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1609955967, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1609955967, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1609955967, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1609955967} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1609955967, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1609955967, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out1609955967|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1609955967, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1609955967} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-27 16:03:50,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_145 (+ v_~__unbuffered_cnt~0_146 1)) (= v_~y$r_buff1_thd3~0_213 |v_P2Thread1of1ForFork0_#t~ite54_40|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_146} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_213, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_39|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_145, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 16:03:50,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L763-2-->P1EXIT: Formula: (and (= v_~y~0_235 |v_P1Thread1of1ForFork2_#t~ite25_104|) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= v_~__unbuffered_cnt~0_127 (+ v_~__unbuffered_cnt~0_128 1)) (= v_~y$flush_delayed~0_185 0) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_104|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_185, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ~y~0=v_~y~0_235, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_103|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 16:03:50,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [920] [920] L838-->L840-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (or (= 0 (mod v_~y$r_buff0_thd0~0_51 256)) (= 0 (mod v_~y$w_buff0_used~0_302 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_302, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_302, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 16:03:50,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L840-2-->L840-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite59_Out-534427739| |ULTIMATE.start_main_#t~ite58_Out-534427739|)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-534427739 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-534427739 256) 0))) (or (and .cse0 (= ~y~0_In-534427739 |ULTIMATE.start_main_#t~ite58_Out-534427739|) (or .cse1 .cse2)) (and .cse0 (not .cse1) (not .cse2) (= ~y$w_buff1~0_In-534427739 |ULTIMATE.start_main_#t~ite58_Out-534427739|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-534427739, ~y~0=~y~0_In-534427739, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-534427739, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-534427739} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-534427739, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-534427739|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-534427739|, ~y~0=~y~0_In-534427739, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-534427739, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-534427739} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-27 16:03:50,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L841-->L841-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In407110883 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In407110883 256)))) (or (and (= ~y$w_buff0_used~0_In407110883 |ULTIMATE.start_main_#t~ite60_Out407110883|) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite60_Out407110883| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In407110883, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In407110883} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out407110883|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In407110883, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In407110883} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-27 16:03:50,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [967] [967] L842-->L842-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In358985575 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In358985575 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In358985575 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In358985575 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In358985575 |ULTIMATE.start_main_#t~ite61_Out358985575|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite61_Out358985575|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In358985575, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In358985575, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In358985575, ~y$w_buff1_used~0=~y$w_buff1_used~0_In358985575} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out358985575|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In358985575, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In358985575, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In358985575, ~y$w_buff1_used~0=~y$w_buff1_used~0_In358985575} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-27 16:03:50,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L843-->L843-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1086299318 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1086299318 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite62_Out-1086299318| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite62_Out-1086299318| ~y$r_buff0_thd0~0_In-1086299318)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1086299318, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1086299318} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1086299318|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1086299318, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1086299318} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-27 16:03:50,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L844-->L844-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In66150826 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In66150826 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In66150826 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In66150826 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite63_Out66150826|)) (and (= |ULTIMATE.start_main_#t~ite63_Out66150826| ~y$r_buff1_thd0~0_In66150826) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In66150826, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In66150826, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In66150826, ~y$w_buff1_used~0=~y$w_buff1_used~0_In66150826} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out66150826|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In66150826, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In66150826, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In66150826, ~y$w_buff1_used~0=~y$w_buff1_used~0_In66150826} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-27 16:03:50,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_17 0) (= 0 v_~__unbuffered_p1_EAX~0_24) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= 0 v_~__unbuffered_p0_EAX~0_30) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= 1 v_~__unbuffered_p2_EAX~0_33) (= v_~__unbuffered_p2_EBX~0_22 0) (= v_~y$r_buff1_thd0~0_237 |v_ULTIMATE.start_main_#t~ite63_37|)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_37|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_36|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_237, 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, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 16:03:50,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:03:50 BasicIcfg [2019-12-27 16:03:50,182 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:03:50,184 INFO L168 Benchmark]: Toolchain (without parser) took 89705.67 ms. Allocated memory was 144.7 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 101.1 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-27 16:03:50,185 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 16:03:50,186 INFO L168 Benchmark]: CACSL2BoogieTranslator took 762.73 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 100.7 MB in the beginning and 152.6 MB in the end (delta: -51.9 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. [2019-12-27 16:03:50,187 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.23 ms. Allocated memory is still 201.9 MB. Free memory was 152.6 MB in the beginning and 149.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 16:03:50,189 INFO L168 Benchmark]: Boogie Preprocessor took 42.62 ms. Allocated memory is still 201.9 MB. Free memory was 149.8 MB in the beginning and 147.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 16:03:50,190 INFO L168 Benchmark]: RCFGBuilder took 1155.18 ms. Allocated memory is still 201.9 MB. Free memory was 147.1 MB in the beginning and 92.0 MB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 7.1 GB. [2019-12-27 16:03:50,190 INFO L168 Benchmark]: TraceAbstraction took 87667.46 ms. Allocated memory was 201.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 91.3 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-27 16:03:50,200 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.19 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 762.73 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 100.7 MB in the beginning and 152.6 MB in the end (delta: -51.9 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.23 ms. Allocated memory is still 201.9 MB. Free memory was 152.6 MB in the beginning and 149.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.62 ms. Allocated memory is still 201.9 MB. Free memory was 149.8 MB in the beginning and 147.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1155.18 ms. Allocated memory is still 201.9 MB. Free memory was 147.1 MB in the beginning and 92.0 MB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 87667.46 ms. Allocated memory was 201.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 91.3 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.6s, 195 ProgramPointsBefore, 111 ProgramPointsAfterwards, 241 TransitionsBefore, 134 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 53 ConcurrentYvCompositions, 27 ChoiceCompositions, 9672 VarBasedMoverChecksPositive, 313 VarBasedMoverChecksNegative, 87 SemBasedMoverChecksPositive, 317 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.4s, 0 MoverChecksTotal, 147047 CheckedPairsTotal, 124 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t418, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L832] FCALL, FORK 0 pthread_create(&t419, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t420, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 [L788] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L789] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L790] 3 y$flush_delayed = weak$$choice2 [L791] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L793] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L793] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L794] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L794] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L795] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L796] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L800] 3 y = y$flush_delayed ? y$mem_tmp : y [L801] 3 y$flush_delayed = (_Bool)0 [L804] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L748] 2 x = 1 [L751] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 2 y$flush_delayed = weak$$choice2 [L754] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L756] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L757] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L758] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L760] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L761] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L808] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L809] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L840] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L841] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L842] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L843] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 186 locations, 2 error locations. Result: UNSAFE, OverallTime: 87.3s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 32.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4094 SDtfs, 6592 SDslu, 9135 SDs, 0 SdLazy, 5149 SolverSat, 474 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 239 GetRequests, 73 SyntacticMatches, 7 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121726occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 39.9s AutomataMinimizationTime, 19 MinimizatonAttempts, 288103 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 790 NumberOfCodeBlocks, 790 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 708 ConstructedInterpolants, 0 QuantifiedInterpolants, 102790 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...