/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix032_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:08:42,204 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:08:42,206 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:08:42,218 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:08:42,218 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:08:42,219 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:08:42,220 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:08:42,222 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:08:42,224 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:08:42,225 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:08:42,226 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:08:42,227 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:08:42,227 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:08:42,228 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:08:42,229 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:08:42,230 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:08:42,231 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:08:42,232 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:08:42,234 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:08:42,236 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:08:42,237 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:08:42,238 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:08:42,239 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:08:42,240 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:08:42,242 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:08:42,242 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:08:42,243 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:08:42,243 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:08:42,244 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:08:42,245 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:08:42,245 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:08:42,246 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:08:42,247 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:08:42,247 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:08:42,248 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:08:42,249 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:08:42,249 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:08:42,250 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:08:42,250 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:08:42,251 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:08:42,251 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:08:42,252 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:08:42,269 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:08:42,269 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:08:42,271 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:08:42,271 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:08:42,271 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:08:42,272 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:08:42,272 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:08:42,273 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:08:42,273 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:08:42,273 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:08:42,274 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:08:42,274 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:08:42,274 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:08:42,275 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:08:42,275 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:08:42,275 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:08:42,275 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:08:42,275 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:08:42,276 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:08:42,276 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:08:42,276 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:08:42,276 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:08:42,277 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:08:42,277 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:08:42,277 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:08:42,277 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:08:42,277 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:08:42,278 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:08:42,278 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:08:42,278 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:08:42,571 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:08:42,584 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:08:42,587 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:08:42,589 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:08:42,589 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:08:42,590 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032_power.opt.i [2019-12-18 21:08:42,665 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3207c4a2/72287a4642e44f2893674cc4a8ea7084/FLAG43f4c0ce9 [2019-12-18 21:08:43,269 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:08:43,270 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032_power.opt.i [2019-12-18 21:08:43,293 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3207c4a2/72287a4642e44f2893674cc4a8ea7084/FLAG43f4c0ce9 [2019-12-18 21:08:43,592 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3207c4a2/72287a4642e44f2893674cc4a8ea7084 [2019-12-18 21:08:43,601 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:08:43,603 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:08:43,604 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:08:43,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:08:43,608 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:08:43,609 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:08:43" (1/1) ... [2019-12-18 21:08:43,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cae7156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:08:43, skipping insertion in model container [2019-12-18 21:08:43,612 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:08:43" (1/1) ... [2019-12-18 21:08:43,620 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:08:43,669 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:08:44,186 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:08:44,198 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:08:44,271 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:08:44,345 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:08:44,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:08:44 WrapperNode [2019-12-18 21:08:44,346 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:08:44,346 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:08:44,347 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:08:44,347 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:08:44,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:08:44" (1/1) ... [2019-12-18 21:08:44,376 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:08:44" (1/1) ... [2019-12-18 21:08:44,432 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:08:44,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:08:44,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:08:44,432 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:08:44,442 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:08:44" (1/1) ... [2019-12-18 21:08:44,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:08:44" (1/1) ... [2019-12-18 21:08:44,446 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:08:44" (1/1) ... [2019-12-18 21:08:44,447 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:08:44" (1/1) ... [2019-12-18 21:08:44,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:08:44" (1/1) ... [2019-12-18 21:08:44,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:08:44" (1/1) ... [2019-12-18 21:08:44,464 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:08:44" (1/1) ... [2019-12-18 21:08:44,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:08:44,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:08:44,471 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:08:44,471 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:08:44,472 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:08:44" (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-18 21:08:44,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:08:44,550 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:08:44,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:08:44,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:08:44,550 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:08:44,550 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:08:44,550 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:08:44,550 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:08:44,551 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:08:44,551 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:08:44,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:08:44,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:08:44,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:08:44,553 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:08:45,246 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:08:45,247 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:08:45,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:08:45 BoogieIcfgContainer [2019-12-18 21:08:45,249 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:08:45,251 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:08:45,251 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:08:45,256 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:08:45,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:08:43" (1/3) ... [2019-12-18 21:08:45,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65081c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:08:45, skipping insertion in model container [2019-12-18 21:08:45,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:08:44" (2/3) ... [2019-12-18 21:08:45,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65081c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:08:45, skipping insertion in model container [2019-12-18 21:08:45,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:08:45" (3/3) ... [2019-12-18 21:08:45,262 INFO L109 eAbstractionObserver]: Analyzing ICFG mix032_power.opt.i [2019-12-18 21:08:45,274 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:08:45,274 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:08:45,289 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:08:45,290 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:08:45,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,345 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,345 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,348 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,348 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,371 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,371 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,372 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,372 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,372 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,383 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,384 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,385 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,389 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,389 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,394 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,411 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:08:45,427 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 21:08:45,444 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:08:45,445 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:08:45,445 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:08:45,445 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:08:45,445 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:08:45,445 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:08:45,445 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:08:45,446 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:08:45,462 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 181 transitions [2019-12-18 21:08:45,464 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 156 places, 181 transitions [2019-12-18 21:08:45,560 INFO L126 PetriNetUnfolder]: 35/178 cut-off events. [2019-12-18 21:08:45,560 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:08:45,574 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 178 events. 35/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 9/150 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-18 21:08:45,596 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 156 places, 181 transitions [2019-12-18 21:08:45,661 INFO L126 PetriNetUnfolder]: 35/178 cut-off events. [2019-12-18 21:08:45,661 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:08:45,669 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 178 events. 35/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 9/150 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-18 21:08:45,688 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-18 21:08:45,689 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:08:48,805 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 21:08:48,926 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 21:08:49,235 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-18 21:08:49,387 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-18 21:08:49,413 INFO L206 etLargeBlockEncoding]: Checked pairs total: 51271 [2019-12-18 21:08:49,413 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-18 21:08:49,417 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 85 transitions [2019-12-18 21:08:50,318 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14534 states. [2019-12-18 21:08:50,320 INFO L276 IsEmpty]: Start isEmpty. Operand 14534 states. [2019-12-18 21:08:50,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 21:08:50,326 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:08:50,327 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:08:50,327 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-18 21:08:50,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:08:50,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1671700896, now seen corresponding path program 1 times [2019-12-18 21:08:50,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:08:50,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658567293] [2019-12-18 21:08:50,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:08:50,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:08:50,624 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-18 21:08:50,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658567293] [2019-12-18 21:08:50,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:08:50,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:08:50,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224142084] [2019-12-18 21:08:50,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:08:50,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:08:50,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:08:50,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:08:50,643 INFO L87 Difference]: Start difference. First operand 14534 states. Second operand 3 states. [2019-12-18 21:08:50,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:08:50,974 INFO L93 Difference]: Finished difference Result 14182 states and 55174 transitions. [2019-12-18 21:08:50,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:08:50,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 21:08:50,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:08:51,118 INFO L225 Difference]: With dead ends: 14182 [2019-12-18 21:08:51,118 INFO L226 Difference]: Without dead ends: 13350 [2019-12-18 21:08:51,120 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-18 21:08:51,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13350 states. [2019-12-18 21:08:51,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13350 to 13350. [2019-12-18 21:08:51,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13350 states. [2019-12-18 21:08:51,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13350 states to 13350 states and 51860 transitions. [2019-12-18 21:08:51,826 INFO L78 Accepts]: Start accepts. Automaton has 13350 states and 51860 transitions. Word has length 7 [2019-12-18 21:08:51,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:08:51,827 INFO L462 AbstractCegarLoop]: Abstraction has 13350 states and 51860 transitions. [2019-12-18 21:08:51,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:08:51,828 INFO L276 IsEmpty]: Start isEmpty. Operand 13350 states and 51860 transitions. [2019-12-18 21:08:51,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:08:51,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:08:51,834 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:08:51,834 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-18 21:08:51,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:08:51,835 INFO L82 PathProgramCache]: Analyzing trace with hash -76146322, now seen corresponding path program 1 times [2019-12-18 21:08:51,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:08:51,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906329774] [2019-12-18 21:08:51,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:08:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:08:51,926 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-18 21:08:51,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906329774] [2019-12-18 21:08:51,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:08:51,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:08:51,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732201944] [2019-12-18 21:08:51,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:08:51,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:08:51,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:08:51,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:08:51,931 INFO L87 Difference]: Start difference. First operand 13350 states and 51860 transitions. Second operand 3 states. [2019-12-18 21:08:52,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:08:52,012 INFO L93 Difference]: Finished difference Result 7974 states and 27125 transitions. [2019-12-18 21:08:52,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:08:52,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 21:08:52,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:08:52,044 INFO L225 Difference]: With dead ends: 7974 [2019-12-18 21:08:52,045 INFO L226 Difference]: Without dead ends: 7974 [2019-12-18 21:08:52,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:08:52,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7974 states. [2019-12-18 21:08:53,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7974 to 7974. [2019-12-18 21:08:53,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7974 states. [2019-12-18 21:08:53,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7974 states to 7974 states and 27125 transitions. [2019-12-18 21:08:53,081 INFO L78 Accepts]: Start accepts. Automaton has 7974 states and 27125 transitions. Word has length 13 [2019-12-18 21:08:53,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:08:53,081 INFO L462 AbstractCegarLoop]: Abstraction has 7974 states and 27125 transitions. [2019-12-18 21:08:53,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:08:53,081 INFO L276 IsEmpty]: Start isEmpty. Operand 7974 states and 27125 transitions. [2019-12-18 21:08:53,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:08:53,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:08:53,084 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:08:53,084 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-18 21:08:53,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:08:53,085 INFO L82 PathProgramCache]: Analyzing trace with hash 383510487, now seen corresponding path program 1 times [2019-12-18 21:08:53,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:08:53,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813680222] [2019-12-18 21:08:53,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:08:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:08:53,143 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-18 21:08:53,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813680222] [2019-12-18 21:08:53,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:08:53,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:08:53,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269813039] [2019-12-18 21:08:53,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:08:53,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:08:53,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:08:53,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:08:53,145 INFO L87 Difference]: Start difference. First operand 7974 states and 27125 transitions. Second operand 4 states. [2019-12-18 21:08:53,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:08:53,193 INFO L93 Difference]: Finished difference Result 1840 states and 5044 transitions. [2019-12-18 21:08:53,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:08:53,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 21:08:53,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:08:53,200 INFO L225 Difference]: With dead ends: 1840 [2019-12-18 21:08:53,200 INFO L226 Difference]: Without dead ends: 1840 [2019-12-18 21:08:53,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:08:53,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2019-12-18 21:08:53,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1840. [2019-12-18 21:08:53,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1840 states. [2019-12-18 21:08:53,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 5044 transitions. [2019-12-18 21:08:53,243 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 5044 transitions. Word has length 14 [2019-12-18 21:08:53,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:08:53,244 INFO L462 AbstractCegarLoop]: Abstraction has 1840 states and 5044 transitions. [2019-12-18 21:08:53,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:08:53,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 5044 transitions. [2019-12-18 21:08:53,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:08:53,245 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:08:53,245 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:08:53,246 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-18 21:08:53,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:08:53,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1452926097, now seen corresponding path program 1 times [2019-12-18 21:08:53,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:08:53,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552095958] [2019-12-18 21:08:53,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:08:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:08:53,294 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-18 21:08:53,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552095958] [2019-12-18 21:08:53,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:08:53,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:08:53,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412383778] [2019-12-18 21:08:53,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:08:53,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:08:53,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:08:53,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:08:53,296 INFO L87 Difference]: Start difference. First operand 1840 states and 5044 transitions. Second operand 3 states. [2019-12-18 21:08:53,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:08:53,370 INFO L93 Difference]: Finished difference Result 2653 states and 7081 transitions. [2019-12-18 21:08:53,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:08:53,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 21:08:53,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:08:53,378 INFO L225 Difference]: With dead ends: 2653 [2019-12-18 21:08:53,379 INFO L226 Difference]: Without dead ends: 2653 [2019-12-18 21:08:53,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:08:53,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2653 states. [2019-12-18 21:08:53,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2653 to 2071. [2019-12-18 21:08:53,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2019-12-18 21:08:53,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 5594 transitions. [2019-12-18 21:08:53,439 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 5594 transitions. Word has length 16 [2019-12-18 21:08:53,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:08:53,439 INFO L462 AbstractCegarLoop]: Abstraction has 2071 states and 5594 transitions. [2019-12-18 21:08:53,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:08:53,440 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 5594 transitions. [2019-12-18 21:08:53,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:08:53,442 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:08:53,442 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:08:53,442 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-18 21:08:53,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:08:53,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1583082976, now seen corresponding path program 1 times [2019-12-18 21:08:53,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:08:53,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599073233] [2019-12-18 21:08:53,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:08:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:08:53,506 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-18 21:08:53,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599073233] [2019-12-18 21:08:53,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:08:53,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:08:53,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470435230] [2019-12-18 21:08:53,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:08:53,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:08:53,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:08:53,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:08:53,508 INFO L87 Difference]: Start difference. First operand 2071 states and 5594 transitions. Second operand 4 states. [2019-12-18 21:08:53,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:08:53,655 INFO L93 Difference]: Finished difference Result 2647 states and 6980 transitions. [2019-12-18 21:08:53,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:08:53,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 21:08:53,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:08:53,664 INFO L225 Difference]: With dead ends: 2647 [2019-12-18 21:08:53,664 INFO L226 Difference]: Without dead ends: 2647 [2019-12-18 21:08:53,664 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-18 21:08:53,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2647 states. [2019-12-18 21:08:53,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2647 to 2439. [2019-12-18 21:08:53,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2439 states. [2019-12-18 21:08:53,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2439 states to 2439 states and 6530 transitions. [2019-12-18 21:08:53,728 INFO L78 Accepts]: Start accepts. Automaton has 2439 states and 6530 transitions. Word has length 16 [2019-12-18 21:08:53,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:08:53,729 INFO L462 AbstractCegarLoop]: Abstraction has 2439 states and 6530 transitions. [2019-12-18 21:08:53,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:08:53,729 INFO L276 IsEmpty]: Start isEmpty. Operand 2439 states and 6530 transitions. [2019-12-18 21:08:53,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:08:53,731 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:08:53,732 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:08:53,732 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-18 21:08:53,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:08:53,732 INFO L82 PathProgramCache]: Analyzing trace with hash 427470360, now seen corresponding path program 1 times [2019-12-18 21:08:53,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:08:53,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571406235] [2019-12-18 21:08:53,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:08:53,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:08:53,783 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-18 21:08:53,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571406235] [2019-12-18 21:08:53,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:08:53,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:08:53,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802754961] [2019-12-18 21:08:53,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:08:53,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:08:53,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:08:53,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:08:53,871 INFO L87 Difference]: Start difference. First operand 2439 states and 6530 transitions. Second operand 4 states. [2019-12-18 21:08:54,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:08:54,029 INFO L93 Difference]: Finished difference Result 3088 states and 8135 transitions. [2019-12-18 21:08:54,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:08:54,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 21:08:54,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:08:54,040 INFO L225 Difference]: With dead ends: 3088 [2019-12-18 21:08:54,040 INFO L226 Difference]: Without dead ends: 3088 [2019-12-18 21:08:54,041 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-18 21:08:54,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3088 states. [2019-12-18 21:08:54,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3088 to 2576. [2019-12-18 21:08:54,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2576 states. [2019-12-18 21:08:54,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2576 states to 2576 states and 6902 transitions. [2019-12-18 21:08:54,106 INFO L78 Accepts]: Start accepts. Automaton has 2576 states and 6902 transitions. Word has length 16 [2019-12-18 21:08:54,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:08:54,107 INFO L462 AbstractCegarLoop]: Abstraction has 2576 states and 6902 transitions. [2019-12-18 21:08:54,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:08:54,107 INFO L276 IsEmpty]: Start isEmpty. Operand 2576 states and 6902 transitions. [2019-12-18 21:08:54,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 21:08:54,112 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:08:54,113 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:08:54,113 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-18 21:08:54,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:08:54,113 INFO L82 PathProgramCache]: Analyzing trace with hash 879756343, now seen corresponding path program 1 times [2019-12-18 21:08:54,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:08:54,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715459839] [2019-12-18 21:08:54,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:08:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:08:54,174 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-18 21:08:54,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715459839] [2019-12-18 21:08:54,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:08:54,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:08:54,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361545562] [2019-12-18 21:08:54,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:08:54,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:08:54,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:08:54,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:08:54,178 INFO L87 Difference]: Start difference. First operand 2576 states and 6902 transitions. Second operand 5 states. [2019-12-18 21:08:54,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:08:54,212 INFO L93 Difference]: Finished difference Result 1612 states and 4421 transitions. [2019-12-18 21:08:54,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:08:54,212 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-18 21:08:54,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:08:54,217 INFO L225 Difference]: With dead ends: 1612 [2019-12-18 21:08:54,217 INFO L226 Difference]: Without dead ends: 1612 [2019-12-18 21:08:54,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:08:54,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states. [2019-12-18 21:08:54,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 1512. [2019-12-18 21:08:54,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1512 states. [2019-12-18 21:08:54,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 4171 transitions. [2019-12-18 21:08:54,259 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 4171 transitions. Word has length 29 [2019-12-18 21:08:54,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:08:54,260 INFO L462 AbstractCegarLoop]: Abstraction has 1512 states and 4171 transitions. [2019-12-18 21:08:54,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:08:54,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 4171 transitions. [2019-12-18 21:08:54,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 21:08:54,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:08:54,265 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] [2019-12-18 21:08:54,265 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-18 21:08:54,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:08:54,266 INFO L82 PathProgramCache]: Analyzing trace with hash 266150348, now seen corresponding path program 1 times [2019-12-18 21:08:54,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:08:54,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454421628] [2019-12-18 21:08:54,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:08:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:08:54,367 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-18 21:08:54,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454421628] [2019-12-18 21:08:54,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:08:54,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:08:54,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471243048] [2019-12-18 21:08:54,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:08:54,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:08:54,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:08:54,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:08:54,370 INFO L87 Difference]: Start difference. First operand 1512 states and 4171 transitions. Second operand 4 states. [2019-12-18 21:08:54,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:08:54,399 INFO L93 Difference]: Finished difference Result 2136 states and 5587 transitions. [2019-12-18 21:08:54,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:08:54,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-12-18 21:08:54,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:08:54,406 INFO L225 Difference]: With dead ends: 2136 [2019-12-18 21:08:54,407 INFO L226 Difference]: Without dead ends: 1369 [2019-12-18 21:08:54,407 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-18 21:08:54,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2019-12-18 21:08:54,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1369. [2019-12-18 21:08:54,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1369 states. [2019-12-18 21:08:54,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 3710 transitions. [2019-12-18 21:08:54,434 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 3710 transitions. Word has length 44 [2019-12-18 21:08:54,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:08:54,436 INFO L462 AbstractCegarLoop]: Abstraction has 1369 states and 3710 transitions. [2019-12-18 21:08:54,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:08:54,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 3710 transitions. [2019-12-18 21:08:54,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 21:08:54,441 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:08:54,441 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] [2019-12-18 21:08:54,442 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-18 21:08:54,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:08:54,442 INFO L82 PathProgramCache]: Analyzing trace with hash 790276266, now seen corresponding path program 2 times [2019-12-18 21:08:54,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:08:54,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961336449] [2019-12-18 21:08:54,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:08:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:08:54,562 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-18 21:08:54,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961336449] [2019-12-18 21:08:54,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:08:54,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:08:54,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122806832] [2019-12-18 21:08:54,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:08:54,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:08:54,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:08:54,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:08:54,565 INFO L87 Difference]: Start difference. First operand 1369 states and 3710 transitions. Second operand 4 states. [2019-12-18 21:08:54,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:08:54,587 INFO L93 Difference]: Finished difference Result 1825 states and 4768 transitions. [2019-12-18 21:08:54,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:08:54,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-12-18 21:08:54,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:08:54,590 INFO L225 Difference]: With dead ends: 1825 [2019-12-18 21:08:54,590 INFO L226 Difference]: Without dead ends: 490 [2019-12-18 21:08:54,591 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-18 21:08:54,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-12-18 21:08:54,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2019-12-18 21:08:54,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-12-18 21:08:54,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1117 transitions. [2019-12-18 21:08:54,599 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 1117 transitions. Word has length 44 [2019-12-18 21:08:54,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:08:54,600 INFO L462 AbstractCegarLoop]: Abstraction has 490 states and 1117 transitions. [2019-12-18 21:08:54,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:08:54,600 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1117 transitions. [2019-12-18 21:08:54,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 21:08:54,601 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:08:54,601 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] [2019-12-18 21:08:54,602 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-18 21:08:54,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:08:54,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1816574034, now seen corresponding path program 3 times [2019-12-18 21:08:54,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:08:54,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888308041] [2019-12-18 21:08:54,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:08:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:08:54,712 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-18 21:08:54,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888308041] [2019-12-18 21:08:54,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:08:54,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:08:54,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988697510] [2019-12-18 21:08:54,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:08:54,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:08:54,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:08:54,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:08:54,717 INFO L87 Difference]: Start difference. First operand 490 states and 1117 transitions. Second operand 7 states. [2019-12-18 21:08:54,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:08:54,893 INFO L93 Difference]: Finished difference Result 894 states and 1986 transitions. [2019-12-18 21:08:54,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:08:54,894 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2019-12-18 21:08:54,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:08:54,895 INFO L225 Difference]: With dead ends: 894 [2019-12-18 21:08:54,895 INFO L226 Difference]: Without dead ends: 606 [2019-12-18 21:08:54,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:08:54,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-12-18 21:08:54,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 538. [2019-12-18 21:08:54,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-12-18 21:08:54,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 1192 transitions. [2019-12-18 21:08:54,906 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 1192 transitions. Word has length 44 [2019-12-18 21:08:54,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:08:54,906 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 1192 transitions. [2019-12-18 21:08:54,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:08:54,906 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 1192 transitions. [2019-12-18 21:08:54,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 21:08:54,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:08:54,909 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] [2019-12-18 21:08:54,909 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-18 21:08:54,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:08:54,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1698775532, now seen corresponding path program 4 times [2019-12-18 21:08:54,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:08:54,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744338715] [2019-12-18 21:08:54,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:08:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:08:55,013 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-18 21:08:55,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744338715] [2019-12-18 21:08:55,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:08:55,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:08:55,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722593777] [2019-12-18 21:08:55,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:08:55,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:08:55,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:08:55,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:08:55,017 INFO L87 Difference]: Start difference. First operand 538 states and 1192 transitions. Second operand 6 states. [2019-12-18 21:08:55,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:08:55,490 INFO L93 Difference]: Finished difference Result 870 states and 1883 transitions. [2019-12-18 21:08:55,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:08:55,490 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-12-18 21:08:55,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:08:55,493 INFO L225 Difference]: With dead ends: 870 [2019-12-18 21:08:55,493 INFO L226 Difference]: Without dead ends: 852 [2019-12-18 21:08:55,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:08:55,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2019-12-18 21:08:55,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 808. [2019-12-18 21:08:55,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2019-12-18 21:08:55,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1766 transitions. [2019-12-18 21:08:55,505 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1766 transitions. Word has length 44 [2019-12-18 21:08:55,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:08:55,506 INFO L462 AbstractCegarLoop]: Abstraction has 808 states and 1766 transitions. [2019-12-18 21:08:55,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:08:55,506 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1766 transitions. [2019-12-18 21:08:55,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 21:08:55,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:08:55,508 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] [2019-12-18 21:08:55,508 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-18 21:08:55,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:08:55,509 INFO L82 PathProgramCache]: Analyzing trace with hash -2098685651, now seen corresponding path program 1 times [2019-12-18 21:08:55,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:08:55,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784423464] [2019-12-18 21:08:55,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:08:55,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:08:55,553 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-18 21:08:55,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784423464] [2019-12-18 21:08:55,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:08:55,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:08:55,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867450087] [2019-12-18 21:08:55,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:08:55,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:08:55,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:08:55,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:08:55,555 INFO L87 Difference]: Start difference. First operand 808 states and 1766 transitions. Second operand 3 states. [2019-12-18 21:08:55,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:08:55,589 INFO L93 Difference]: Finished difference Result 920 states and 1868 transitions. [2019-12-18 21:08:55,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:08:55,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-18 21:08:55,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:08:55,591 INFO L225 Difference]: With dead ends: 920 [2019-12-18 21:08:55,592 INFO L226 Difference]: Without dead ends: 920 [2019-12-18 21:08:55,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:08:55,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2019-12-18 21:08:55,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 808. [2019-12-18 21:08:55,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2019-12-18 21:08:55,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1658 transitions. [2019-12-18 21:08:55,606 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1658 transitions. Word has length 44 [2019-12-18 21:08:55,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:08:55,607 INFO L462 AbstractCegarLoop]: Abstraction has 808 states and 1658 transitions. [2019-12-18 21:08:55,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:08:55,607 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1658 transitions. [2019-12-18 21:08:55,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 21:08:55,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:08:55,609 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] [2019-12-18 21:08:55,609 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-18 21:08:55,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:08:55,610 INFO L82 PathProgramCache]: Analyzing trace with hash 476211020, now seen corresponding path program 5 times [2019-12-18 21:08:55,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:08:55,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261115785] [2019-12-18 21:08:55,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:08:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:08:55,671 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-18 21:08:55,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261115785] [2019-12-18 21:08:55,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:08:55,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:08:55,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062348153] [2019-12-18 21:08:55,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:08:55,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:08:55,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:08:55,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:08:55,673 INFO L87 Difference]: Start difference. First operand 808 states and 1658 transitions. Second operand 3 states. [2019-12-18 21:08:55,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:08:55,685 INFO L93 Difference]: Finished difference Result 806 states and 1653 transitions. [2019-12-18 21:08:55,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:08:55,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-18 21:08:55,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:08:55,687 INFO L225 Difference]: With dead ends: 806 [2019-12-18 21:08:55,687 INFO L226 Difference]: Without dead ends: 806 [2019-12-18 21:08:55,688 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-18 21:08:55,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2019-12-18 21:08:55,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 665. [2019-12-18 21:08:55,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2019-12-18 21:08:55,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 1386 transitions. [2019-12-18 21:08:55,698 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 1386 transitions. Word has length 44 [2019-12-18 21:08:55,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:08:55,699 INFO L462 AbstractCegarLoop]: Abstraction has 665 states and 1386 transitions. [2019-12-18 21:08:55,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:08:55,699 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 1386 transitions. [2019-12-18 21:08:55,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-18 21:08:55,701 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:08:55,701 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] [2019-12-18 21:08:55,701 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-18 21:08:55,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:08:55,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1501880967, now seen corresponding path program 1 times [2019-12-18 21:08:55,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:08:55,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845957286] [2019-12-18 21:08:55,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:08:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:08:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:08:55,810 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:08:55,813 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:08:55,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= v_~main$tmp_guard1~0_18 0) (= v_~__unbuffered_p1_EBX~0_17 0) (= v_~z$r_buff0_thd0~0_20 0) (= 0 v_~a~0_8) (= 0 v_~z$r_buff1_thd0~0_20) (= 0 v_~__unbuffered_p0_EAX~0_15) (= |v_#NULL.offset_3| 0) (= |v_#valid_60| (store .cse0 |v_ULTIMATE.start_main_~#t852~0.base_24| 1)) (= v_~z$read_delayed~0_8 0) (= 0 v_~__unbuffered_cnt~0_21) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t852~0.base_24|)) (= 0 v_~z$w_buff1~0_21) (= v_~__unbuffered_p2_EBX~0_16 0) (= v_~z$read_delayed_var~0.base_8 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~__unbuffered_p2_EAX~0_16) (= 0 v_~z$r_buff1_thd2~0_38) (= 0 v_~z$flush_delayed~0_14) (= v_~z~0_23 0) (= 0 |v_ULTIMATE.start_main_~#t852~0.offset_19|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~weak$$choice0~0_7) (= v_~z$r_buff1_thd1~0_9 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t852~0.base_24|) (= v_~z$r_buff0_thd1~0_9 0) (= v_~z$mem_tmp~0_10 0) (= 0 v_~z$r_buff1_thd3~0_16) (= v_~z$w_buff0_used~0_95 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t852~0.base_24| 4) |v_#length_25|) (= v_~z$r_buff0_thd3~0_25 0) (= 0 v_~z$w_buff1_used~0_53) (= 0 |v_#NULL.base_3|) (= 0 v_~z$w_buff0~0_28) (= v_~z$r_buff0_thd2~0_66 0) (= v_~x~0_12 0) (= v_~main$tmp_guard0~0_11 0) (= v_~b~0_12 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t852~0.base_24| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t852~0.base_24|) |v_ULTIMATE.start_main_~#t852~0.offset_19| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_p1_EAX~0_16) (= v_~z$read_delayed_var~0.offset_8 0) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_18|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_~#t852~0.base=|v_ULTIMATE.start_main_~#t852~0.base_24|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_38, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_~#t852~0.offset=|v_ULTIMATE.start_main_~#t852~0.offset_19|, ~a~0=v_~a~0_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ULTIMATE.start_main_~#t854~0.base=|v_ULTIMATE.start_main_~#t854~0.base_21|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_53, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_11|, ~z$flush_delayed~0=v_~z$flush_delayed~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_~#t853~0.base=|v_ULTIMATE.start_main_~#t853~0.base_23|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_9, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_25, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_12, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t854~0.offset=|v_ULTIMATE.start_main_~#t854~0.offset_17|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_20, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_66, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_95, ~z$w_buff0~0=v_~z$w_buff0~0_28, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_16, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_11|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_3|, ~b~0=v_~b~0_12, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_23, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_9, ULTIMATE.start_main_~#t853~0.offset=|v_ULTIMATE.start_main_~#t853~0.offset_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t852~0.base, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t852~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t854~0.base, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t853~0.base, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet33, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t854~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t853~0.offset] because there is no mapped edge [2019-12-18 21:08:55,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L832-1-->L834: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t853~0.base_10|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t853~0.base_10| 4)) (= |v_ULTIMATE.start_main_~#t853~0.offset_9| 0) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t853~0.base_10|) 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t853~0.base_10|) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t853~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t853~0.base_10|) |v_ULTIMATE.start_main_~#t853~0.offset_9| 1)) |v_#memory_int_7|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t853~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t853~0.base=|v_ULTIMATE.start_main_~#t853~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_7|, #length=|v_#length_13|, ULTIMATE.start_main_~#t853~0.offset=|v_ULTIMATE.start_main_~#t853~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t853~0.base, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t853~0.offset] because there is no mapped edge [2019-12-18 21:08:55,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L834-1-->L836: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t854~0.base_13| 4) |v_#length_17|) (not (= |v_ULTIMATE.start_main_~#t854~0.base_13| 0)) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t854~0.base_13|)) (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t854~0.base_13| 1) |v_#valid_35|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t854~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t854~0.base_13|) |v_ULTIMATE.start_main_~#t854~0.offset_11| 2))) (= 0 |v_ULTIMATE.start_main_~#t854~0.offset_11|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t854~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_10|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t854~0.offset=|v_ULTIMATE.start_main_~#t854~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t854~0.base=|v_ULTIMATE.start_main_~#t854~0.base_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t854~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t854~0.base, #length] because there is no mapped edge [2019-12-18 21:08:55,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] P2ENTRY-->L4-3: Formula: (and (= 1 ~z$w_buff0_used~0_Out1334268107) (= 1 |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1334268107|) (= P2Thread1of1ForFork0_~arg.offset_Out1334268107 |P2Thread1of1ForFork0_#in~arg.offset_In1334268107|) (= ~z$w_buff1~0_Out1334268107 ~z$w_buff0~0_In1334268107) (= 1 ~z$w_buff0~0_Out1334268107) (= |P2Thread1of1ForFork0_#in~arg.base_In1334268107| P2Thread1of1ForFork0_~arg.base_Out1334268107) (= |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1334268107| P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out1334268107) (= ~z$w_buff1_used~0_Out1334268107 ~z$w_buff0_used~0_In1334268107) (= (mod ~z$w_buff1_used~0_Out1334268107 256) 0)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In1334268107|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1334268107, ~z$w_buff0~0=~z$w_buff0~0_In1334268107, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In1334268107|} OutVars{P2Thread1of1ForFork0_~arg.base=P2Thread1of1ForFork0_~arg.base_Out1334268107, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1334268107|, P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In1334268107|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out1334268107, ~z$w_buff0~0=~z$w_buff0~0_Out1334268107, P2Thread1of1ForFork0_~arg.offset=P2Thread1of1ForFork0_~arg.offset_Out1334268107, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out1334268107, ~z$w_buff1~0=~z$w_buff1~0_Out1334268107, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In1334268107|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out1334268107} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 21:08:55,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 1 v_~b~0_7) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~__unbuffered_p0_EAX~0_7 v_~x~0_6) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_6} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~b~0=v_~b~0_7, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_6, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, ~b~0, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 21:08:55,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In903579670 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In903579670 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_Out903579670| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In903579670 |P2Thread1of1ForFork0_#t~ite28_Out903579670|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In903579670, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In903579670} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out903579670|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In903579670, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In903579670} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 21:08:55,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L811-->L811-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In973373325 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In973373325 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In973373325 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In973373325 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite29_Out973373325|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In973373325 |P2Thread1of1ForFork0_#t~ite29_Out973373325|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In973373325, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In973373325, ~z$w_buff1_used~0=~z$w_buff1_used~0_In973373325, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In973373325} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In973373325, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In973373325, ~z$w_buff1_used~0=~z$w_buff1_used~0_In973373325, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In973373325, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out973373325|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 21:08:55,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [674] [674] L812-->L813: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1335145100 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1335145100 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd3~0_Out1335145100 ~z$r_buff0_thd3~0_In1335145100)) (and (= ~z$r_buff0_thd3~0_Out1335145100 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1335145100, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1335145100} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1335145100, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out1335145100, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out1335145100|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite30] because there is no mapped edge [2019-12-18 21:08:55,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L813-->L813-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1374335690 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-1374335690 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1374335690 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1374335690 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite31_Out-1374335690| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$r_buff1_thd3~0_In-1374335690 |P2Thread1of1ForFork0_#t~ite31_Out-1374335690|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1374335690, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1374335690, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1374335690, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1374335690} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1374335690, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1374335690, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1374335690, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1374335690, P2Thread1of1ForFork0_#t~ite31=|P2Thread1of1ForFork0_#t~ite31_Out-1374335690|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 21:08:55,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L813-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_11 |v_P2Thread1of1ForFork0_#t~ite31_8|) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 21:08:55,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L772-->L773: Formula: (and (= v_~z$r_buff0_thd2~0_58 v_~z$r_buff0_thd2~0_57) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~weak$$choice2~0=v_~weak$$choice2~0_28, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_58} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_10|, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_12|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_9|, ~weak$$choice2~0=v_~weak$$choice2~0_28, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_57} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21, ~z$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 21:08:55,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L775-->L783: Formula: (and (= 0 v_~z$flush_delayed~0_6) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= v_~z~0_13 v_~z$mem_tmp~0_4) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_13, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 21:08:55,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L836-1-->L842: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 21:08:55,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L842-2-->L842-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1714240184 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1714240184 256) 0))) (or (and (= ~z~0_In-1714240184 |ULTIMATE.start_main_#t~ite35_Out-1714240184|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~z$w_buff1~0_In-1714240184 |ULTIMATE.start_main_#t~ite35_Out-1714240184|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1714240184, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1714240184, ~z$w_buff1~0=~z$w_buff1~0_In-1714240184, ~z~0=~z~0_In-1714240184} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1714240184, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1714240184|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1714240184, ~z$w_buff1~0=~z$w_buff1~0_In-1714240184, ~z~0=~z~0_In-1714240184} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-18 21:08:55,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [604] [604] L842-4-->L843: Formula: (= v_~z~0_12 |v_ULTIMATE.start_main_#t~ite35_7|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_6|, ~z~0=v_~z~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~z~0] because there is no mapped edge [2019-12-18 21:08:55,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L843-->L843-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1422478385 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1422478385 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite37_Out-1422478385|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-1422478385 |ULTIMATE.start_main_#t~ite37_Out-1422478385|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1422478385, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1422478385} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1422478385, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1422478385, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1422478385|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 21:08:55,843 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L844-->L844-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In-722996388 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-722996388 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-722996388 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-722996388 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-722996388 |ULTIMATE.start_main_#t~ite38_Out-722996388|)) (and (= 0 |ULTIMATE.start_main_#t~ite38_Out-722996388|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-722996388, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-722996388, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-722996388, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-722996388} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-722996388, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-722996388, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-722996388, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-722996388, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-722996388|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 21:08:55,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L845-->L845-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1768850364 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1768850364 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite39_Out-1768850364| ~z$r_buff0_thd0~0_In-1768850364)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite39_Out-1768850364| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1768850364, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1768850364} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1768850364, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1768850364|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1768850364} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 21:08:55,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L846-->L846-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In507339950 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In507339950 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In507339950 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In507339950 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite40_Out507339950|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$r_buff1_thd0~0_In507339950 |ULTIMATE.start_main_#t~ite40_Out507339950|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In507339950, ~z$w_buff0_used~0=~z$w_buff0_used~0_In507339950, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In507339950, ~z$w_buff1_used~0=~z$w_buff1_used~0_In507339950} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In507339950, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out507339950|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In507339950, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In507339950, ~z$w_buff1_used~0=~z$w_buff1_used~0_In507339950} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 21:08:55,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~__unbuffered_p2_EBX~0_10 0) (= |v_ULTIMATE.start_main_#t~ite40_16| v_~z$r_buff1_thd0~0_14) (= v_~main$tmp_guard1~0_12 0) (= v_~__unbuffered_p1_EBX~0_11 0) (= 1 v_~__unbuffered_p2_EAX~0_10) (= 1 v_~__unbuffered_p1_EAX~0_10) (= 0 v_~__unbuffered_p0_EAX~0_12)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_11, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_11, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:08:55,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:08:55 BasicIcfg [2019-12-18 21:08:55,958 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:08:55,960 INFO L168 Benchmark]: Toolchain (without parser) took 12357.05 ms. Allocated memory was 144.7 MB in the beginning and 611.3 MB in the end (delta: 466.6 MB). Free memory was 100.5 MB in the beginning and 322.6 MB in the end (delta: -222.1 MB). Peak memory consumption was 244.5 MB. Max. memory is 7.1 GB. [2019-12-18 21:08:55,960 INFO L168 Benchmark]: CDTParser took 0.20 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.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 21:08:55,961 INFO L168 Benchmark]: CACSL2BoogieTranslator took 741.87 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.0 MB in the beginning and 155.8 MB in the end (delta: -55.8 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. [2019-12-18 21:08:55,961 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.48 ms. Allocated memory is still 201.9 MB. Free memory was 155.8 MB in the beginning and 153.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 21:08:55,962 INFO L168 Benchmark]: Boogie Preprocessor took 38.28 ms. Allocated memory is still 201.9 MB. Free memory was 153.0 MB in the beginning and 151.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:08:55,962 INFO L168 Benchmark]: RCFGBuilder took 779.08 ms. Allocated memory is still 201.9 MB. Free memory was 151.1 MB in the beginning and 107.1 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:08:55,963 INFO L168 Benchmark]: TraceAbstraction took 10706.92 ms. Allocated memory was 201.9 MB in the beginning and 611.3 MB in the end (delta: 409.5 MB). Free memory was 106.4 MB in the beginning and 322.6 MB in the end (delta: -216.1 MB). Peak memory consumption was 193.3 MB. Max. memory is 7.1 GB. [2019-12-18 21:08:55,966 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 741.87 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.0 MB in the beginning and 155.8 MB in the end (delta: -55.8 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 85.48 ms. Allocated memory is still 201.9 MB. Free memory was 155.8 MB in the beginning and 153.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.28 ms. Allocated memory is still 201.9 MB. Free memory was 153.0 MB in the beginning and 151.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 779.08 ms. Allocated memory is still 201.9 MB. Free memory was 151.1 MB in the beginning and 107.1 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10706.92 ms. Allocated memory was 201.9 MB in the beginning and 611.3 MB in the end (delta: 409.5 MB). Free memory was 106.4 MB in the beginning and 322.6 MB in the end (delta: -216.1 MB). Peak memory consumption was 193.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 156 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 85 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 28 ConcurrentYvCompositions, 19 ChoiceCompositions, 4625 VarBasedMoverChecksPositive, 127 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 51271 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L832] FCALL, FORK 0 pthread_create(&t852, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] FCALL, FORK 0 pthread_create(&t853, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] FCALL, FORK 0 pthread_create(&t854, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L794] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L795] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L796] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L797] 3 z$r_buff0_thd3 = (_Bool)1 [L800] 3 a = 1 [L803] 3 __unbuffered_p2_EAX = a [L806] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 2 x = 1 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 z$flush_delayed = weak$$choice2 [L766] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L810] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L767] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L811] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L768] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L770] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L773] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L844] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L845] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 147 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.3s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1503 SDtfs, 1213 SDslu, 2228 SDs, 0 SdLazy, 852 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14534occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 1767 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 420 NumberOfCodeBlocks, 420 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 362 ConstructedInterpolants, 0 QuantifiedInterpolants, 36148 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...