/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/mix016_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:12:17,248 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:12:17,251 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:12:17,270 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:12:17,270 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:12:17,272 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:12:17,274 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:12:17,284 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:12:17,287 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:12:17,290 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:12:17,292 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:12:17,294 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:12:17,294 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:12:17,296 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:12:17,298 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:12:17,299 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:12:17,301 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:12:17,301 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:12:17,303 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:12:17,307 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:12:17,312 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:12:17,316 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:12:17,318 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:12:17,318 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:12:17,320 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:12:17,321 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:12:17,321 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:12:17,323 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:12:17,324 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:12:17,325 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:12:17,325 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:12:17,326 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:12:17,326 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:12:17,327 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:12:17,328 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:12:17,329 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:12:17,329 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:12:17,330 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:12:17,330 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:12:17,331 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:12:17,332 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:12:17,333 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 20:12:17,367 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:12:17,368 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:12:17,369 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:12:17,369 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:12:17,369 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:12:17,369 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:12:17,370 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:12:17,370 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:12:17,370 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:12:17,370 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:12:17,370 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:12:17,371 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:12:17,371 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:12:17,371 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:12:17,371 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:12:17,371 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:12:17,371 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:12:17,374 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:12:17,374 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:12:17,374 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:12:17,374 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:12:17,374 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:12:17,375 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:12:17,375 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:12:17,375 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:12:17,375 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:12:17,375 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:12:17,376 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:12:17,376 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:12:17,376 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:12:17,376 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:12:17,376 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:12:17,655 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:12:17,674 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:12:17,678 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:12:17,680 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:12:17,682 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:12:17,682 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_tso.opt.i [2019-12-27 20:12:17,753 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2e7c09db/858522ca85ab405aa3d65ca612ca78dc/FLAG0ae4c5c09 [2019-12-27 20:12:18,322 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:12:18,323 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_tso.opt.i [2019-12-27 20:12:18,344 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2e7c09db/858522ca85ab405aa3d65ca612ca78dc/FLAG0ae4c5c09 [2019-12-27 20:12:18,603 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2e7c09db/858522ca85ab405aa3d65ca612ca78dc [2019-12-27 20:12:18,611 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:12:18,613 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:12:18,614 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:12:18,614 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:12:18,618 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:12:18,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:12:18" (1/1) ... [2019-12-27 20:12:18,622 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c02b278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:12:18, skipping insertion in model container [2019-12-27 20:12:18,622 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:12:18" (1/1) ... [2019-12-27 20:12:18,630 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:12:18,686 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:12:19,211 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:12:19,226 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:12:19,329 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:12:19,402 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:12:19,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:12:19 WrapperNode [2019-12-27 20:12:19,402 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:12:19,403 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:12:19,403 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:12:19,404 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:12:19,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:12:19" (1/1) ... [2019-12-27 20:12:19,437 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:12:19" (1/1) ... [2019-12-27 20:12:19,474 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:12:19,474 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:12:19,474 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:12:19,474 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:12:19,484 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:12:19" (1/1) ... [2019-12-27 20:12:19,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:12:19" (1/1) ... [2019-12-27 20:12:19,490 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:12:19" (1/1) ... [2019-12-27 20:12:19,491 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:12:19" (1/1) ... [2019-12-27 20:12:19,502 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:12:19" (1/1) ... [2019-12-27 20:12:19,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:12:19" (1/1) ... [2019-12-27 20:12:19,511 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:12:19" (1/1) ... [2019-12-27 20:12:19,517 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:12:19,518 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:12:19,518 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:12:19,518 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:12:19,519 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:12:19" (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 20:12:19,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:12:19,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:12:19,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:12:19,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:12:19,608 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:12:19,609 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:12:19,610 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:12:19,610 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:12:19,610 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 20:12:19,610 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 20:12:19,610 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:12:19,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:12:19,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:12:19,621 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 20:12:20,403 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:12:20,403 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:12:20,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:12:20 BoogieIcfgContainer [2019-12-27 20:12:20,405 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:12:20,407 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:12:20,408 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:12:20,413 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:12:20,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:12:18" (1/3) ... [2019-12-27 20:12:20,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39b761a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:12:20, skipping insertion in model container [2019-12-27 20:12:20,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:12:19" (2/3) ... [2019-12-27 20:12:20,415 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39b761a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:12:20, skipping insertion in model container [2019-12-27 20:12:20,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:12:20" (3/3) ... [2019-12-27 20:12:20,420 INFO L109 eAbstractionObserver]: Analyzing ICFG mix016_tso.opt.i [2019-12-27 20:12:20,431 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:12:20,431 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:12:20,443 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:12:20,445 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:12:20,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,535 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,536 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,541 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,541 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,576 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,576 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,582 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,582 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,582 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,619 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,620 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,625 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,626 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,626 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,627 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,628 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,629 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,633 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,633 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,636 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,638 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,639 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,640 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,640 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:12:20,656 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 20:12:20,678 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:12:20,678 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:12:20,678 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:12:20,678 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:12:20,678 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:12:20,678 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:12:20,678 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:12:20,678 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:12:20,694 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 195 places, 241 transitions [2019-12-27 20:12:20,696 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 195 places, 241 transitions [2019-12-27 20:12:20,835 INFO L132 PetriNetUnfolder]: 56/238 cut-off events. [2019-12-27 20:12:20,835 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:12:20,856 INFO L76 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 238 events. 56/238 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 563 event pairs. 0/180 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-27 20:12:20,886 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 195 places, 241 transitions [2019-12-27 20:12:20,988 INFO L132 PetriNetUnfolder]: 56/238 cut-off events. [2019-12-27 20:12:20,988 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:12:21,001 INFO L76 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 238 events. 56/238 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 563 event pairs. 0/180 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-27 20:12:21,038 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-27 20:12:21,039 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:12:24,132 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2019-12-27 20:12:24,831 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 20:12:24,953 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 20:12:24,988 INFO L206 etLargeBlockEncoding]: Checked pairs total: 150396 [2019-12-27 20:12:24,989 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-27 20:12:24,992 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 113 places, 135 transitions [2019-12-27 20:12:29,460 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 51230 states. [2019-12-27 20:12:29,462 INFO L276 IsEmpty]: Start isEmpty. Operand 51230 states. [2019-12-27 20:12:29,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 20:12:29,469 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:29,470 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:12:29,470 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 20:12:29,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:29,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1919545255, now seen corresponding path program 1 times [2019-12-27 20:12:29,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:29,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121213006] [2019-12-27 20:12:29,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:29,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:29,831 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 20:12:29,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121213006] [2019-12-27 20:12:29,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:29,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:12:29,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [818436127] [2019-12-27 20:12:29,837 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:29,843 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:29,859 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 20:12:29,860 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:29,864 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:12:29,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:12:29,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:29,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:12:29,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:12:29,883 INFO L87 Difference]: Start difference. First operand 51230 states. Second operand 3 states. [2019-12-27 20:12:30,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:30,752 INFO L93 Difference]: Finished difference Result 50670 states and 205792 transitions. [2019-12-27 20:12:30,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:12:30,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 20:12:30,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:31,131 INFO L225 Difference]: With dead ends: 50670 [2019-12-27 20:12:31,132 INFO L226 Difference]: Without dead ends: 47174 [2019-12-27 20:12:31,141 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 20:12:33,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47174 states. [2019-12-27 20:12:34,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47174 to 47174. [2019-12-27 20:12:34,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47174 states. [2019-12-27 20:12:36,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47174 states to 47174 states and 191464 transitions. [2019-12-27 20:12:36,834 INFO L78 Accepts]: Start accepts. Automaton has 47174 states and 191464 transitions. Word has length 7 [2019-12-27 20:12:36,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:36,835 INFO L462 AbstractCegarLoop]: Abstraction has 47174 states and 191464 transitions. [2019-12-27 20:12:36,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:12:36,835 INFO L276 IsEmpty]: Start isEmpty. Operand 47174 states and 191464 transitions. [2019-12-27 20:12:36,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 20:12:36,848 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:36,849 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:12:36,849 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 20:12:36,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:36,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1688254996, now seen corresponding path program 1 times [2019-12-27 20:12:36,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:36,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617772314] [2019-12-27 20:12:36,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:36,988 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 20:12:36,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617772314] [2019-12-27 20:12:36,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:36,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:12:36,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [739546008] [2019-12-27 20:12:36,991 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:36,992 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:36,999 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 20:12:36,999 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:37,000 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:12:37,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:12:37,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:37,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:12:37,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:12:37,002 INFO L87 Difference]: Start difference. First operand 47174 states and 191464 transitions. Second operand 4 states. [2019-12-27 20:12:37,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:37,911 INFO L93 Difference]: Finished difference Result 74790 states and 291766 transitions. [2019-12-27 20:12:37,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:12:37,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 20:12:37,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:38,457 INFO L225 Difference]: With dead ends: 74790 [2019-12-27 20:12:38,457 INFO L226 Difference]: Without dead ends: 74754 [2019-12-27 20:12:38,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:12:39,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74754 states. [2019-12-27 20:12:44,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74754 to 72654. [2019-12-27 20:12:44,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72654 states. [2019-12-27 20:12:44,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72654 states to 72654 states and 285192 transitions. [2019-12-27 20:12:44,366 INFO L78 Accepts]: Start accepts. Automaton has 72654 states and 285192 transitions. Word has length 13 [2019-12-27 20:12:44,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:44,366 INFO L462 AbstractCegarLoop]: Abstraction has 72654 states and 285192 transitions. [2019-12-27 20:12:44,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:12:44,367 INFO L276 IsEmpty]: Start isEmpty. Operand 72654 states and 285192 transitions. [2019-12-27 20:12:44,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:12:44,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:44,372 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:12:44,372 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 20:12:44,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:44,372 INFO L82 PathProgramCache]: Analyzing trace with hash -955457127, now seen corresponding path program 1 times [2019-12-27 20:12:44,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:44,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782534706] [2019-12-27 20:12:44,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:44,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:44,465 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 20:12:44,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782534706] [2019-12-27 20:12:44,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:44,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:12:44,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1117183553] [2019-12-27 20:12:44,468 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:44,470 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:44,474 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 20:12:44,474 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:44,550 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:12:44,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:12:44,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:44,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:12:44,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:12:44,552 INFO L87 Difference]: Start difference. First operand 72654 states and 285192 transitions. Second operand 5 states. [2019-12-27 20:12:45,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:45,815 INFO L93 Difference]: Finished difference Result 91098 states and 353264 transitions. [2019-12-27 20:12:45,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:12:45,816 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 20:12:45,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:46,105 INFO L225 Difference]: With dead ends: 91098 [2019-12-27 20:12:46,105 INFO L226 Difference]: Without dead ends: 91070 [2019-12-27 20:12:46,106 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 20:12:46,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91070 states. [2019-12-27 20:12:51,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91070 to 82226. [2019-12-27 20:12:51,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82226 states. [2019-12-27 20:12:51,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82226 states to 82226 states and 321384 transitions. [2019-12-27 20:12:51,395 INFO L78 Accepts]: Start accepts. Automaton has 82226 states and 321384 transitions. Word has length 16 [2019-12-27 20:12:51,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:12:51,395 INFO L462 AbstractCegarLoop]: Abstraction has 82226 states and 321384 transitions. [2019-12-27 20:12:51,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:12:51,395 INFO L276 IsEmpty]: Start isEmpty. Operand 82226 states and 321384 transitions. [2019-12-27 20:12:51,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 20:12:51,404 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:12:51,404 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:12:51,404 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 20:12:51,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:12:51,405 INFO L82 PathProgramCache]: Analyzing trace with hash 445629712, now seen corresponding path program 1 times [2019-12-27 20:12:51,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:12:51,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652834683] [2019-12-27 20:12:51,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:12:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:12:51,493 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 20:12:51,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652834683] [2019-12-27 20:12:51,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:12:51,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:12:51,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [306149207] [2019-12-27 20:12:51,494 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:12:51,497 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:12:51,501 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 57 transitions. [2019-12-27 20:12:51,501 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:12:51,529 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:12:51,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:12:51,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:12:51,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:12:51,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:12:51,531 INFO L87 Difference]: Start difference. First operand 82226 states and 321384 transitions. Second operand 5 states. [2019-12-27 20:12:55,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:12:55,713 INFO L93 Difference]: Finished difference Result 136104 states and 511737 transitions. [2019-12-27 20:12:55,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:12:55,715 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 20:12:55,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:12:56,084 INFO L225 Difference]: With dead ends: 136104 [2019-12-27 20:12:56,084 INFO L226 Difference]: Without dead ends: 136104 [2019-12-27 20:12:56,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:12:57,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136104 states. [2019-12-27 20:12:59,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136104 to 120690. [2019-12-27 20:12:59,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120690 states. [2019-12-27 20:13:00,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120690 states to 120690 states and 460184 transitions. [2019-12-27 20:13:00,406 INFO L78 Accepts]: Start accepts. Automaton has 120690 states and 460184 transitions. Word has length 17 [2019-12-27 20:13:00,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:13:00,406 INFO L462 AbstractCegarLoop]: Abstraction has 120690 states and 460184 transitions. [2019-12-27 20:13:00,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:13:00,409 INFO L276 IsEmpty]: Start isEmpty. Operand 120690 states and 460184 transitions. [2019-12-27 20:13:00,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 20:13:00,419 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:13:00,419 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:13:00,420 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 20:13:00,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:13:00,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1411633095, now seen corresponding path program 1 times [2019-12-27 20:13:00,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:13:00,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635329956] [2019-12-27 20:13:00,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:13:00,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:13:00,468 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 20:13:00,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635329956] [2019-12-27 20:13:00,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:13:00,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:13:00,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1345586730] [2019-12-27 20:13:00,470 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:13:00,473 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:13:00,475 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 20 transitions. [2019-12-27 20:13:00,475 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:13:00,475 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:13:00,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:13:00,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:13:00,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:13:00,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:13:00,476 INFO L87 Difference]: Start difference. First operand 120690 states and 460184 transitions. Second operand 3 states. [2019-12-27 20:13:01,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:13:01,016 INFO L93 Difference]: Finished difference Result 113712 states and 433065 transitions. [2019-12-27 20:13:01,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:13:01,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 20:13:01,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:13:01,320 INFO L225 Difference]: With dead ends: 113712 [2019-12-27 20:13:01,320 INFO L226 Difference]: Without dead ends: 113042 [2019-12-27 20:13:01,320 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 20:13:03,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113042 states. [2019-12-27 20:13:08,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113042 to 113042. [2019-12-27 20:13:08,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113042 states. [2019-12-27 20:13:09,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113042 states to 113042 states and 430688 transitions. [2019-12-27 20:13:09,819 INFO L78 Accepts]: Start accepts. Automaton has 113042 states and 430688 transitions. Word has length 18 [2019-12-27 20:13:09,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:13:09,819 INFO L462 AbstractCegarLoop]: Abstraction has 113042 states and 430688 transitions. [2019-12-27 20:13:09,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:13:09,820 INFO L276 IsEmpty]: Start isEmpty. Operand 113042 states and 430688 transitions. [2019-12-27 20:13:09,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 20:13:09,835 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:13:09,835 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:13:09,835 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 20:13:09,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:13:09,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1103080662, now seen corresponding path program 1 times [2019-12-27 20:13:09,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:13:09,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9350878] [2019-12-27 20:13:09,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:13:09,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:13:09,933 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 20:13:09,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9350878] [2019-12-27 20:13:09,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:13:09,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:13:09,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [919291856] [2019-12-27 20:13:09,934 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:13:09,937 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:13:09,944 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 44 states and 67 transitions. [2019-12-27 20:13:09,944 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:13:09,975 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:13:09,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:13:09,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:13:09,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:13:09,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:13:09,977 INFO L87 Difference]: Start difference. First operand 113042 states and 430688 transitions. Second operand 5 states. [2019-12-27 20:13:10,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:13:10,975 INFO L93 Difference]: Finished difference Result 137854 states and 518994 transitions. [2019-12-27 20:13:10,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:13:10,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 20:13:10,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:13:11,352 INFO L225 Difference]: With dead ends: 137854 [2019-12-27 20:13:11,352 INFO L226 Difference]: Without dead ends: 137820 [2019-12-27 20:13:11,353 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 20:13:16,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137820 states. [2019-12-27 20:13:18,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137820 to 114370. [2019-12-27 20:13:18,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114370 states. [2019-12-27 20:13:19,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114370 states to 114370 states and 435718 transitions. [2019-12-27 20:13:19,438 INFO L78 Accepts]: Start accepts. Automaton has 114370 states and 435718 transitions. Word has length 19 [2019-12-27 20:13:19,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:13:19,438 INFO L462 AbstractCegarLoop]: Abstraction has 114370 states and 435718 transitions. [2019-12-27 20:13:19,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:13:19,438 INFO L276 IsEmpty]: Start isEmpty. Operand 114370 states and 435718 transitions. [2019-12-27 20:13:19,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 20:13:19,459 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:13:19,459 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:13:19,459 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 20:13:19,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:13:19,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1142959004, now seen corresponding path program 1 times [2019-12-27 20:13:19,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:13:19,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019451044] [2019-12-27 20:13:19,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:13:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:13:19,579 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 20:13:19,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019451044] [2019-12-27 20:13:19,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:13:19,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:13:19,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [557653094] [2019-12-27 20:13:19,580 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:13:19,584 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:13:19,595 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 100 transitions. [2019-12-27 20:13:19,595 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:13:19,613 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:13:19,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:13:19,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:13:19,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:13:19,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:13:19,615 INFO L87 Difference]: Start difference. First operand 114370 states and 435718 transitions. Second operand 6 states. [2019-12-27 20:13:23,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:13:23,624 INFO L93 Difference]: Finished difference Result 344994 states and 1287036 transitions. [2019-12-27 20:13:23,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 20:13:23,624 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 20:13:23,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:13:24,650 INFO L225 Difference]: With dead ends: 344994 [2019-12-27 20:13:24,650 INFO L226 Difference]: Without dead ends: 344912 [2019-12-27 20:13:24,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:13:33,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344912 states. [2019-12-27 20:13:36,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344912 to 123650. [2019-12-27 20:13:36,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123650 states. [2019-12-27 20:13:37,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123650 states to 123650 states and 469268 transitions. [2019-12-27 20:13:37,494 INFO L78 Accepts]: Start accepts. Automaton has 123650 states and 469268 transitions. Word has length 22 [2019-12-27 20:13:37,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:13:37,494 INFO L462 AbstractCegarLoop]: Abstraction has 123650 states and 469268 transitions. [2019-12-27 20:13:37,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:13:37,494 INFO L276 IsEmpty]: Start isEmpty. Operand 123650 states and 469268 transitions. [2019-12-27 20:13:37,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 20:13:37,541 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:13:37,541 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:13:37,541 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 20:13:37,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:13:37,541 INFO L82 PathProgramCache]: Analyzing trace with hash -746160441, now seen corresponding path program 1 times [2019-12-27 20:13:37,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:13:37,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394369765] [2019-12-27 20:13:37,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:13:37,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:13:37,625 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 20:13:37,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394369765] [2019-12-27 20:13:37,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:13:37,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:13:37,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1862040963] [2019-12-27 20:13:37,631 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:13:37,634 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:13:37,643 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 65 transitions. [2019-12-27 20:13:37,643 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:13:37,673 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:13:37,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:13:37,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:13:37,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:13:37,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:13:37,674 INFO L87 Difference]: Start difference. First operand 123650 states and 469268 transitions. Second operand 5 states. [2019-12-27 20:13:38,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:13:38,682 INFO L93 Difference]: Finished difference Result 102737 states and 337952 transitions. [2019-12-27 20:13:38,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:13:38,682 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 20:13:38,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:13:38,888 INFO L225 Difference]: With dead ends: 102737 [2019-12-27 20:13:38,888 INFO L226 Difference]: Without dead ends: 90701 [2019-12-27 20:13:38,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:13:39,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90701 states. [2019-12-27 20:13:41,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90701 to 77617. [2019-12-27 20:13:41,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77617 states. [2019-12-27 20:13:41,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77617 states to 77617 states and 257421 transitions. [2019-12-27 20:13:41,669 INFO L78 Accepts]: Start accepts. Automaton has 77617 states and 257421 transitions. Word has length 25 [2019-12-27 20:13:41,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:13:41,669 INFO L462 AbstractCegarLoop]: Abstraction has 77617 states and 257421 transitions. [2019-12-27 20:13:41,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:13:41,670 INFO L276 IsEmpty]: Start isEmpty. Operand 77617 states and 257421 transitions. [2019-12-27 20:13:41,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 20:13:41,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:13:41,699 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:13:41,699 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 20:13:41,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:13:41,700 INFO L82 PathProgramCache]: Analyzing trace with hash 800773514, now seen corresponding path program 1 times [2019-12-27 20:13:41,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:13:41,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733269995] [2019-12-27 20:13:41,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:13:41,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:13:41,795 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 20:13:41,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733269995] [2019-12-27 20:13:41,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:13:41,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:13:41,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2012886703] [2019-12-27 20:13:41,797 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:13:41,803 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:13:41,813 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 51 states and 74 transitions. [2019-12-27 20:13:41,813 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:13:41,836 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:13:41,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:13:41,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:13:41,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:13:41,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:13:41,838 INFO L87 Difference]: Start difference. First operand 77617 states and 257421 transitions. Second operand 6 states. [2019-12-27 20:13:42,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:13:42,540 INFO L93 Difference]: Finished difference Result 21731 states and 62202 transitions. [2019-12-27 20:13:42,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 20:13:42,540 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-27 20:13:42,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:13:42,572 INFO L225 Difference]: With dead ends: 21731 [2019-12-27 20:13:42,573 INFO L226 Difference]: Without dead ends: 15382 [2019-12-27 20:13:42,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:13:42,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15382 states. [2019-12-27 20:13:43,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15382 to 13198. [2019-12-27 20:13:43,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13198 states. [2019-12-27 20:13:43,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13198 states to 13198 states and 35939 transitions. [2019-12-27 20:13:43,963 INFO L78 Accepts]: Start accepts. Automaton has 13198 states and 35939 transitions. Word has length 26 [2019-12-27 20:13:43,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:13:43,963 INFO L462 AbstractCegarLoop]: Abstraction has 13198 states and 35939 transitions. [2019-12-27 20:13:43,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:13:43,964 INFO L276 IsEmpty]: Start isEmpty. Operand 13198 states and 35939 transitions. [2019-12-27 20:13:43,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 20:13:43,976 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:13:43,976 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:13:43,976 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 20:13:43,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:13:43,977 INFO L82 PathProgramCache]: Analyzing trace with hash 595173251, now seen corresponding path program 1 times [2019-12-27 20:13:43,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:13:43,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401815864] [2019-12-27 20:13:43,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:13:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:13:44,014 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 20:13:44,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401815864] [2019-12-27 20:13:44,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:13:44,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:13:44,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1653268646] [2019-12-27 20:13:44,015 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:13:44,021 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:13:44,042 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 79 states and 122 transitions. [2019-12-27 20:13:44,042 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:13:44,071 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:13:44,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:13:44,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:13:44,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:13:44,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:13:44,072 INFO L87 Difference]: Start difference. First operand 13198 states and 35939 transitions. Second operand 5 states. [2019-12-27 20:13:44,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:13:44,213 INFO L93 Difference]: Finished difference Result 14205 states and 36524 transitions. [2019-12-27 20:13:44,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:13:44,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-27 20:13:44,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:13:44,231 INFO L225 Difference]: With dead ends: 14205 [2019-12-27 20:13:44,231 INFO L226 Difference]: Without dead ends: 14205 [2019-12-27 20:13:44,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:13:44,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14205 states. [2019-12-27 20:13:44,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14205 to 13411. [2019-12-27 20:13:44,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13411 states. [2019-12-27 20:13:44,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13411 states to 13411 states and 34707 transitions. [2019-12-27 20:13:44,403 INFO L78 Accepts]: Start accepts. Automaton has 13411 states and 34707 transitions. Word has length 34 [2019-12-27 20:13:44,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:13:44,404 INFO L462 AbstractCegarLoop]: Abstraction has 13411 states and 34707 transitions. [2019-12-27 20:13:44,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:13:44,404 INFO L276 IsEmpty]: Start isEmpty. Operand 13411 states and 34707 transitions. [2019-12-27 20:13:44,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 20:13:44,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:13:44,414 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:13:44,414 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 20:13:44,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:13:44,414 INFO L82 PathProgramCache]: Analyzing trace with hash 2128004174, now seen corresponding path program 1 times [2019-12-27 20:13:44,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:13:44,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659523303] [2019-12-27 20:13:44,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:13:44,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:13:44,497 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 20:13:44,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659523303] [2019-12-27 20:13:44,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:13:44,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:13:44,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1830336204] [2019-12-27 20:13:44,498 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:13:44,505 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:13:44,531 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 137 transitions. [2019-12-27 20:13:44,531 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:13:44,558 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:13:44,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:13:44,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:13:44,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:13:44,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:13:44,559 INFO L87 Difference]: Start difference. First operand 13411 states and 34707 transitions. Second operand 7 states. [2019-12-27 20:13:44,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:13:44,687 INFO L93 Difference]: Finished difference Result 10789 states and 28875 transitions. [2019-12-27 20:13:44,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:13:44,687 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-12-27 20:13:44,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:13:44,706 INFO L225 Difference]: With dead ends: 10789 [2019-12-27 20:13:44,706 INFO L226 Difference]: Without dead ends: 10487 [2019-12-27 20:13:44,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:13:44,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10487 states. [2019-12-27 20:13:44,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10487 to 9061. [2019-12-27 20:13:44,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9061 states. [2019-12-27 20:13:44,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9061 states to 9061 states and 24790 transitions. [2019-12-27 20:13:44,869 INFO L78 Accepts]: Start accepts. Automaton has 9061 states and 24790 transitions. Word has length 37 [2019-12-27 20:13:44,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:13:44,869 INFO L462 AbstractCegarLoop]: Abstraction has 9061 states and 24790 transitions. [2019-12-27 20:13:44,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:13:44,869 INFO L276 IsEmpty]: Start isEmpty. Operand 9061 states and 24790 transitions. [2019-12-27 20:13:44,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-27 20:13:44,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:13:44,881 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:13:44,881 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 20:13:44,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:13:44,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1727195497, now seen corresponding path program 1 times [2019-12-27 20:13:44,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:13:44,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241932662] [2019-12-27 20:13:44,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:13:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:13:45,001 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 20:13:45,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241932662] [2019-12-27 20:13:45,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:13:45,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:13:45,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1428812409] [2019-12-27 20:13:45,003 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:13:45,021 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:13:45,074 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 98 states and 131 transitions. [2019-12-27 20:13:45,074 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:13:45,075 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:13:45,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:13:45,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:13:45,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:13:45,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:13:45,076 INFO L87 Difference]: Start difference. First operand 9061 states and 24790 transitions. Second operand 4 states. [2019-12-27 20:13:45,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:13:45,114 INFO L93 Difference]: Finished difference Result 10324 states and 27460 transitions. [2019-12-27 20:13:45,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:13:45,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-12-27 20:13:45,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:13:45,123 INFO L225 Difference]: With dead ends: 10324 [2019-12-27 20:13:45,123 INFO L226 Difference]: Without dead ends: 5789 [2019-12-27 20:13:45,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:13:45,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5789 states. [2019-12-27 20:13:45,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5789 to 5789. [2019-12-27 20:13:45,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5789 states. [2019-12-27 20:13:45,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5789 states to 5789 states and 14049 transitions. [2019-12-27 20:13:45,189 INFO L78 Accepts]: Start accepts. Automaton has 5789 states and 14049 transitions. Word has length 61 [2019-12-27 20:13:45,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:13:45,189 INFO L462 AbstractCegarLoop]: Abstraction has 5789 states and 14049 transitions. [2019-12-27 20:13:45,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:13:45,189 INFO L276 IsEmpty]: Start isEmpty. Operand 5789 states and 14049 transitions. [2019-12-27 20:13:45,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-27 20:13:45,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:13:45,195 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:13:45,195 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:13:45,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:13:45,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1561359919, now seen corresponding path program 2 times [2019-12-27 20:13:45,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:13:45,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290891613] [2019-12-27 20:13:45,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:13:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:13:45,304 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 20:13:45,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290891613] [2019-12-27 20:13:45,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:13:45,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:13:45,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2141470922] [2019-12-27 20:13:45,305 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:13:45,328 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:13:45,434 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 110 states and 155 transitions. [2019-12-27 20:13:45,435 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:13:46,706 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 20:13:46,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 20:13:46,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:13:46,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 20:13:46,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:13:46,709 INFO L87 Difference]: Start difference. First operand 5789 states and 14049 transitions. Second operand 11 states. [2019-12-27 20:13:49,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:13:49,370 INFO L93 Difference]: Finished difference Result 18062 states and 43910 transitions. [2019-12-27 20:13:49,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 20:13:49,370 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2019-12-27 20:13:49,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:13:49,390 INFO L225 Difference]: With dead ends: 18062 [2019-12-27 20:13:49,390 INFO L226 Difference]: Without dead ends: 15484 [2019-12-27 20:13:49,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=360, Invalid=1710, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 20:13:49,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15484 states. [2019-12-27 20:13:49,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15484 to 8042. [2019-12-27 20:13:49,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8042 states. [2019-12-27 20:13:49,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8042 states to 8042 states and 19548 transitions. [2019-12-27 20:13:49,534 INFO L78 Accepts]: Start accepts. Automaton has 8042 states and 19548 transitions. Word has length 61 [2019-12-27 20:13:49,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:13:49,534 INFO L462 AbstractCegarLoop]: Abstraction has 8042 states and 19548 transitions. [2019-12-27 20:13:49,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 20:13:49,535 INFO L276 IsEmpty]: Start isEmpty. Operand 8042 states and 19548 transitions. [2019-12-27 20:13:49,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-27 20:13:49,542 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:13:49,542 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:13:49,542 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:13:49,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:13:49,543 INFO L82 PathProgramCache]: Analyzing trace with hash -73216147, now seen corresponding path program 3 times [2019-12-27 20:13:49,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:13:49,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385690466] [2019-12-27 20:13:49,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:13:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:13:49,613 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 20:13:49,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385690466] [2019-12-27 20:13:49,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:13:49,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:13:49,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [220379467] [2019-12-27 20:13:49,614 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:13:49,632 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:13:49,736 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 107 states and 150 transitions. [2019-12-27 20:13:49,737 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:13:49,772 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 20:13:49,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:13:49,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:13:49,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:13:49,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:13:49,773 INFO L87 Difference]: Start difference. First operand 8042 states and 19548 transitions. Second operand 6 states. [2019-12-27 20:13:49,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:13:49,886 INFO L93 Difference]: Finished difference Result 8781 states and 21111 transitions. [2019-12-27 20:13:49,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:13:49,887 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-12-27 20:13:49,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:13:49,888 INFO L225 Difference]: With dead ends: 8781 [2019-12-27 20:13:49,888 INFO L226 Difference]: Without dead ends: 830 [2019-12-27 20:13:49,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:13:49,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2019-12-27 20:13:49,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 808. [2019-12-27 20:13:49,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2019-12-27 20:13:49,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1638 transitions. [2019-12-27 20:13:49,897 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1638 transitions. Word has length 61 [2019-12-27 20:13:49,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:13:49,897 INFO L462 AbstractCegarLoop]: Abstraction has 808 states and 1638 transitions. [2019-12-27 20:13:49,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:13:49,897 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1638 transitions. [2019-12-27 20:13:49,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-27 20:13:49,898 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:13:49,898 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:13:49,898 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:13:49,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:13:49,898 INFO L82 PathProgramCache]: Analyzing trace with hash 911720613, now seen corresponding path program 4 times [2019-12-27 20:13:49,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:13:49,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783316561] [2019-12-27 20:13:49,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:13:49,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:13:49,978 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 20:13:49,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783316561] [2019-12-27 20:13:49,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:13:49,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:13:49,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [739491030] [2019-12-27 20:13:49,980 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:13:50,016 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:13:50,120 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 122 states and 168 transitions. [2019-12-27 20:13:50,120 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:13:50,121 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:13:50,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:13:50,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:13:50,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:13:50,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:13:50,122 INFO L87 Difference]: Start difference. First operand 808 states and 1638 transitions. Second operand 5 states. [2019-12-27 20:13:50,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:13:50,183 INFO L93 Difference]: Finished difference Result 1603 states and 3262 transitions. [2019-12-27 20:13:50,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:13:50,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-12-27 20:13:50,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:13:50,184 INFO L225 Difference]: With dead ends: 1603 [2019-12-27 20:13:50,185 INFO L226 Difference]: Without dead ends: 807 [2019-12-27 20:13:50,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:13:50,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2019-12-27 20:13:50,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 807. [2019-12-27 20:13:50,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2019-12-27 20:13:50,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1636 transitions. [2019-12-27 20:13:50,196 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1636 transitions. Word has length 61 [2019-12-27 20:13:50,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:13:50,196 INFO L462 AbstractCegarLoop]: Abstraction has 807 states and 1636 transitions. [2019-12-27 20:13:50,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:13:50,197 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1636 transitions. [2019-12-27 20:13:50,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 20:13:50,198 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:13:50,198 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:13:50,198 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:13:50,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:13:50,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1206977644, now seen corresponding path program 1 times [2019-12-27 20:13:50,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:13:50,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979589425] [2019-12-27 20:13:50,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:13:50,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:13:50,357 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 20:13:50,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979589425] [2019-12-27 20:13:50,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:13:50,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 20:13:50,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [191579878] [2019-12-27 20:13:50,358 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:13:50,395 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:13:50,490 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 123 states and 169 transitions. [2019-12-27 20:13:50,490 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:13:50,687 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 27 times. [2019-12-27 20:13:50,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 20:13:50,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:13:50,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 20:13:50,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-27 20:13:50,688 INFO L87 Difference]: Start difference. First operand 807 states and 1636 transitions. Second operand 15 states. [2019-12-27 20:13:51,997 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-12-27 20:13:52,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:13:52,417 INFO L93 Difference]: Finished difference Result 1542 states and 2967 transitions. [2019-12-27 20:13:52,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 20:13:52,418 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2019-12-27 20:13:52,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:13:52,421 INFO L225 Difference]: With dead ends: 1542 [2019-12-27 20:13:52,421 INFO L226 Difference]: Without dead ends: 1542 [2019-12-27 20:13:52,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=192, Invalid=678, Unknown=0, NotChecked=0, Total=870 [2019-12-27 20:13:52,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2019-12-27 20:13:52,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1148. [2019-12-27 20:13:52,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1148 states. [2019-12-27 20:13:52,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 2278 transitions. [2019-12-27 20:13:52,436 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 2278 transitions. Word has length 62 [2019-12-27 20:13:52,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:13:52,437 INFO L462 AbstractCegarLoop]: Abstraction has 1148 states and 2278 transitions. [2019-12-27 20:13:52,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 20:13:52,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 2278 transitions. [2019-12-27 20:13:52,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 20:13:52,438 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:13:52,438 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:13:52,438 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:13:52,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:13:52,438 INFO L82 PathProgramCache]: Analyzing trace with hash -494214102, now seen corresponding path program 2 times [2019-12-27 20:13:52,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:13:52,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751386739] [2019-12-27 20:13:52,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:13:52,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:13:52,522 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 20:13:52,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751386739] [2019-12-27 20:13:52,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:13:52,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:13:52,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1567660486] [2019-12-27 20:13:52,523 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:13:52,540 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:13:52,645 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 121 states and 173 transitions. [2019-12-27 20:13:52,645 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:13:52,722 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 20:13:52,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:13:52,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:13:52,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:13:52,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:13:52,723 INFO L87 Difference]: Start difference. First operand 1148 states and 2278 transitions. Second operand 7 states. [2019-12-27 20:13:53,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:13:53,470 INFO L93 Difference]: Finished difference Result 1817 states and 3545 transitions. [2019-12-27 20:13:53,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 20:13:53,470 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-12-27 20:13:53,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:13:53,473 INFO L225 Difference]: With dead ends: 1817 [2019-12-27 20:13:53,473 INFO L226 Difference]: Without dead ends: 1817 [2019-12-27 20:13:53,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:13:53,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2019-12-27 20:13:53,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 1210. [2019-12-27 20:13:53,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2019-12-27 20:13:53,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 2404 transitions. [2019-12-27 20:13:53,493 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 2404 transitions. Word has length 62 [2019-12-27 20:13:53,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:13:53,494 INFO L462 AbstractCegarLoop]: Abstraction has 1210 states and 2404 transitions. [2019-12-27 20:13:53,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:13:53,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 2404 transitions. [2019-12-27 20:13:53,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 20:13:53,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:13:53,496 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:13:53,496 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:13:53,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:13:53,496 INFO L82 PathProgramCache]: Analyzing trace with hash -934916524, now seen corresponding path program 3 times [2019-12-27 20:13:53,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:13:53,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804319133] [2019-12-27 20:13:53,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:13:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:13:53,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:13:53,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804319133] [2019-12-27 20:13:53,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:13:53,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:13:53,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [164825017] [2019-12-27 20:13:53,559 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:13:53,575 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:13:53,634 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 107 transitions. [2019-12-27 20:13:53,635 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:13:53,635 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:13:53,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:13:53,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:13:53,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:13:53,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:13:53,636 INFO L87 Difference]: Start difference. First operand 1210 states and 2404 transitions. Second operand 3 states. [2019-12-27 20:13:53,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:13:53,648 INFO L93 Difference]: Finished difference Result 1210 states and 2403 transitions. [2019-12-27 20:13:53,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:13:53,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-12-27 20:13:53,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:13:53,651 INFO L225 Difference]: With dead ends: 1210 [2019-12-27 20:13:53,651 INFO L226 Difference]: Without dead ends: 1210 [2019-12-27 20:13:53,651 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 20:13:53,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2019-12-27 20:13:53,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1056. [2019-12-27 20:13:53,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1056 states. [2019-12-27 20:13:53,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 2118 transitions. [2019-12-27 20:13:53,661 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 2118 transitions. Word has length 62 [2019-12-27 20:13:53,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:13:53,662 INFO L462 AbstractCegarLoop]: Abstraction has 1056 states and 2118 transitions. [2019-12-27 20:13:53,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:13:53,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 2118 transitions. [2019-12-27 20:13:53,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 20:13:53,663 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:13:53,663 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:13:53,663 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:13:53,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:13:53,663 INFO L82 PathProgramCache]: Analyzing trace with hash 997776254, now seen corresponding path program 1 times [2019-12-27 20:13:53,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:13:53,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874371877] [2019-12-27 20:13:53,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:13:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:13:53,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:13:53,779 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:13:53,779 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:13:53,784 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1017] [1017] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= v_~y$r_buff0_thd2~0_52 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t430~0.base_26|) 0) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~weak$$choice0~0_9) (= 0 v_~y$read_delayed_var~0.offset_8) (= 0 v_~__unbuffered_p1_EAX~0_15) (= |v_#NULL.offset_7| 0) (= v_~__unbuffered_p2_EBX~0_14 0) (= v_~y$read_delayed~0_8 0) (= v_~z~0_10 0) (= v_~y$r_buff0_thd1~0_9 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~weak$$choice2~0_34) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t430~0.base_26| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t430~0.base_26|) |v_ULTIMATE.start_main_~#t430~0.offset_19| 0))) (= 0 v_~y$r_buff1_thd1~0_10) (= 0 |v_ULTIMATE.start_main_~#t430~0.offset_19|) (= 0 v_~y$w_buff1~0_31) (= 0 v_~y$r_buff1_thd0~0_25) (= v_~y$r_buff0_thd0~0_22 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t430~0.base_26| 4)) (= v_~y$r_buff0_thd3~0_76 0) (= 0 v_~y$r_buff1_thd2~0_28) (= 0 v_~y$w_buff0~0_37) (= 0 v_~y$r_buff1_thd3~0_38) (= (store .cse0 |v_ULTIMATE.start_main_~#t430~0.base_26| 1) |v_#valid_64|) (= 0 |v_#NULL.base_7|) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t430~0.base_26|) (= v_~y$mem_tmp~0_12 0) (= 0 v_~__unbuffered_p0_EAX~0_16) (= 0 v_~__unbuffered_cnt~0_22) (= 0 v_~y$read_delayed_var~0.base_8) (= v_~y$w_buff1_used~0_64 0) (= 0 v_~__unbuffered_p2_EAX~0_14) (= v_~x~0_12 0) (= 0 v_~y$flush_delayed~0_17) (= v_~y~0_31 0) (= v_~y$w_buff0_used~0_129 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_6|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, #NULL.offset=|v_#NULL.offset_7|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ULTIMATE.start_main_~#t432~0.base=|v_ULTIMATE.start_main_~#t432~0.base_17|, ~y$mem_tmp~0=v_~y$mem_tmp~0_12, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_38, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_9, ~y$flush_delayed~0=v_~y$flush_delayed~0_17, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_14, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_14, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_11|, ULTIMATE.start_main_~#t430~0.offset=|v_ULTIMATE.start_main_~#t430~0.offset_19|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_21|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_9|, ~y$w_buff1~0=v_~y$w_buff1~0_31, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_52, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_25, ~x~0=v_~x~0_12, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_129, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_7|, ULTIMATE.start_main_~#t431~0.base=|v_ULTIMATE.start_main_~#t431~0.base_22|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_10, ~y$w_buff0~0=v_~y$w_buff0~0_37, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_76, ULTIMATE.start_main_~#t431~0.offset=|v_ULTIMATE.start_main_~#t431~0.offset_17|, ~y~0=v_~y~0_31, ULTIMATE.start_main_~#t430~0.base=|v_ULTIMATE.start_main_~#t430~0.base_26|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_12|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_9|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_28, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_9|, ULTIMATE.start_main_~#t432~0.offset=|v_ULTIMATE.start_main_~#t432~0.offset_14|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_22, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_10, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_64} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, #NULL.offset, ~y$read_delayed~0, ULTIMATE.start_main_~#t432~0.base, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_~#t430~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ULTIMATE.start_main_~#t431~0.base, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t431~0.offset, ~y~0, ULTIMATE.start_main_~#t430~0.base, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t432~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 20:13:53,785 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L830-1-->L832: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t431~0.offset_10|) (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t431~0.base_11|) 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t431~0.base_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t431~0.base_11| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t431~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t431~0.base_11|) |v_ULTIMATE.start_main_~#t431~0.offset_10| 1)) |v_#memory_int_13|) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t431~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t431~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t431~0.base=|v_ULTIMATE.start_main_~#t431~0.base_11|, ULTIMATE.start_main_~#t431~0.offset=|v_ULTIMATE.start_main_~#t431~0.offset_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t431~0.base, ULTIMATE.start_main_~#t431~0.offset, #length] because there is no mapped edge [2019-12-27 20:13:53,786 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L832-1-->L834: Formula: (and (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t432~0.base_13| 4) |v_#length_15|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t432~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t432~0.base_13|) |v_ULTIMATE.start_main_~#t432~0.offset_11| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t432~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t432~0.offset_11|) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t432~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t432~0.base_13| 0)) (= (select |v_#valid_38| |v_ULTIMATE.start_main_~#t432~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t432~0.base=|v_ULTIMATE.start_main_~#t432~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t432~0.offset=|v_ULTIMATE.start_main_~#t432~0.offset_11|, #valid=|v_#valid_37|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t432~0.base, ULTIMATE.start_main_~#t432~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-12-27 20:13:53,787 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] P2ENTRY-->L4-3: Formula: (and (= 1 v_~y$w_buff0_used~0_97) (= 1 v_~y$w_buff0~0_20) (= (mod v_~y$w_buff1_used~0_55 256) 0) (= v_~y$w_buff0~0_21 v_~y$w_buff1~0_21) (= v_~y$w_buff1_used~0_55 v_~y$w_buff0_used~0_98) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5| v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_7) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff0~0=v_~y$w_buff0~0_21, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_21, ~y$w_buff0~0=v_~y$w_buff0~0_20, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_7, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_55} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 20:13:53,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L792-2-->L792-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-604268924 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-604268924 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out-604268924| ~y$w_buff0~0_In-604268924)) (and (= |P2Thread1of1ForFork0_#t~ite28_Out-604268924| ~y$w_buff1~0_In-604268924) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-604268924, ~y$w_buff1~0=~y$w_buff1~0_In-604268924, ~y$w_buff0~0=~y$w_buff0~0_In-604268924, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-604268924} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-604268924|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-604268924, ~y$w_buff1~0=~y$w_buff1~0_In-604268924, ~y$w_buff0~0=~y$w_buff0~0_In-604268924, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-604268924} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 20:13:53,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L792-4-->L793: Formula: (= v_~y~0_20 |v_P2Thread1of1ForFork0_#t~ite28_8|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_8|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_7|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_7|, ~y~0=v_~y~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-27 20:13:53,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [888] [888] L797-->L798: Formula: (and (= v_~y$r_buff0_thd3~0_55 v_~y$r_buff0_thd3~0_54) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_55, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_9|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_54, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_9|, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 20:13:53,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1574353526 256)))) (or (and (not .cse0) (= ~y$mem_tmp~0_In-1574353526 |P2Thread1of1ForFork0_#t~ite48_Out-1574353526|)) (and (= ~y~0_In-1574353526 |P2Thread1of1ForFork0_#t~ite48_Out-1574353526|) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1574353526, ~y$flush_delayed~0=~y$flush_delayed~0_In-1574353526, ~y~0=~y~0_In-1574353526} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-1574353526|, ~y$mem_tmp~0=~y$mem_tmp~0_In-1574353526, ~y$flush_delayed~0=~y$flush_delayed~0_In-1574353526, ~y~0=~y~0_In-1574353526} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-27 20:13:53,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~__unbuffered_p0_EAX~0_6 v_~x~0_6) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 1 v_~z~0_7) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_6} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z~0=v_~z~0_7, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_6, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 20:13:53,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L763-->L763-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1793725605 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork2_#t~ite25_Out1793725605| ~y~0_In1793725605)) (and (= |P1Thread1of1ForFork2_#t~ite25_Out1793725605| ~y$mem_tmp~0_In1793725605) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1793725605, ~y$flush_delayed~0=~y$flush_delayed~0_In1793725605, ~y~0=~y~0_In1793725605} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1793725605, ~y$flush_delayed~0=~y$flush_delayed~0_In1793725605, ~y~0=~y~0_In1793725605, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out1793725605|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 20:13:53,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L763-2-->P1EXIT: Formula: (and (= 0 v_~y$flush_delayed~0_12) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite25_8| v_~y~0_25) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~y~0=v_~y~0_25, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 20:13:53,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-862443248 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-862443248 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out-862443248|)) (and (= ~y$w_buff0_used~0_In-862443248 |P2Thread1of1ForFork0_#t~ite51_Out-862443248|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-862443248, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-862443248} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-862443248, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-862443248, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out-862443248|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-27 20:13:53,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [949] [949] L809-->L809-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd3~0_In2090301539 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In2090301539 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In2090301539 256))) (.cse0 (= (mod ~y$r_buff1_thd3~0_In2090301539 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite52_Out2090301539| 0)) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite52_Out2090301539| ~y$w_buff1_used~0_In2090301539) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2090301539, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2090301539, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2090301539, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2090301539} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2090301539, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2090301539, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2090301539, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out2090301539|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2090301539} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-27 20:13:53,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L810-->L811: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1592202520 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1592202520 256)))) (or (and (= ~y$r_buff0_thd3~0_Out1592202520 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd3~0_Out1592202520 ~y$r_buff0_thd3~0_In1592202520)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1592202520, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1592202520} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1592202520, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1592202520, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out1592202520|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-27 20:13:53,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L811-->L811-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In-1062915730 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1062915730 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1062915730 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1062915730 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite54_Out-1062915730| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork0_#t~ite54_Out-1062915730| ~y$r_buff1_thd3~0_In-1062915730) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1062915730, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1062915730, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1062915730, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1062915730} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1062915730, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1062915730, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out-1062915730|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1062915730, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1062915730} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-27 20:13:53,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17) (= v_~y$r_buff1_thd3~0_31 |v_P2Thread1of1ForFork0_#t~ite54_8|)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_31, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 20:13:53,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [920] [920] L838-->L840-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_103 256) 0) (= (mod v_~y$r_buff0_thd0~0_17 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 20:13:53,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L840-2-->L840-5: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-260990428 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-260990428 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite58_Out-260990428| |ULTIMATE.start_main_#t~ite59_Out-260990428|))) (or (and (= ~y~0_In-260990428 |ULTIMATE.start_main_#t~ite58_Out-260990428|) .cse0 (or .cse1 .cse2)) (and (not .cse1) (not .cse2) .cse0 (= |ULTIMATE.start_main_#t~ite58_Out-260990428| ~y$w_buff1~0_In-260990428)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-260990428, ~y~0=~y~0_In-260990428, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-260990428, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-260990428} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-260990428, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-260990428|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-260990428|, ~y~0=~y~0_In-260990428, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-260990428, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-260990428} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-27 20:13:53,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L841-->L841-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1993619794 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1993619794 256)))) (or (and (= |ULTIMATE.start_main_#t~ite60_Out-1993619794| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1993619794 |ULTIMATE.start_main_#t~ite60_Out-1993619794|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1993619794, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1993619794} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1993619794|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1993619794, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1993619794} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-27 20:13:53,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [967] [967] L842-->L842-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-2080168545 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-2080168545 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-2080168545 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-2080168545 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out-2080168545| ~y$w_buff1_used~0_In-2080168545) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite61_Out-2080168545| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2080168545, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2080168545, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2080168545, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2080168545} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-2080168545|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2080168545, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2080168545, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2080168545, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2080168545} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-27 20:13:53,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L843-->L843-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1774477924 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1774477924 256)))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out1774477924| ~y$r_buff0_thd0~0_In1774477924) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite62_Out1774477924| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1774477924, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1774477924} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1774477924|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1774477924, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1774477924} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-27 20:13:53,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L844-->L844-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In299515908 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In299515908 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In299515908 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In299515908 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite63_Out299515908|)) (and (or .cse1 .cse0) (= ~y$r_buff1_thd0~0_In299515908 |ULTIMATE.start_main_#t~ite63_Out299515908|) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In299515908, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In299515908, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In299515908, ~y$w_buff1_used~0=~y$w_buff1_used~0_In299515908} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out299515908|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In299515908, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In299515908, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In299515908, ~y$w_buff1_used~0=~y$w_buff1_used~0_In299515908} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-27 20:13:53,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= v_~__unbuffered_p0_EAX~0_9 0) (= v_~main$tmp_guard1~0_8 0) (= 0 v_~__unbuffered_p1_EAX~0_8) (= v_~__unbuffered_p2_EAX~0_7 1) (= v_~__unbuffered_p2_EBX~0_7 0) (= |v_ULTIMATE.start_main_#t~ite63_11| v_~y$r_buff1_thd0~0_17)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_11|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_17, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:13:53,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:13:53 BasicIcfg [2019-12-27 20:13:53,935 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:13:53,937 INFO L168 Benchmark]: Toolchain (without parser) took 95323.80 ms. Allocated memory was 145.8 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 101.0 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-27 20:13:53,938 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 145.8 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 20:13:53,938 INFO L168 Benchmark]: CACSL2BoogieTranslator took 788.56 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 100.6 MB in the beginning and 156.9 MB in the end (delta: -56.3 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2019-12-27 20:13:53,940 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.56 ms. Allocated memory is still 203.9 MB. Free memory was 156.3 MB in the beginning and 153.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 20:13:53,943 INFO L168 Benchmark]: Boogie Preprocessor took 43.59 ms. Allocated memory is still 203.9 MB. Free memory was 153.7 MB in the beginning and 151.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:13:53,944 INFO L168 Benchmark]: RCFGBuilder took 887.22 ms. Allocated memory is still 203.9 MB. Free memory was 151.0 MB in the beginning and 95.7 MB in the end (delta: 55.3 MB). Peak memory consumption was 55.3 MB. Max. memory is 7.1 GB. [2019-12-27 20:13:53,944 INFO L168 Benchmark]: TraceAbstraction took 93527.56 ms. Allocated memory was 203.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 95.7 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 949.3 MB. Max. memory is 7.1 GB. [2019-12-27 20:13:53,952 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 145.8 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 788.56 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 100.6 MB in the beginning and 156.9 MB in the end (delta: -56.3 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.56 ms. Allocated memory is still 203.9 MB. Free memory was 156.3 MB in the beginning and 153.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.59 ms. Allocated memory is still 203.9 MB. Free memory was 153.7 MB in the beginning and 151.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 887.22 ms. Allocated memory is still 203.9 MB. Free memory was 151.0 MB in the beginning and 95.7 MB in the end (delta: 55.3 MB). Peak memory consumption was 55.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 93527.56 ms. Allocated memory was 203.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 95.7 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 949.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 195 ProgramPointsBefore, 113 ProgramPointsAfterwards, 241 TransitionsBefore, 135 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 28 ChoiceCompositions, 9157 VarBasedMoverChecksPositive, 238 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 150396 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t430, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L832] FCALL, FORK 0 pthread_create(&t431, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t432, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 [L788] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L789] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L790] 3 y$flush_delayed = weak$$choice2 [L791] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L793] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L793] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L794] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L794] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L795] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L796] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L800] 3 y = y$flush_delayed ? y$mem_tmp : y [L801] 3 y$flush_delayed = (_Bool)0 [L804] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L748] 2 x = 1 [L751] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 2 y$flush_delayed = weak$$choice2 [L754] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L756] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L757] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L758] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L760] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L761] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L808] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L809] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=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] [L840] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L841] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L842] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L843] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 186 locations, 2 error locations. Result: UNSAFE, OverallTime: 93.1s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 23.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4110 SDtfs, 6984 SDslu, 9280 SDs, 0 SdLazy, 5437 SolverSat, 475 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 227 GetRequests, 70 SyntacticMatches, 10 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123650occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 55.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 297177 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 727 NumberOfCodeBlocks, 727 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 646 ConstructedInterpolants, 0 QuantifiedInterpolants, 99465 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...