/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix052_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:37:20,169 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:37:20,173 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:37:20,193 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:37:20,193 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:37:20,195 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:37:20,198 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:37:20,202 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:37:20,204 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:37:20,207 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:37:20,209 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:37:20,210 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:37:20,210 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:37:20,211 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:37:20,212 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:37:20,213 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:37:20,214 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:37:20,215 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:37:20,216 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:37:20,218 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:37:20,220 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:37:20,221 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:37:20,222 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:37:20,223 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:37:20,225 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:37:20,225 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:37:20,226 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:37:20,226 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:37:20,227 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:37:20,228 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:37:20,228 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:37:20,229 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:37:20,229 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:37:20,230 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:37:20,231 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:37:20,231 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:37:20,232 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:37:20,232 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:37:20,232 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:37:20,233 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:37:20,234 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:37:20,234 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 21:37:20,248 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:37:20,249 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:37:20,250 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:37:20,250 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:37:20,250 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:37:20,250 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:37:20,251 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:37:20,251 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:37:20,251 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:37:20,251 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:37:20,251 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:37:20,252 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:37:20,252 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:37:20,252 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:37:20,252 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:37:20,252 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:37:20,253 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:37:20,253 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:37:20,253 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:37:20,253 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:37:20,253 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:37:20,254 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:37:20,254 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:37:20,254 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:37:20,254 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:37:20,254 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:37:20,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:37:20,255 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:37:20,255 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:37:20,255 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:37:20,255 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:37:20,256 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:37:20,526 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:37:20,546 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:37:20,550 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:37:20,552 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:37:20,553 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:37:20,554 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_rmo.opt.i [2019-12-27 21:37:20,623 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daa1aaefe/bc7ce6a0c8064926ab191eedc1f87aa6/FLAG6fcf99d76 [2019-12-27 21:37:21,180 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:37:21,180 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_rmo.opt.i [2019-12-27 21:37:21,197 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daa1aaefe/bc7ce6a0c8064926ab191eedc1f87aa6/FLAG6fcf99d76 [2019-12-27 21:37:21,439 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daa1aaefe/bc7ce6a0c8064926ab191eedc1f87aa6 [2019-12-27 21:37:21,450 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:37:21,452 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:37:21,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:37:21,454 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:37:21,457 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:37:21,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:37:21" (1/1) ... [2019-12-27 21:37:21,461 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c9a81ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:21, skipping insertion in model container [2019-12-27 21:37:21,461 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:37:21" (1/1) ... [2019-12-27 21:37:21,469 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:37:21,532 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:37:22,156 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:37:22,174 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:37:22,257 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:37:22,360 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:37:22,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:22 WrapperNode [2019-12-27 21:37:22,361 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:37:22,362 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:37:22,362 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:37:22,362 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:37:22,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:22" (1/1) ... [2019-12-27 21:37:22,397 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:22" (1/1) ... [2019-12-27 21:37:22,428 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:37:22,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:37:22,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:37:22,429 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:37:22,440 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:22" (1/1) ... [2019-12-27 21:37:22,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:22" (1/1) ... [2019-12-27 21:37:22,445 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:22" (1/1) ... [2019-12-27 21:37:22,446 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:22" (1/1) ... [2019-12-27 21:37:22,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:22" (1/1) ... [2019-12-27 21:37:22,467 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:22" (1/1) ... [2019-12-27 21:37:22,480 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:22" (1/1) ... [2019-12-27 21:37:22,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:37:22,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:37:22,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:37:22,497 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:37:22,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:37:22,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:37:22,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:37:22,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:37:22,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:37:22,558 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:37:22,559 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:37:22,559 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:37:22,559 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:37:22,559 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:37:22,560 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:37:22,560 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:37:22,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:37:22,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:37:22,562 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 21:37:23,286 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:37:23,286 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:37:23,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:37:23 BoogieIcfgContainer [2019-12-27 21:37:23,288 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:37:23,289 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:37:23,289 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:37:23,293 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:37:23,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:37:21" (1/3) ... [2019-12-27 21:37:23,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67e22488 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:37:23, skipping insertion in model container [2019-12-27 21:37:23,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:37:22" (2/3) ... [2019-12-27 21:37:23,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67e22488 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:37:23, skipping insertion in model container [2019-12-27 21:37:23,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:37:23" (3/3) ... [2019-12-27 21:37:23,297 INFO L109 eAbstractionObserver]: Analyzing ICFG mix052_rmo.opt.i [2019-12-27 21:37:23,307 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:37:23,308 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:37:23,316 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:37:23,317 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:37:23,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,356 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,356 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,359 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,360 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,383 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,383 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,384 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,384 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,384 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,396 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,396 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,401 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,404 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,407 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,408 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,408 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:37:23,447 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 21:37:23,469 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:37:23,469 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:37:23,469 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:37:23,469 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:37:23,470 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:37:23,470 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:37:23,470 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:37:23,470 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:37:23,488 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 176 transitions [2019-12-27 21:37:23,490 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-12-27 21:37:23,584 INFO L132 PetriNetUnfolder]: 35/173 cut-off events. [2019-12-27 21:37:23,585 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:37:23,606 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 347 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-27 21:37:23,634 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-12-27 21:37:23,725 INFO L132 PetriNetUnfolder]: 35/173 cut-off events. [2019-12-27 21:37:23,725 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:37:23,740 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 347 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-27 21:37:23,767 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-27 21:37:23,769 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:37:27,107 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 21:37:27,220 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 21:37:27,255 INFO L206 etLargeBlockEncoding]: Checked pairs total: 42778 [2019-12-27 21:37:27,255 INFO L214 etLargeBlockEncoding]: Total number of compositions: 107 [2019-12-27 21:37:27,259 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-27 21:37:28,142 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14534 states. [2019-12-27 21:37:28,144 INFO L276 IsEmpty]: Start isEmpty. Operand 14534 states. [2019-12-27 21:37:28,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 21:37:28,152 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:37:28,152 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:37:28,153 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:37:28,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:37:28,158 INFO L82 PathProgramCache]: Analyzing trace with hash 209995860, now seen corresponding path program 1 times [2019-12-27 21:37:28,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:37:28,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350510686] [2019-12-27 21:37:28,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:37:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:37:28,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:37:28,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350510686] [2019-12-27 21:37:28,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:37:28,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:37:28,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [296902960] [2019-12-27 21:37:28,405 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:37:28,413 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:37:28,424 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 21:37:28,425 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:37:28,428 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:37:28,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:37:28,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:37:28,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:37:28,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:37:28,443 INFO L87 Difference]: Start difference. First operand 14534 states. Second operand 3 states. [2019-12-27 21:37:28,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:37:28,847 INFO L93 Difference]: Finished difference Result 13958 states and 53420 transitions. [2019-12-27 21:37:28,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:37:28,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 21:37:28,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:37:29,222 INFO L225 Difference]: With dead ends: 13958 [2019-12-27 21:37:29,222 INFO L226 Difference]: Without dead ends: 13126 [2019-12-27 21:37:29,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:37:29,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13126 states. [2019-12-27 21:37:29,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13126 to 13126. [2019-12-27 21:37:29,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13126 states. [2019-12-27 21:37:29,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13126 states to 13126 states and 50158 transitions. [2019-12-27 21:37:29,892 INFO L78 Accepts]: Start accepts. Automaton has 13126 states and 50158 transitions. Word has length 7 [2019-12-27 21:37:29,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:37:29,894 INFO L462 AbstractCegarLoop]: Abstraction has 13126 states and 50158 transitions. [2019-12-27 21:37:29,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:37:29,894 INFO L276 IsEmpty]: Start isEmpty. Operand 13126 states and 50158 transitions. [2019-12-27 21:37:29,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 21:37:29,899 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:37:29,899 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:37:29,900 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:37:29,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:37:29,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1116254603, now seen corresponding path program 1 times [2019-12-27 21:37:29,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:37:29,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452134671] [2019-12-27 21:37:29,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:37:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:37:29,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:37:29,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452134671] [2019-12-27 21:37:29,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:37:29,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:37:29,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1517927331] [2019-12-27 21:37:29,997 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:37:29,998 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:37:30,002 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 21:37:30,002 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:37:30,002 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:37:30,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:37:30,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:37:30,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:37:30,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:37:30,005 INFO L87 Difference]: Start difference. First operand 13126 states and 50158 transitions. Second operand 3 states. [2019-12-27 21:37:30,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:37:30,798 INFO L93 Difference]: Finished difference Result 7844 states and 26213 transitions. [2019-12-27 21:37:30,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:37:30,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 21:37:30,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:37:30,845 INFO L225 Difference]: With dead ends: 7844 [2019-12-27 21:37:30,845 INFO L226 Difference]: Without dead ends: 7844 [2019-12-27 21:37:30,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:37:30,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7844 states. [2019-12-27 21:37:31,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7844 to 7844. [2019-12-27 21:37:31,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7844 states. [2019-12-27 21:37:31,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7844 states to 7844 states and 26213 transitions. [2019-12-27 21:37:31,141 INFO L78 Accepts]: Start accepts. Automaton has 7844 states and 26213 transitions. Word has length 13 [2019-12-27 21:37:31,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:37:31,141 INFO L462 AbstractCegarLoop]: Abstraction has 7844 states and 26213 transitions. [2019-12-27 21:37:31,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:37:31,141 INFO L276 IsEmpty]: Start isEmpty. Operand 7844 states and 26213 transitions. [2019-12-27 21:37:31,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 21:37:31,148 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:37:31,148 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:37:31,149 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:37:31,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:37:31,149 INFO L82 PathProgramCache]: Analyzing trace with hash -344203735, now seen corresponding path program 1 times [2019-12-27 21:37:31,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:37:31,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238439453] [2019-12-27 21:37:31,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:37:31,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:37:31,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:37:31,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238439453] [2019-12-27 21:37:31,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:37:31,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:37:31,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1911243771] [2019-12-27 21:37:31,261 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:37:31,263 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:37:31,266 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 19 states and 22 transitions. [2019-12-27 21:37:31,266 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:37:31,341 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:37:31,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:37:31,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:37:31,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:37:31,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:37:31,342 INFO L87 Difference]: Start difference. First operand 7844 states and 26213 transitions. Second operand 6 states. [2019-12-27 21:37:31,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:37:31,414 INFO L93 Difference]: Finished difference Result 1804 states and 4854 transitions. [2019-12-27 21:37:31,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:37:31,415 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-12-27 21:37:31,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:37:31,421 INFO L225 Difference]: With dead ends: 1804 [2019-12-27 21:37:31,421 INFO L226 Difference]: Without dead ends: 1804 [2019-12-27 21:37:31,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:37:31,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2019-12-27 21:37:31,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1804. [2019-12-27 21:37:31,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1804 states. [2019-12-27 21:37:31,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 4854 transitions. [2019-12-27 21:37:31,486 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 4854 transitions. Word has length 14 [2019-12-27 21:37:31,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:37:31,486 INFO L462 AbstractCegarLoop]: Abstraction has 1804 states and 4854 transitions. [2019-12-27 21:37:31,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:37:31,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 4854 transitions. [2019-12-27 21:37:31,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:37:31,488 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:37:31,488 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:37:31,489 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:37:31,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:37:31,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1665710889, now seen corresponding path program 1 times [2019-12-27 21:37:31,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:37:31,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432160516] [2019-12-27 21:37:31,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:37:31,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:37:31,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:37:31,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432160516] [2019-12-27 21:37:31,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:37:31,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:37:31,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [528933710] [2019-12-27 21:37:31,591 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:37:31,594 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:37:31,602 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 21:37:31,603 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:37:31,627 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:37:31,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:37:31,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:37:31,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:37:31,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:37:31,628 INFO L87 Difference]: Start difference. First operand 1804 states and 4854 transitions. Second operand 5 states. [2019-12-27 21:37:31,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:37:31,871 INFO L93 Difference]: Finished difference Result 2487 states and 6609 transitions. [2019-12-27 21:37:31,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:37:31,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 21:37:31,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:37:31,887 INFO L225 Difference]: With dead ends: 2487 [2019-12-27 21:37:31,887 INFO L226 Difference]: Without dead ends: 2487 [2019-12-27 21:37:31,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:37:31,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2487 states. [2019-12-27 21:37:31,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2487 to 2335. [2019-12-27 21:37:31,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2335 states. [2019-12-27 21:37:31,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 2335 states and 6271 transitions. [2019-12-27 21:37:31,954 INFO L78 Accepts]: Start accepts. Automaton has 2335 states and 6271 transitions. Word has length 16 [2019-12-27 21:37:31,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:37:31,954 INFO L462 AbstractCegarLoop]: Abstraction has 2335 states and 6271 transitions. [2019-12-27 21:37:31,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:37:31,954 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 6271 transitions. [2019-12-27 21:37:31,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:37:31,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:37:31,956 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:37:31,956 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:37:31,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:37:31,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1665798557, now seen corresponding path program 1 times [2019-12-27 21:37:31,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:37:31,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456016332] [2019-12-27 21:37:31,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:37:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:37:32,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:37:32,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456016332] [2019-12-27 21:37:32,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:37:32,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:37:32,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1330456038] [2019-12-27 21:37:32,018 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:37:32,020 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:37:32,026 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 21:37:32,026 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:37:32,047 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:37:32,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:37:32,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:37:32,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:37:32,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:37:32,048 INFO L87 Difference]: Start difference. First operand 2335 states and 6271 transitions. Second operand 5 states. [2019-12-27 21:37:32,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:37:32,265 INFO L93 Difference]: Finished difference Result 2822 states and 7464 transitions. [2019-12-27 21:37:32,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:37:32,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 21:37:32,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:37:32,274 INFO L225 Difference]: With dead ends: 2822 [2019-12-27 21:37:32,274 INFO L226 Difference]: Without dead ends: 2822 [2019-12-27 21:37:32,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:37:32,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2822 states. [2019-12-27 21:37:32,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2822 to 2176. [2019-12-27 21:37:32,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2176 states. [2019-12-27 21:37:32,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 5796 transitions. [2019-12-27 21:37:32,336 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 5796 transitions. Word has length 16 [2019-12-27 21:37:32,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:37:32,336 INFO L462 AbstractCegarLoop]: Abstraction has 2176 states and 5796 transitions. [2019-12-27 21:37:32,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:37:32,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 5796 transitions. [2019-12-27 21:37:32,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 21:37:32,340 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:37:32,340 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-27 21:37:32,340 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:37:32,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:37:32,341 INFO L82 PathProgramCache]: Analyzing trace with hash 966323881, now seen corresponding path program 1 times [2019-12-27 21:37:32,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:37:32,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559342082] [2019-12-27 21:37:32,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:37:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:37:32,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:37:32,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559342082] [2019-12-27 21:37:32,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:37:32,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:37:32,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2027812325] [2019-12-27 21:37:32,405 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:37:32,413 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:37:32,422 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 45 transitions. [2019-12-27 21:37:32,422 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:37:32,438 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:37:32,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:37:32,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:37:32,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:37:32,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:37:32,439 INFO L87 Difference]: Start difference. First operand 2176 states and 5796 transitions. Second operand 4 states. [2019-12-27 21:37:32,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:37:32,616 INFO L93 Difference]: Finished difference Result 4641 states and 12023 transitions. [2019-12-27 21:37:32,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:37:32,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-12-27 21:37:32,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:37:32,627 INFO L225 Difference]: With dead ends: 4641 [2019-12-27 21:37:32,627 INFO L226 Difference]: Without dead ends: 3313 [2019-12-27 21:37:32,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:37:32,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3313 states. [2019-12-27 21:37:32,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3313 to 2248. [2019-12-27 21:37:32,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2248 states. [2019-12-27 21:37:32,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 5362 transitions. [2019-12-27 21:37:32,703 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 5362 transitions. Word has length 29 [2019-12-27 21:37:32,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:37:32,703 INFO L462 AbstractCegarLoop]: Abstraction has 2248 states and 5362 transitions. [2019-12-27 21:37:32,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:37:32,704 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 5362 transitions. [2019-12-27 21:37:32,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 21:37:32,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:37:32,708 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-27 21:37:32,708 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:37:32,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:37:32,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1536908682, now seen corresponding path program 1 times [2019-12-27 21:37:32,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:37:32,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294277134] [2019-12-27 21:37:32,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:37:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:37:32,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:37:32,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294277134] [2019-12-27 21:37:32,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:37:32,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:37:32,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1839933585] [2019-12-27 21:37:32,769 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:37:32,775 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:37:32,804 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 106 states and 209 transitions. [2019-12-27 21:37:32,804 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:37:32,838 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 21:37:32,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:37:32,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:37:32,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:37:32,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:37:32,839 INFO L87 Difference]: Start difference. First operand 2248 states and 5362 transitions. Second operand 5 states. [2019-12-27 21:37:32,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:37:32,917 INFO L93 Difference]: Finished difference Result 3207 states and 7534 transitions. [2019-12-27 21:37:32,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:37:32,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-27 21:37:32,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:37:32,926 INFO L225 Difference]: With dead ends: 3207 [2019-12-27 21:37:32,926 INFO L226 Difference]: Without dead ends: 3207 [2019-12-27 21:37:32,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:37:32,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3207 states. [2019-12-27 21:37:32,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3207 to 2421. [2019-12-27 21:37:32,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2421 states. [2019-12-27 21:37:32,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2421 states to 2421 states and 5716 transitions. [2019-12-27 21:37:32,985 INFO L78 Accepts]: Start accepts. Automaton has 2421 states and 5716 transitions. Word has length 29 [2019-12-27 21:37:32,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:37:32,986 INFO L462 AbstractCegarLoop]: Abstraction has 2421 states and 5716 transitions. [2019-12-27 21:37:32,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:37:32,986 INFO L276 IsEmpty]: Start isEmpty. Operand 2421 states and 5716 transitions. [2019-12-27 21:37:32,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 21:37:32,991 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:37:32,991 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:37:32,992 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:37:32,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:37:32,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1529330804, now seen corresponding path program 1 times [2019-12-27 21:37:32,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:37:32,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54758445] [2019-12-27 21:37:32,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:37:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:37:33,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:37:33,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54758445] [2019-12-27 21:37:33,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:37:33,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:37:33,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [649127013] [2019-12-27 21:37:33,061 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:37:33,070 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:37:33,155 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 106 states and 209 transitions. [2019-12-27 21:37:33,156 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:37:33,220 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 21:37:33,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:37:33,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:37:33,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:37:33,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:37:33,221 INFO L87 Difference]: Start difference. First operand 2421 states and 5716 transitions. Second operand 8 states. [2019-12-27 21:37:33,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:37:33,269 INFO L93 Difference]: Finished difference Result 1464 states and 3319 transitions. [2019-12-27 21:37:33,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:37:33,270 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-12-27 21:37:33,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:37:33,272 INFO L225 Difference]: With dead ends: 1464 [2019-12-27 21:37:33,272 INFO L226 Difference]: Without dead ends: 748 [2019-12-27 21:37:33,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:37:33,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-12-27 21:37:33,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 708. [2019-12-27 21:37:33,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2019-12-27 21:37:33,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1567 transitions. [2019-12-27 21:37:33,285 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1567 transitions. Word has length 29 [2019-12-27 21:37:33,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:37:33,288 INFO L462 AbstractCegarLoop]: Abstraction has 708 states and 1567 transitions. [2019-12-27 21:37:33,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:37:33,288 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1567 transitions. [2019-12-27 21:37:33,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 21:37:33,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:37:33,293 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-27 21:37:33,294 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:37:33,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:37:33,294 INFO L82 PathProgramCache]: Analyzing trace with hash 781934548, now seen corresponding path program 1 times [2019-12-27 21:37:33,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:37:33,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818988688] [2019-12-27 21:37:33,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:37:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:37:33,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:37:33,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818988688] [2019-12-27 21:37:33,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:37:33,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:37:33,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [612997226] [2019-12-27 21:37:33,401 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:37:33,415 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:37:33,482 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 124 states and 181 transitions. [2019-12-27 21:37:33,483 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:37:33,490 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:37:33,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:37:33,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:37:33,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:37:33,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:37:33,491 INFO L87 Difference]: Start difference. First operand 708 states and 1567 transitions. Second operand 7 states. [2019-12-27 21:37:33,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:37:33,760 INFO L93 Difference]: Finished difference Result 1886 states and 4119 transitions. [2019-12-27 21:37:33,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 21:37:33,760 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2019-12-27 21:37:33,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:37:33,765 INFO L225 Difference]: With dead ends: 1886 [2019-12-27 21:37:33,765 INFO L226 Difference]: Without dead ends: 1248 [2019-12-27 21:37:33,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:37:33,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2019-12-27 21:37:33,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 816. [2019-12-27 21:37:33,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816 states. [2019-12-27 21:37:33,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1802 transitions. [2019-12-27 21:37:33,783 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1802 transitions. Word has length 44 [2019-12-27 21:37:33,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:37:33,784 INFO L462 AbstractCegarLoop]: Abstraction has 816 states and 1802 transitions. [2019-12-27 21:37:33,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:37:33,784 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1802 transitions. [2019-12-27 21:37:33,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 21:37:33,786 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:37:33,786 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-27 21:37:33,786 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:37:33,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:37:33,787 INFO L82 PathProgramCache]: Analyzing trace with hash 2142597012, now seen corresponding path program 2 times [2019-12-27 21:37:33,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:37:33,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487674116] [2019-12-27 21:37:33,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:37:33,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:37:33,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:37:33,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487674116] [2019-12-27 21:37:33,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:37:33,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:37:33,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1542926006] [2019-12-27 21:37:33,941 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:37:33,952 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:37:34,079 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 154 states and 219 transitions. [2019-12-27 21:37:34,079 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:37:34,224 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 21:37:34,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 21:37:34,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:37:34,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 21:37:34,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-12-27 21:37:34,225 INFO L87 Difference]: Start difference. First operand 816 states and 1802 transitions. Second operand 14 states. [2019-12-27 21:37:37,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:37:37,166 INFO L93 Difference]: Finished difference Result 1856 states and 3815 transitions. [2019-12-27 21:37:37,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 21:37:37,167 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2019-12-27 21:37:37,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:37:37,174 INFO L225 Difference]: With dead ends: 1856 [2019-12-27 21:37:37,174 INFO L226 Difference]: Without dead ends: 1838 [2019-12-27 21:37:37,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=398, Invalid=1324, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 21:37:37,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-12-27 21:37:37,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1039. [2019-12-27 21:37:37,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1039 states. [2019-12-27 21:37:37,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 2239 transitions. [2019-12-27 21:37:37,201 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 2239 transitions. Word has length 44 [2019-12-27 21:37:37,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:37:37,203 INFO L462 AbstractCegarLoop]: Abstraction has 1039 states and 2239 transitions. [2019-12-27 21:37:37,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 21:37:37,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 2239 transitions. [2019-12-27 21:37:37,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 21:37:37,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:37:37,207 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-27 21:37:37,207 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:37:37,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:37:37,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1798984674, now seen corresponding path program 3 times [2019-12-27 21:37:37,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:37:37,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001906640] [2019-12-27 21:37:37,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:37:37,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:37:37,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:37:37,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001906640] [2019-12-27 21:37:37,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:37:37,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:37:37,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1097920132] [2019-12-27 21:37:37,320 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:37:37,331 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:37:37,404 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 124 states and 167 transitions. [2019-12-27 21:37:37,404 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:37:37,404 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:37:37,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:37:37,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:37:37,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:37:37,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:37:37,406 INFO L87 Difference]: Start difference. First operand 1039 states and 2239 transitions. Second operand 3 states. [2019-12-27 21:37:37,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:37:37,421 INFO L93 Difference]: Finished difference Result 1037 states and 2234 transitions. [2019-12-27 21:37:37,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:37:37,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-27 21:37:37,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:37:37,424 INFO L225 Difference]: With dead ends: 1037 [2019-12-27 21:37:37,424 INFO L226 Difference]: Without dead ends: 1037 [2019-12-27 21:37:37,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:37:37,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2019-12-27 21:37:37,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 834. [2019-12-27 21:37:37,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 834 states. [2019-12-27 21:37:37,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1840 transitions. [2019-12-27 21:37:37,440 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1840 transitions. Word has length 44 [2019-12-27 21:37:37,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:37:37,441 INFO L462 AbstractCegarLoop]: Abstraction has 834 states and 1840 transitions. [2019-12-27 21:37:37,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:37:37,441 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1840 transitions. [2019-12-27 21:37:37,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 21:37:37,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:37:37,445 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-27 21:37:37,445 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:37:37,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:37:37,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1709517426, now seen corresponding path program 1 times [2019-12-27 21:37:37,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:37:37,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191373548] [2019-12-27 21:37:37,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:37:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:37:37,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:37:37,601 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:37:37,601 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:37:37,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$r_buff1_thd3~0_20) (= v_~main$tmp_guard1~0_18 0) (= v_~y$r_buff0_thd2~0_65 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd1~0_10 0) (= 0 v_~y$w_buff1~0_23) (= 0 v_~__unbuffered_cnt~0_20) (= |v_#NULL.offset_3| 0) (= 0 v_~y$r_buff1_thd0~0_22) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1400~0.base_27| 4) |v_#length_21|) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~weak$$choice2~0_32) (= v_~y$read_delayed~0_6 0) (= v_~y$w_buff1_used~0_57 0) (= 0 v_~y$w_buff0_used~0_92) (= v_~x~0_17 0) (= v_~y$r_buff1_thd1~0_8 0) (= 0 v_~y$flush_delayed~0_13) (= 0 v_~__unbuffered_p2_EAX~0_17) (= v_~y~0_22 0) (= v_~y$r_buff0_thd0~0_21 0) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$w_buff0~0_25) (= 0 |v_#NULL.base_3|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1400~0.base_27| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1400~0.base_27|) |v_ULTIMATE.start_main_~#t1400~0.offset_21| 0)) |v_#memory_int_17|) (= v_~z~0_12 0) (= v_~y$mem_tmp~0_10 0) (= 0 v_~__unbuffered_p1_EAX~0_17) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1400~0.base_27|)) (= v_~y$r_buff0_thd3~0_27 0) (= 0 v_~y$r_buff1_thd2~0_43) (= |v_ULTIMATE.start_main_~#t1400~0.offset_21| 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1400~0.base_27| 1) |v_#valid_60|) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1400~0.base_27|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_~#t1400~0.base=|v_ULTIMATE.start_main_~#t1400~0.base_27|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_9|, #NULL.offset=|v_#NULL.offset_3|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ULTIMATE.start_main_~#t1400~0.offset=|v_ULTIMATE.start_main_~#t1400~0.offset_21|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, 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_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_11|, ULTIMATE.start_main_~#t1402~0.base=|v_ULTIMATE.start_main_~#t1402~0.base_21|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ULTIMATE.start_main_~#t1401~0.base=|v_ULTIMATE.start_main_~#t1401~0.base_25|, ~y$w_buff1~0=v_~y$w_buff1~0_23, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_65, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_22, ~x~0=v_~x~0_17, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_92, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ULTIMATE.start_main_~#t1401~0.offset=|v_ULTIMATE.start_main_~#t1401~0.offset_20|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_8, ~y$w_buff0~0=v_~y$w_buff0~0_25, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_27, ~y~0=v_~y~0_22, 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_10, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_43, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1402~0.offset=|v_ULTIMATE.start_main_~#t1402~0.offset_15|, ~z~0=v_~z~0_12, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_57} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1400~0.base, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_#t~nondet34, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1401~0.offset, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ULTIMATE.start_main_~#t1400~0.offset, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t1402~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1401~0.base, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ~y$r_buff0_thd2~0, #valid, #memory_int, ULTIMATE.start_main_~#t1402~0.offset, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 21:37:37,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L810-1-->L812: Formula: (and (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1401~0.base_9| 1)) (not (= |v_ULTIMATE.start_main_~#t1401~0.base_9| 0)) (= 0 |v_ULTIMATE.start_main_~#t1401~0.offset_9|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1401~0.base_9|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1401~0.base_9| 4)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1401~0.base_9|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1401~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1401~0.base_9|) |v_ULTIMATE.start_main_~#t1401~0.offset_9| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t1401~0.base=|v_ULTIMATE.start_main_~#t1401~0.base_9|, ULTIMATE.start_main_~#t1401~0.offset=|v_ULTIMATE.start_main_~#t1401~0.offset_9|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1401~0.base, ULTIMATE.start_main_~#t1401~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 21:37:37,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L812-1-->L814: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1402~0.base_10|) (not (= |v_ULTIMATE.start_main_~#t1402~0.base_10| 0)) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1402~0.base_10| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1402~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1402~0.base_10|) |v_ULTIMATE.start_main_~#t1402~0.offset_9| 2)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1402~0.base_10| 4)) (= 0 |v_ULTIMATE.start_main_~#t1402~0.offset_9|) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1402~0.base_10|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1402~0.offset=|v_ULTIMATE.start_main_~#t1402~0.offset_9|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1402~0.base=|v_ULTIMATE.start_main_~#t1402~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t1402~0.offset, #length, ULTIMATE.start_main_~#t1402~0.base] because there is no mapped edge [2019-12-27 21:37:37,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [610] [610] L4-->L787: Formula: (and (= v_~y$r_buff0_thd3~0_16 v_~y$r_buff1_thd3~0_10) (= v_~__unbuffered_p2_EAX~0_4 v_~z~0_4) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_6)) (= v_~y$r_buff0_thd2~0_42 v_~y$r_buff1_thd2~0_22) (= v_~y$r_buff1_thd1~0_3 v_~y$r_buff0_thd1~0_4) (= v_~y$r_buff0_thd0~0_15 v_~y$r_buff1_thd0~0_10) (= v_~y$r_buff0_thd3~0_15 1)) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_16, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_42, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_6, ~z~0=v_~z~0_4} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_22, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_3, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_10, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_15, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_42, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_6, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_4, ~z~0=v_~z~0_4, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 21:37:37,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 1 v_~x~0_6) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|) (= 1 v_~z~0_7)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~z~0=v_~z~0_7, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, ~x~0=v_~x~0_6, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 21:37:37,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L752-->L752-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In803974793 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite9_Out803974793| |P1Thread1of1ForFork1_#t~ite8_Out803974793|) (= |P1Thread1of1ForFork1_#t~ite8_Out803974793| ~y$w_buff0~0_In803974793) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In803974793 256) 0))) (or (and (= (mod ~y$r_buff1_thd2~0_In803974793 256) 0) .cse1) (and (= 0 (mod ~y$w_buff1_used~0_In803974793 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In803974793 256))))) (and (= |P1Thread1of1ForFork1_#t~ite9_Out803974793| ~y$w_buff0~0_In803974793) (= |P1Thread1of1ForFork1_#t~ite8_In803974793| |P1Thread1of1ForFork1_#t~ite8_Out803974793|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In803974793, ~y$w_buff0_used~0=~y$w_buff0_used~0_In803974793, ~y$w_buff0~0=~y$w_buff0~0_In803974793, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In803974793, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In803974793|, ~weak$$choice2~0=~weak$$choice2~0_In803974793, ~y$w_buff1_used~0=~y$w_buff1_used~0_In803974793} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In803974793, ~y$w_buff0_used~0=~y$w_buff0_used~0_In803974793, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out803974793|, ~y$w_buff0~0=~y$w_buff0~0_In803974793, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In803974793, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out803974793|, ~weak$$choice2~0=~weak$$choice2~0_In803974793, ~y$w_buff1_used~0=~y$w_buff1_used~0_In803974793} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 21:37:37,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L753-->L753-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1554709537 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1554709537 256)))) (or (= (mod ~y$w_buff0_used~0_In-1554709537 256) 0) (and (= (mod ~y$w_buff1_used~0_In-1554709537 256) 0) .cse0) (and (= 0 (mod ~y$r_buff1_thd2~0_In-1554709537 256)) .cse0))) .cse1 (= ~y$w_buff1~0_In-1554709537 |P1Thread1of1ForFork1_#t~ite11_Out-1554709537|) (= |P1Thread1of1ForFork1_#t~ite12_Out-1554709537| |P1Thread1of1ForFork1_#t~ite11_Out-1554709537|)) (and (= ~y$w_buff1~0_In-1554709537 |P1Thread1of1ForFork1_#t~ite12_Out-1554709537|) (= |P1Thread1of1ForFork1_#t~ite11_In-1554709537| |P1Thread1of1ForFork1_#t~ite11_Out-1554709537|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1554709537, ~y$w_buff1~0=~y$w_buff1~0_In-1554709537, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1554709537, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1554709537, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_In-1554709537|, ~weak$$choice2~0=~weak$$choice2~0_In-1554709537, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1554709537} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1554709537, ~y$w_buff1~0=~y$w_buff1~0_In-1554709537, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1554709537, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1554709537, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1554709537|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1554709537|, ~weak$$choice2~0=~weak$$choice2~0_In-1554709537, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1554709537} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 21:37:37,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L756-->L757: Formula: (and (= v_~y$r_buff0_thd2~0_56 v_~y$r_buff0_thd2~0_55) (not (= 0 (mod v_~weak$$choice2~0_24 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_56, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_9|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_10|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_55, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_8|, ~weak$$choice2~0=v_~weak$$choice2~0_24} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 21:37:37,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L759-->L767: Formula: (and (= v_~y~0_15 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= 0 v_~y$flush_delayed~0_7) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~y~0=v_~y~0_15, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-27 21:37:37,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In351516165 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In351516165 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite28_Out351516165|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In351516165 |P2Thread1of1ForFork2_#t~ite28_Out351516165|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In351516165, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In351516165} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In351516165, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In351516165, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out351516165|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-27 21:37:37,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L789-->L789-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd3~0_In-1658060415 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1658060415 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1658060415 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1658060415 256)))) (or (and (= ~y$w_buff1_used~0_In-1658060415 |P2Thread1of1ForFork2_#t~ite29_Out-1658060415|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite29_Out-1658060415|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1658060415, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1658060415, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1658060415, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1658060415} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1658060415, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1658060415, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1658060415, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-1658060415|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1658060415} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 21:37:37,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L790-->L791: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In1193685794 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1193685794 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_Out1193685794 ~y$r_buff0_thd3~0_In1193685794)) (and (not .cse1) (not .cse0) (= ~y$r_buff0_thd3~0_Out1193685794 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1193685794, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1193685794} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1193685794, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out1193685794|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1193685794} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 21:37:37,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L791-->L791-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-2146655222 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-2146655222 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In-2146655222 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-2146655222 256)))) (or (and (= ~y$r_buff1_thd3~0_In-2146655222 |P2Thread1of1ForFork2_#t~ite31_Out-2146655222|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite31_Out-2146655222| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2146655222, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2146655222, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2146655222, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2146655222} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2146655222, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2146655222, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out-2146655222|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2146655222, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2146655222} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 21:37:37,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [674] [674] L791-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite31_8| v_~y$r_buff1_thd3~0_15) (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_7|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 21:37:37,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L814-1-->L820: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 21:37:37,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L820-2-->L820-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1496851107 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1496851107 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite35_Out1496851107| ~y$w_buff1~0_In1496851107) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite35_Out1496851107| ~y~0_In1496851107)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1496851107, ~y~0=~y~0_In1496851107, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1496851107, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1496851107} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1496851107, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1496851107|, ~y~0=~y~0_In1496851107, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1496851107, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1496851107} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-27 21:37:37,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L820-4-->L821: Formula: (= v_~y~0_13 |v_ULTIMATE.start_main_#t~ite35_8|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_8|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_7|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_7|, ~y~0=v_~y~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-27 21:37:37,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In2071927449 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In2071927449 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite37_Out2071927449|) (not .cse1)) (and (= ~y$w_buff0_used~0_In2071927449 |ULTIMATE.start_main_#t~ite37_Out2071927449|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2071927449, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2071927449} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2071927449, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2071927449, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out2071927449|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 21:37:37,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L822-->L822-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In488803504 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In488803504 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In488803504 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In488803504 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In488803504 |ULTIMATE.start_main_#t~ite38_Out488803504|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite38_Out488803504|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In488803504, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In488803504, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In488803504, ~y$w_buff1_used~0=~y$w_buff1_used~0_In488803504} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In488803504, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In488803504, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out488803504|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In488803504, ~y$w_buff1_used~0=~y$w_buff1_used~0_In488803504} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 21:37:37,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In375459464 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In375459464 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite39_Out375459464|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In375459464 |ULTIMATE.start_main_#t~ite39_Out375459464|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In375459464, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In375459464} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In375459464, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out375459464|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In375459464} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 21:37:37,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L824-->L824-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-311449541 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-311449541 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-311449541 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-311449541 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite40_Out-311449541| ~y$r_buff1_thd0~0_In-311449541)) (and (= 0 |ULTIMATE.start_main_#t~ite40_Out-311449541|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-311449541, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-311449541, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-311449541, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-311449541} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-311449541|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-311449541, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-311449541, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-311449541, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-311449541} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 21:37:37,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L824-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p2_EAX~0_11) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= 0 v_~__unbuffered_p1_EAX~0_11) (= v_~main$tmp_guard1~0_12 0) (= |v_ULTIMATE.start_main_#t~ite40_14| v_~y$r_buff1_thd0~0_16) (= v_~x~0_11 2)) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_11, ~x~0=v_~x~0_11} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_11, ~x~0=v_~x~0_11, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_16, 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, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:37:37,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:37:37 BasicIcfg [2019-12-27 21:37:37,742 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:37:37,744 INFO L168 Benchmark]: Toolchain (without parser) took 16292.26 ms. Allocated memory was 136.3 MB in the beginning and 656.4 MB in the end (delta: 520.1 MB). Free memory was 99.6 MB in the beginning and 358.2 MB in the end (delta: -258.7 MB). Peak memory consumption was 261.4 MB. Max. memory is 7.1 GB. [2019-12-27 21:37:37,745 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 136.3 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 21:37:37,747 INFO L168 Benchmark]: CACSL2BoogieTranslator took 907.88 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 99.1 MB in the beginning and 152.8 MB in the end (delta: -53.7 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-27 21:37:37,748 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.13 ms. Allocated memory is still 200.3 MB. Free memory was 152.8 MB in the beginning and 149.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2019-12-27 21:37:37,749 INFO L168 Benchmark]: Boogie Preprocessor took 66.76 ms. Allocated memory is still 200.3 MB. Free memory was 149.8 MB in the beginning and 147.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 21:37:37,752 INFO L168 Benchmark]: RCFGBuilder took 791.92 ms. Allocated memory is still 200.3 MB. Free memory was 147.7 MB in the beginning and 104.5 MB in the end (delta: 43.2 MB). Peak memory consumption was 43.2 MB. Max. memory is 7.1 GB. [2019-12-27 21:37:37,753 INFO L168 Benchmark]: TraceAbstraction took 14452.78 ms. Allocated memory was 200.3 MB in the beginning and 656.4 MB in the end (delta: 456.1 MB). Free memory was 103.8 MB in the beginning and 358.2 MB in the end (delta: -254.4 MB). Peak memory consumption was 201.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:37:37,765 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.53 ms. Allocated memory is still 136.3 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 907.88 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 99.1 MB in the beginning and 152.8 MB in the end (delta: -53.7 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.13 ms. Allocated memory is still 200.3 MB. Free memory was 152.8 MB in the beginning and 149.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 66.76 ms. Allocated memory is still 200.3 MB. Free memory was 149.8 MB in the beginning and 147.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 791.92 ms. Allocated memory is still 200.3 MB. Free memory was 147.7 MB in the beginning and 104.5 MB in the end (delta: 43.2 MB). Peak memory consumption was 43.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14452.78 ms. Allocated memory was 200.3 MB in the beginning and 656.4 MB in the end (delta: 456.1 MB). Free memory was 103.8 MB in the beginning and 358.2 MB in the end (delta: -254.4 MB). Peak memory consumption was 201.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 151 ProgramPointsBefore, 75 ProgramPointsAfterwards, 176 TransitionsBefore, 84 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 20 ChoiceCompositions, 4933 VarBasedMoverChecksPositive, 125 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 42778 CheckedPairsTotal, 107 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t1400, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t1401, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t1402, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L772] 3 y$w_buff1 = y$w_buff0 [L773] 3 y$w_buff0 = 1 [L774] 3 y$w_buff1_used = y$w_buff0_used [L775] 3 y$w_buff0_used = (_Bool)1 [L787] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L744] 2 x = 2 [L747] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 2 y$flush_delayed = weak$$choice2 [L750] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L752] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L753] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L754] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L755] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L758] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L788] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L789] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L820] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L822] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L823] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.1s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1377 SDtfs, 1718 SDslu, 3471 SDs, 0 SdLazy, 2386 SolverSat, 198 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 42 SyntacticMatches, 6 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.4s 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: 1.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 4123 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 330 NumberOfCodeBlocks, 330 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 274 ConstructedInterpolants, 0 QuantifiedInterpolants, 29600 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...