/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix018_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:39:13,406 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:39:13,409 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:39:13,421 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:39:13,421 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:39:13,422 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:39:13,423 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:39:13,425 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:39:13,427 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:39:13,428 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:39:13,429 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:39:13,430 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:39:13,430 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:39:13,431 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:39:13,432 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:39:13,433 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:39:13,434 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:39:13,435 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:39:13,437 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:39:13,439 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:39:13,441 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:39:13,442 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:39:13,443 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:39:13,444 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:39:13,447 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:39:13,447 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:39:13,447 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:39:13,448 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:39:13,449 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:39:13,450 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:39:13,450 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:39:13,451 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:39:13,452 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:39:13,452 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:39:13,453 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:39:13,454 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:39:13,454 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:39:13,455 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:39:13,455 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:39:13,456 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:39:13,456 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:39:13,457 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:39:13,472 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:39:13,472 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:39:13,474 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:39:13,474 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:39:13,474 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:39:13,474 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:39:13,474 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:39:13,475 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:39:13,475 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:39:13,475 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:39:13,475 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:39:13,475 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:39:13,476 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:39:13,476 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:39:13,476 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:39:13,476 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:39:13,476 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:39:13,477 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:39:13,477 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:39:13,477 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:39:13,477 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:39:13,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:39:13,478 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:39:13,478 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:39:13,478 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:39:13,478 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:39:13,478 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:39:13,479 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:39:13,479 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:39:13,479 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:39:13,737 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:39:13,746 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:39:13,752 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:39:13,754 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:39:13,754 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:39:13,755 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix018_pso.opt.i [2019-12-18 12:39:13,833 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70d1de699/a3e2699f33f4413c83499200c4de7899/FLAGd4ac5d8ac [2019-12-18 12:39:14,369 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:39:14,373 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix018_pso.opt.i [2019-12-18 12:39:14,400 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70d1de699/a3e2699f33f4413c83499200c4de7899/FLAGd4ac5d8ac [2019-12-18 12:39:14,668 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70d1de699/a3e2699f33f4413c83499200c4de7899 [2019-12-18 12:39:14,677 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:39:14,679 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:39:14,682 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:39:14,682 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:39:14,689 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:39:14,690 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:39:14" (1/1) ... [2019-12-18 12:39:14,692 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@127092cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:39:14, skipping insertion in model container [2019-12-18 12:39:14,693 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:39:14" (1/1) ... [2019-12-18 12:39:14,700 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:39:14,746 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:39:15,325 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:39:15,337 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:39:15,414 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:39:15,486 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:39:15,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:39:15 WrapperNode [2019-12-18 12:39:15,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:39:15,488 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:39:15,488 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:39:15,488 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:39:15,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:39:15" (1/1) ... [2019-12-18 12:39:15,520 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:39:15" (1/1) ... [2019-12-18 12:39:15,561 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:39:15,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:39:15,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:39:15,562 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:39:15,572 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:39:15" (1/1) ... [2019-12-18 12:39:15,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:39:15" (1/1) ... [2019-12-18 12:39:15,578 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:39:15" (1/1) ... [2019-12-18 12:39:15,578 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:39:15" (1/1) ... [2019-12-18 12:39:15,598 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:39:15" (1/1) ... [2019-12-18 12:39:15,603 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:39:15" (1/1) ... [2019-12-18 12:39:15,607 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:39:15" (1/1) ... [2019-12-18 12:39:15,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:39:15,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:39:15,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:39:15,630 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:39:15,632 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:39:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:39:15,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:39:15,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:39:15,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:39:15,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:39:15,702 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:39:15,703 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:39:15,703 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:39:15,704 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:39:15,704 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:39:15,705 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:39:15,706 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 12:39:15,706 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 12:39:15,707 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:39:15,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:39:15,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:39:15,709 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 12:39:16,661 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:39:16,661 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:39:16,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:39:16 BoogieIcfgContainer [2019-12-18 12:39:16,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:39:16,664 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:39:16,664 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:39:16,668 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:39:16,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:39:14" (1/3) ... [2019-12-18 12:39:16,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3521d4ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:39:16, skipping insertion in model container [2019-12-18 12:39:16,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:39:15" (2/3) ... [2019-12-18 12:39:16,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3521d4ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:39:16, skipping insertion in model container [2019-12-18 12:39:16,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:39:16" (3/3) ... [2019-12-18 12:39:16,671 INFO L109 eAbstractionObserver]: Analyzing ICFG mix018_pso.opt.i [2019-12-18 12:39:16,682 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:39:16,682 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:39:16,690 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:39:16,691 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:39:16,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,770 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,771 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,773 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,773 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,775 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,775 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,795 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,796 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,796 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,796 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,796 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,796 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,797 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,797 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,797 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,797 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,797 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,798 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,798 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,798 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,798 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,798 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,799 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,799 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,799 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,799 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,799 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,800 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,800 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,800 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,800 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,800 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,801 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,801 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,801 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,801 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,801 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,802 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,802 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,802 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,802 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,802 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,803 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,803 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,803 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,803 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,803 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,804 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,804 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,804 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,804 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,804 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,804 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,805 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,805 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,805 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,805 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,805 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,806 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,806 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,806 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,806 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,806 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,806 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,807 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,807 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,807 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,807 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,807 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,808 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,808 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,808 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,808 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,808 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,809 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,809 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,809 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,809 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,809 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,809 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,810 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,810 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,810 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,810 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,810 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,811 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,811 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,811 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,811 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,811 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,811 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,812 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,812 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,812 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,812 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,812 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,813 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,813 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,813 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,813 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,813 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,813 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,814 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,814 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,814 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,814 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,814 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,815 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,815 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,815 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,815 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,815 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,816 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,816 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,816 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,816 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,816 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,816 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,817 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,817 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,817 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,817 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,817 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,818 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,818 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,818 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,818 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,818 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,822 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,822 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,827 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,828 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,832 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,833 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,833 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,833 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,833 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,833 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,834 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,834 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,834 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,834 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,834 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,835 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,835 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,835 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,835 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,835 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,835 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,836 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,836 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,836 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,836 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,836 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,836 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,837 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,837 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,837 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,837 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,837 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,838 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,838 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,838 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,838 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,838 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,838 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,839 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,841 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,842 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:39:16,856 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 12:39:16,875 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:39:16,875 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:39:16,875 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:39:16,875 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:39:16,875 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:39:16,876 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:39:16,876 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:39:16,876 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:39:16,892 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 254 transitions [2019-12-18 12:39:16,894 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 211 places, 254 transitions [2019-12-18 12:39:16,997 INFO L126 PetriNetUnfolder]: 56/250 cut-off events. [2019-12-18 12:39:16,998 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:39:17,020 INFO L76 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 250 events. 56/250 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 574 event pairs. 12/204 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-18 12:39:17,057 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 211 places, 254 transitions [2019-12-18 12:39:17,142 INFO L126 PetriNetUnfolder]: 56/250 cut-off events. [2019-12-18 12:39:17,142 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:39:17,156 INFO L76 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 250 events. 56/250 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 574 event pairs. 12/204 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-18 12:39:17,194 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-18 12:39:17,195 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:39:24,140 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-18 12:39:24,287 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-18 12:39:24,315 INFO L206 etLargeBlockEncoding]: Checked pairs total: 142340 [2019-12-18 12:39:24,316 INFO L214 etLargeBlockEncoding]: Total number of compositions: 134 [2019-12-18 12:39:24,319 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 131 transitions [2019-12-18 12:39:34,159 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 90046 states. [2019-12-18 12:39:34,161 INFO L276 IsEmpty]: Start isEmpty. Operand 90046 states. [2019-12-18 12:39:34,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 12:39:34,168 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:39:34,169 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:39:34,169 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:39:34,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:39:34,177 INFO L82 PathProgramCache]: Analyzing trace with hash 259811849, now seen corresponding path program 1 times [2019-12-18 12:39:34,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:39:34,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072496764] [2019-12-18 12:39:34,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:39:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:39:34,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:39:34,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072496764] [2019-12-18 12:39:34,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:39:34,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:39:34,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596686027] [2019-12-18 12:39:34,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:39:34,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:39:34,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:39:34,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:39:34,469 INFO L87 Difference]: Start difference. First operand 90046 states. Second operand 3 states. [2019-12-18 12:39:37,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:39:37,709 INFO L93 Difference]: Finished difference Result 89182 states and 411616 transitions. [2019-12-18 12:39:37,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:39:37,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 12:39:37,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:39:38,469 INFO L225 Difference]: With dead ends: 89182 [2019-12-18 12:39:38,469 INFO L226 Difference]: Without dead ends: 83470 [2019-12-18 12:39:38,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:39:40,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83470 states. [2019-12-18 12:39:42,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83470 to 83470. [2019-12-18 12:39:42,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83470 states. [2019-12-18 12:39:46,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83470 states to 83470 states and 385016 transitions. [2019-12-18 12:39:46,452 INFO L78 Accepts]: Start accepts. Automaton has 83470 states and 385016 transitions. Word has length 9 [2019-12-18 12:39:46,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:39:46,453 INFO L462 AbstractCegarLoop]: Abstraction has 83470 states and 385016 transitions. [2019-12-18 12:39:46,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:39:46,453 INFO L276 IsEmpty]: Start isEmpty. Operand 83470 states and 385016 transitions. [2019-12-18 12:39:46,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 12:39:46,464 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:39:46,464 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:39:46,464 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:39:46,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:39:46,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1558204525, now seen corresponding path program 1 times [2019-12-18 12:39:46,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:39:46,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602523243] [2019-12-18 12:39:46,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:39:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:39:46,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:39:46,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602523243] [2019-12-18 12:39:46,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:39:46,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:39:46,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311283011] [2019-12-18 12:39:46,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:39:46,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:39:46,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:39:46,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:39:46,616 INFO L87 Difference]: Start difference. First operand 83470 states and 385016 transitions. Second operand 4 states. [2019-12-18 12:39:51,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:39:51,760 INFO L93 Difference]: Finished difference Result 129310 states and 576248 transitions. [2019-12-18 12:39:51,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:39:51,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 12:39:51,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:39:52,352 INFO L225 Difference]: With dead ends: 129310 [2019-12-18 12:39:52,353 INFO L226 Difference]: Without dead ends: 129254 [2019-12-18 12:39:52,354 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-18 12:39:54,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129254 states. [2019-12-18 12:39:57,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129254 to 124642. [2019-12-18 12:39:57,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124642 states. [2019-12-18 12:39:57,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124642 states to 124642 states and 558856 transitions. [2019-12-18 12:39:57,939 INFO L78 Accepts]: Start accepts. Automaton has 124642 states and 558856 transitions. Word has length 15 [2019-12-18 12:39:57,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:39:57,939 INFO L462 AbstractCegarLoop]: Abstraction has 124642 states and 558856 transitions. [2019-12-18 12:39:57,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:39:57,939 INFO L276 IsEmpty]: Start isEmpty. Operand 124642 states and 558856 transitions. [2019-12-18 12:39:57,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 12:39:57,948 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:39:57,948 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-18 12:39:57,948 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:39:57,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:39:57,948 INFO L82 PathProgramCache]: Analyzing trace with hash -545556496, now seen corresponding path program 1 times [2019-12-18 12:39:57,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:39:57,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880892682] [2019-12-18 12:39:57,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:39:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:39:58,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:39:58,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880892682] [2019-12-18 12:39:58,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:39:58,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:39:58,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904347508] [2019-12-18 12:39:58,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:39:58,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:39:58,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:39:58,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:39:58,065 INFO L87 Difference]: Start difference. First operand 124642 states and 558856 transitions. Second operand 4 states. [2019-12-18 12:40:03,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:40:03,597 INFO L93 Difference]: Finished difference Result 158782 states and 702836 transitions. [2019-12-18 12:40:03,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:40:03,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-18 12:40:03,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:40:04,109 INFO L225 Difference]: With dead ends: 158782 [2019-12-18 12:40:04,109 INFO L226 Difference]: Without dead ends: 158730 [2019-12-18 12:40:04,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:40:06,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158730 states. [2019-12-18 12:40:13,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158730 to 142378. [2019-12-18 12:40:13,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142378 states. [2019-12-18 12:40:14,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142378 states to 142378 states and 635380 transitions. [2019-12-18 12:40:14,243 INFO L78 Accepts]: Start accepts. Automaton has 142378 states and 635380 transitions. Word has length 18 [2019-12-18 12:40:14,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:40:14,243 INFO L462 AbstractCegarLoop]: Abstraction has 142378 states and 635380 transitions. [2019-12-18 12:40:14,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:40:14,244 INFO L276 IsEmpty]: Start isEmpty. Operand 142378 states and 635380 transitions. [2019-12-18 12:40:14,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 12:40:14,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:40:14,258 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-18 12:40:14,258 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:40:14,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:40:14,258 INFO L82 PathProgramCache]: Analyzing trace with hash 267646308, now seen corresponding path program 1 times [2019-12-18 12:40:14,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:40:14,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85252720] [2019-12-18 12:40:14,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:40:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:40:14,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:40:14,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85252720] [2019-12-18 12:40:14,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:40:14,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:40:14,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696480778] [2019-12-18 12:40:14,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:40:14,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:40:14,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:40:14,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:40:14,325 INFO L87 Difference]: Start difference. First operand 142378 states and 635380 transitions. Second operand 3 states. [2019-12-18 12:40:21,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:40:21,434 INFO L93 Difference]: Finished difference Result 243978 states and 1046540 transitions. [2019-12-18 12:40:21,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:40:21,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-18 12:40:21,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:40:22,332 INFO L225 Difference]: With dead ends: 243978 [2019-12-18 12:40:22,333 INFO L226 Difference]: Without dead ends: 243978 [2019-12-18 12:40:22,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:40:25,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243978 states. [2019-12-18 12:40:29,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243978 to 220082. [2019-12-18 12:40:29,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220082 states. [2019-12-18 12:40:31,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220082 states to 220082 states and 955428 transitions. [2019-12-18 12:40:31,473 INFO L78 Accepts]: Start accepts. Automaton has 220082 states and 955428 transitions. Word has length 19 [2019-12-18 12:40:31,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:40:31,473 INFO L462 AbstractCegarLoop]: Abstraction has 220082 states and 955428 transitions. [2019-12-18 12:40:31,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:40:31,473 INFO L276 IsEmpty]: Start isEmpty. Operand 220082 states and 955428 transitions. [2019-12-18 12:40:31,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 12:40:31,493 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:40:31,493 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] [2019-12-18 12:40:31,494 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:40:31,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:40:31,494 INFO L82 PathProgramCache]: Analyzing trace with hash -993922956, now seen corresponding path program 1 times [2019-12-18 12:40:31,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:40:31,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465400013] [2019-12-18 12:40:31,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:40:31,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:40:31,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:40:31,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465400013] [2019-12-18 12:40:31,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:40:31,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:40:31,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596603193] [2019-12-18 12:40:31,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:40:31,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:40:31,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:40:31,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:40:31,568 INFO L87 Difference]: Start difference. First operand 220082 states and 955428 transitions. Second operand 3 states. [2019-12-18 12:40:40,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:40:40,178 INFO L93 Difference]: Finished difference Result 215765 states and 932330 transitions. [2019-12-18 12:40:40,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:40:40,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-18 12:40:40,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:40:40,965 INFO L225 Difference]: With dead ends: 215765 [2019-12-18 12:40:40,965 INFO L226 Difference]: Without dead ends: 215765 [2019-12-18 12:40:40,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:40:43,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215765 states. [2019-12-18 12:40:52,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215765 to 215765. [2019-12-18 12:40:52,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215765 states. [2019-12-18 12:40:54,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215765 states to 215765 states and 932330 transitions. [2019-12-18 12:40:54,165 INFO L78 Accepts]: Start accepts. Automaton has 215765 states and 932330 transitions. Word has length 20 [2019-12-18 12:40:54,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:40:54,165 INFO L462 AbstractCegarLoop]: Abstraction has 215765 states and 932330 transitions. [2019-12-18 12:40:54,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:40:54,165 INFO L276 IsEmpty]: Start isEmpty. Operand 215765 states and 932330 transitions. [2019-12-18 12:40:54,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 12:40:54,183 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:40:54,183 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] [2019-12-18 12:40:54,184 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:40:54,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:40:54,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1767153122, now seen corresponding path program 1 times [2019-12-18 12:40:54,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:40:54,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018841673] [2019-12-18 12:40:54,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:40:54,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:40:54,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:40:54,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018841673] [2019-12-18 12:40:54,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:40:54,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:40:54,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793245913] [2019-12-18 12:40:54,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:40:54,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:40:54,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:40:54,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:40:54,290 INFO L87 Difference]: Start difference. First operand 215765 states and 932330 transitions. Second operand 3 states. [2019-12-18 12:41:02,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:41:02,385 INFO L93 Difference]: Finished difference Result 266467 states and 1093068 transitions. [2019-12-18 12:41:02,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:41:02,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-18 12:41:02,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:41:03,088 INFO L225 Difference]: With dead ends: 266467 [2019-12-18 12:41:03,088 INFO L226 Difference]: Without dead ends: 216713 [2019-12-18 12:41:03,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:41:05,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216713 states. [2019-12-18 12:41:14,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216713 to 212335. [2019-12-18 12:41:14,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212335 states. [2019-12-18 12:41:15,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212335 states to 212335 states and 866006 transitions. [2019-12-18 12:41:15,644 INFO L78 Accepts]: Start accepts. Automaton has 212335 states and 866006 transitions. Word has length 21 [2019-12-18 12:41:15,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:41:15,645 INFO L462 AbstractCegarLoop]: Abstraction has 212335 states and 866006 transitions. [2019-12-18 12:41:15,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:41:15,645 INFO L276 IsEmpty]: Start isEmpty. Operand 212335 states and 866006 transitions. [2019-12-18 12:41:15,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 12:41:15,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:41:15,662 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] [2019-12-18 12:41:15,662 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:41:15,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:41:15,663 INFO L82 PathProgramCache]: Analyzing trace with hash 82789233, now seen corresponding path program 1 times [2019-12-18 12:41:15,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:41:15,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780534287] [2019-12-18 12:41:15,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:41:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:41:15,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:41:15,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780534287] [2019-12-18 12:41:15,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:41:15,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:41:15,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390828069] [2019-12-18 12:41:15,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:41:15,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:41:15,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:41:15,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:41:15,717 INFO L87 Difference]: Start difference. First operand 212335 states and 866006 transitions. Second operand 3 states. [2019-12-18 12:41:22,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:41:22,938 INFO L93 Difference]: Finished difference Result 206309 states and 842405 transitions. [2019-12-18 12:41:22,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:41:22,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-18 12:41:22,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:41:23,550 INFO L225 Difference]: With dead ends: 206309 [2019-12-18 12:41:23,551 INFO L226 Difference]: Without dead ends: 206309 [2019-12-18 12:41:23,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:41:26,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206309 states. [2019-12-18 12:41:29,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206309 to 206027. [2019-12-18 12:41:29,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206027 states. [2019-12-18 12:41:31,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206027 states to 206027 states and 841755 transitions. [2019-12-18 12:41:31,567 INFO L78 Accepts]: Start accepts. Automaton has 206027 states and 841755 transitions. Word has length 21 [2019-12-18 12:41:31,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:41:31,567 INFO L462 AbstractCegarLoop]: Abstraction has 206027 states and 841755 transitions. [2019-12-18 12:41:31,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:41:31,567 INFO L276 IsEmpty]: Start isEmpty. Operand 206027 states and 841755 transitions. [2019-12-18 12:41:31,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 12:41:31,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:41:31,585 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] [2019-12-18 12:41:31,585 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:41:31,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:41:31,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1950965462, now seen corresponding path program 1 times [2019-12-18 12:41:31,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:41:31,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633688328] [2019-12-18 12:41:31,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:41:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:41:31,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:41:31,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633688328] [2019-12-18 12:41:31,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:41:31,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:41:31,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744180169] [2019-12-18 12:41:31,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:41:31,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:41:31,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:41:31,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:41:31,654 INFO L87 Difference]: Start difference. First operand 206027 states and 841755 transitions. Second operand 4 states. [2019-12-18 12:41:40,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:41:40,295 INFO L93 Difference]: Finished difference Result 256255 states and 1033046 transitions. [2019-12-18 12:41:40,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:41:40,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-18 12:41:40,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:41:41,192 INFO L225 Difference]: With dead ends: 256255 [2019-12-18 12:41:41,193 INFO L226 Difference]: Without dead ends: 256068 [2019-12-18 12:41:41,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:41:44,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256068 states. [2019-12-18 12:41:47,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256068 to 209050. [2019-12-18 12:41:47,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209050 states. [2019-12-18 12:41:49,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209050 states to 209050 states and 853590 transitions. [2019-12-18 12:41:49,381 INFO L78 Accepts]: Start accepts. Automaton has 209050 states and 853590 transitions. Word has length 21 [2019-12-18 12:41:49,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:41:49,381 INFO L462 AbstractCegarLoop]: Abstraction has 209050 states and 853590 transitions. [2019-12-18 12:41:49,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:41:49,382 INFO L276 IsEmpty]: Start isEmpty. Operand 209050 states and 853590 transitions. [2019-12-18 12:41:49,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 12:41:49,423 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:41:49,423 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] [2019-12-18 12:41:49,424 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:41:49,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:41:49,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1910405908, now seen corresponding path program 1 times [2019-12-18 12:41:49,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:41:49,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177320216] [2019-12-18 12:41:49,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:41:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:41:49,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:41:49,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177320216] [2019-12-18 12:41:49,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:41:49,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:41:49,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874266834] [2019-12-18 12:41:49,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:41:49,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:41:49,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:41:49,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:41:49,502 INFO L87 Difference]: Start difference. First operand 209050 states and 853590 transitions. Second operand 4 states. [2019-12-18 12:41:50,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:41:50,338 INFO L93 Difference]: Finished difference Result 176375 states and 647214 transitions. [2019-12-18 12:41:50,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:41:50,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-12-18 12:41:50,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:41:57,628 INFO L225 Difference]: With dead ends: 176375 [2019-12-18 12:41:57,628 INFO L226 Difference]: Without dead ends: 162889 [2019-12-18 12:41:57,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:41:59,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162889 states. [2019-12-18 12:42:01,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162889 to 162889. [2019-12-18 12:42:01,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162889 states. [2019-12-18 12:42:02,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162889 states to 162889 states and 601984 transitions. [2019-12-18 12:42:02,203 INFO L78 Accepts]: Start accepts. Automaton has 162889 states and 601984 transitions. Word has length 24 [2019-12-18 12:42:02,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:42:02,204 INFO L462 AbstractCegarLoop]: Abstraction has 162889 states and 601984 transitions. [2019-12-18 12:42:02,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:42:02,204 INFO L276 IsEmpty]: Start isEmpty. Operand 162889 states and 601984 transitions. [2019-12-18 12:42:02,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:42:02,236 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:42:02,237 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-18 12:42:02,237 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:42:02,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:42:02,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1761806270, now seen corresponding path program 1 times [2019-12-18 12:42:02,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:42:02,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656883634] [2019-12-18 12:42:02,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:42:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:42:02,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:42:02,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656883634] [2019-12-18 12:42:02,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:42:02,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:42:02,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115755828] [2019-12-18 12:42:02,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:42:02,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:42:02,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:42:02,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:42:02,313 INFO L87 Difference]: Start difference. First operand 162889 states and 601984 transitions. Second operand 5 states. [2019-12-18 12:42:02,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:42:02,925 INFO L93 Difference]: Finished difference Result 77791 states and 257802 transitions. [2019-12-18 12:42:02,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:42:02,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 12:42:02,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:42:03,166 INFO L225 Difference]: With dead ends: 77791 [2019-12-18 12:42:03,166 INFO L226 Difference]: Without dead ends: 67453 [2019-12-18 12:42:03,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:42:04,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67453 states. [2019-12-18 12:42:05,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67453 to 67453. [2019-12-18 12:42:05,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67453 states. [2019-12-18 12:42:05,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67453 states to 67453 states and 223227 transitions. [2019-12-18 12:42:05,827 INFO L78 Accepts]: Start accepts. Automaton has 67453 states and 223227 transitions. Word has length 25 [2019-12-18 12:42:05,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:42:05,828 INFO L462 AbstractCegarLoop]: Abstraction has 67453 states and 223227 transitions. [2019-12-18 12:42:05,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:42:05,828 INFO L276 IsEmpty]: Start isEmpty. Operand 67453 states and 223227 transitions. [2019-12-18 12:42:05,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 12:42:05,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:42:05,840 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-18 12:42:05,840 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:42:05,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:42:05,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1382879271, now seen corresponding path program 1 times [2019-12-18 12:42:05,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:42:05,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108039892] [2019-12-18 12:42:05,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:42:05,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:42:05,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:42:05,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108039892] [2019-12-18 12:42:05,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:42:05,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:42:05,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452757067] [2019-12-18 12:42:05,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:42:05,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:42:05,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:42:05,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:42:05,926 INFO L87 Difference]: Start difference. First operand 67453 states and 223227 transitions. Second operand 5 states. [2019-12-18 12:42:09,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:42:09,304 INFO L93 Difference]: Finished difference Result 93531 states and 301676 transitions. [2019-12-18 12:42:09,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:42:09,304 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 12:42:09,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:42:09,469 INFO L225 Difference]: With dead ends: 93531 [2019-12-18 12:42:09,469 INFO L226 Difference]: Without dead ends: 93320 [2019-12-18 12:42:09,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:42:10,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93320 states. [2019-12-18 12:42:11,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93320 to 75562. [2019-12-18 12:42:11,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75562 states. [2019-12-18 12:42:11,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75562 states to 75562 states and 248171 transitions. [2019-12-18 12:42:11,429 INFO L78 Accepts]: Start accepts. Automaton has 75562 states and 248171 transitions. Word has length 26 [2019-12-18 12:42:11,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:42:11,429 INFO L462 AbstractCegarLoop]: Abstraction has 75562 states and 248171 transitions. [2019-12-18 12:42:11,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:42:11,429 INFO L276 IsEmpty]: Start isEmpty. Operand 75562 states and 248171 transitions. [2019-12-18 12:42:11,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 12:42:11,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:42:11,452 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:42:11,452 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:42:11,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:42:11,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1458765979, now seen corresponding path program 1 times [2019-12-18 12:42:11,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:42:11,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464195118] [2019-12-18 12:42:11,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:42:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:42:11,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:42:11,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464195118] [2019-12-18 12:42:11,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:42:11,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:42:11,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527845414] [2019-12-18 12:42:11,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:42:11,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:42:11,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:42:11,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:42:11,539 INFO L87 Difference]: Start difference. First operand 75562 states and 248171 transitions. Second operand 6 states. [2019-12-18 12:42:11,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:42:11,727 INFO L93 Difference]: Finished difference Result 23926 states and 72250 transitions. [2019-12-18 12:42:11,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:42:11,727 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-18 12:42:11,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:42:11,767 INFO L225 Difference]: With dead ends: 23926 [2019-12-18 12:42:11,767 INFO L226 Difference]: Without dead ends: 19276 [2019-12-18 12:42:11,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:42:11,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19276 states. [2019-12-18 12:42:12,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19276 to 18349. [2019-12-18 12:42:12,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18349 states. [2019-12-18 12:42:12,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18349 states to 18349 states and 55342 transitions. [2019-12-18 12:42:12,048 INFO L78 Accepts]: Start accepts. Automaton has 18349 states and 55342 transitions. Word has length 29 [2019-12-18 12:42:12,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:42:12,048 INFO L462 AbstractCegarLoop]: Abstraction has 18349 states and 55342 transitions. [2019-12-18 12:42:12,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:42:12,049 INFO L276 IsEmpty]: Start isEmpty. Operand 18349 states and 55342 transitions. [2019-12-18 12:42:12,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 12:42:12,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:42:12,062 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-18 12:42:12,062 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:42:12,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:42:12,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1466756281, now seen corresponding path program 1 times [2019-12-18 12:42:12,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:42:12,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640862603] [2019-12-18 12:42:12,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:42:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:42:12,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:42:12,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640862603] [2019-12-18 12:42:12,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:42:12,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:42:12,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970983990] [2019-12-18 12:42:12,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:42:12,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:42:12,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:42:12,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:42:12,109 INFO L87 Difference]: Start difference. First operand 18349 states and 55342 transitions. Second operand 3 states. [2019-12-18 12:42:12,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:42:12,230 INFO L93 Difference]: Finished difference Result 19811 states and 56527 transitions. [2019-12-18 12:42:12,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:42:12,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-12-18 12:42:12,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:42:12,257 INFO L225 Difference]: With dead ends: 19811 [2019-12-18 12:42:12,258 INFO L226 Difference]: Without dead ends: 19811 [2019-12-18 12:42:12,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:42:12,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19811 states. [2019-12-18 12:42:12,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19811 to 18774. [2019-12-18 12:42:12,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18774 states. [2019-12-18 12:42:12,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18774 states to 18774 states and 54040 transitions. [2019-12-18 12:42:12,792 INFO L78 Accepts]: Start accepts. Automaton has 18774 states and 54040 transitions. Word has length 37 [2019-12-18 12:42:12,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:42:12,792 INFO L462 AbstractCegarLoop]: Abstraction has 18774 states and 54040 transitions. [2019-12-18 12:42:12,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:42:12,792 INFO L276 IsEmpty]: Start isEmpty. Operand 18774 states and 54040 transitions. [2019-12-18 12:42:12,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:42:12,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:42:12,812 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] [2019-12-18 12:42:12,812 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:42:12,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:42:12,813 INFO L82 PathProgramCache]: Analyzing trace with hash 102427512, now seen corresponding path program 1 times [2019-12-18 12:42:12,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:42:12,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546031089] [2019-12-18 12:42:12,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:42:12,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:42:12,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:42:12,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546031089] [2019-12-18 12:42:12,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:42:12,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:42:12,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070561815] [2019-12-18 12:42:12,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:42:12,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:42:12,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:42:12,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:42:12,900 INFO L87 Difference]: Start difference. First operand 18774 states and 54040 transitions. Second operand 7 states. [2019-12-18 12:42:13,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:42:13,058 INFO L93 Difference]: Finished difference Result 16432 states and 48773 transitions. [2019-12-18 12:42:13,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:42:13,059 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-18 12:42:13,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:42:13,088 INFO L225 Difference]: With dead ends: 16432 [2019-12-18 12:42:13,089 INFO L226 Difference]: Without dead ends: 12584 [2019-12-18 12:42:13,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:42:13,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12584 states. [2019-12-18 12:42:13,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12584 to 10487. [2019-12-18 12:42:13,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10487 states. [2019-12-18 12:42:13,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10487 states to 10487 states and 30519 transitions. [2019-12-18 12:42:13,333 INFO L78 Accepts]: Start accepts. Automaton has 10487 states and 30519 transitions. Word has length 40 [2019-12-18 12:42:13,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:42:13,334 INFO L462 AbstractCegarLoop]: Abstraction has 10487 states and 30519 transitions. [2019-12-18 12:42:13,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:42:13,334 INFO L276 IsEmpty]: Start isEmpty. Operand 10487 states and 30519 transitions. [2019-12-18 12:42:13,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:42:13,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:42:13,350 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, 1] [2019-12-18 12:42:13,351 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:42:13,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:42:13,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1992238470, now seen corresponding path program 1 times [2019-12-18 12:42:13,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:42:13,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862286065] [2019-12-18 12:42:13,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:42:13,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:42:13,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:42:13,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862286065] [2019-12-18 12:42:13,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:42:13,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:42:13,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329311470] [2019-12-18 12:42:13,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:42:13,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:42:13,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:42:13,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:42:13,418 INFO L87 Difference]: Start difference. First operand 10487 states and 30519 transitions. Second operand 4 states. [2019-12-18 12:42:13,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:42:13,475 INFO L93 Difference]: Finished difference Result 12340 states and 35372 transitions. [2019-12-18 12:42:13,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:42:13,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-18 12:42:13,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:42:13,484 INFO L225 Difference]: With dead ends: 12340 [2019-12-18 12:42:13,485 INFO L226 Difference]: Without dead ends: 5347 [2019-12-18 12:42:13,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:42:13,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5347 states. [2019-12-18 12:42:13,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5347 to 5347. [2019-12-18 12:42:13,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5347 states. [2019-12-18 12:42:13,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5347 states to 5347 states and 13617 transitions. [2019-12-18 12:42:13,562 INFO L78 Accepts]: Start accepts. Automaton has 5347 states and 13617 transitions. Word has length 64 [2019-12-18 12:42:13,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:42:13,562 INFO L462 AbstractCegarLoop]: Abstraction has 5347 states and 13617 transitions. [2019-12-18 12:42:13,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:42:13,563 INFO L276 IsEmpty]: Start isEmpty. Operand 5347 states and 13617 transitions. [2019-12-18 12:42:13,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:42:13,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:42:13,567 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, 1] [2019-12-18 12:42:13,568 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:42:13,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:42:13,568 INFO L82 PathProgramCache]: Analyzing trace with hash 729186312, now seen corresponding path program 2 times [2019-12-18 12:42:13,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:42:13,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064146265] [2019-12-18 12:42:13,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:42:13,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:42:13,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:42:13,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064146265] [2019-12-18 12:42:13,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:42:13,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:42:13,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407756150] [2019-12-18 12:42:13,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:42:13,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:42:13,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:42:13,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:42:13,659 INFO L87 Difference]: Start difference. First operand 5347 states and 13617 transitions. Second operand 6 states. [2019-12-18 12:42:13,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:42:13,911 INFO L93 Difference]: Finished difference Result 13443 states and 34962 transitions. [2019-12-18 12:42:13,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:42:13,912 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-18 12:42:13,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:42:13,931 INFO L225 Difference]: With dead ends: 13443 [2019-12-18 12:42:13,932 INFO L226 Difference]: Without dead ends: 8979 [2019-12-18 12:42:13,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:42:13,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8979 states. [2019-12-18 12:42:14,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8979 to 7405. [2019-12-18 12:42:14,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7405 states. [2019-12-18 12:42:14,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7405 states to 7405 states and 18340 transitions. [2019-12-18 12:42:14,129 INFO L78 Accepts]: Start accepts. Automaton has 7405 states and 18340 transitions. Word has length 64 [2019-12-18 12:42:14,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:42:14,130 INFO L462 AbstractCegarLoop]: Abstraction has 7405 states and 18340 transitions. [2019-12-18 12:42:14,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:42:14,130 INFO L276 IsEmpty]: Start isEmpty. Operand 7405 states and 18340 transitions. [2019-12-18 12:42:14,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:42:14,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:42:14,145 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, 1] [2019-12-18 12:42:14,145 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:42:14,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:42:14,146 INFO L82 PathProgramCache]: Analyzing trace with hash -220679674, now seen corresponding path program 3 times [2019-12-18 12:42:14,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:42:14,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429263917] [2019-12-18 12:42:14,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:42:14,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:42:14,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:42:14,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429263917] [2019-12-18 12:42:14,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:42:14,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:42:14,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967128492] [2019-12-18 12:42:14,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:42:14,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:42:14,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:42:14,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:42:14,239 INFO L87 Difference]: Start difference. First operand 7405 states and 18340 transitions. Second operand 4 states. [2019-12-18 12:42:14,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:42:14,295 INFO L93 Difference]: Finished difference Result 7879 states and 19343 transitions. [2019-12-18 12:42:14,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:42:14,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-18 12:42:14,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:42:14,297 INFO L225 Difference]: With dead ends: 7879 [2019-12-18 12:42:14,297 INFO L226 Difference]: Without dead ends: 556 [2019-12-18 12:42:14,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:42:14,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2019-12-18 12:42:14,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2019-12-18 12:42:14,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2019-12-18 12:42:14,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 1125 transitions. [2019-12-18 12:42:14,310 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 1125 transitions. Word has length 64 [2019-12-18 12:42:14,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:42:14,310 INFO L462 AbstractCegarLoop]: Abstraction has 556 states and 1125 transitions. [2019-12-18 12:42:14,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:42:14,311 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 1125 transitions. [2019-12-18 12:42:14,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:42:14,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:42:14,313 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, 1, 1] [2019-12-18 12:42:14,313 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:42:14,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:42:14,313 INFO L82 PathProgramCache]: Analyzing trace with hash -576744553, now seen corresponding path program 1 times [2019-12-18 12:42:14,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:42:14,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229599371] [2019-12-18 12:42:14,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:42:14,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:42:14,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:42:14,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229599371] [2019-12-18 12:42:14,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:42:14,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:42:14,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488735690] [2019-12-18 12:42:14,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:42:14,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:42:14,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:42:14,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:42:14,423 INFO L87 Difference]: Start difference. First operand 556 states and 1125 transitions. Second operand 7 states. [2019-12-18 12:42:14,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:42:14,644 INFO L93 Difference]: Finished difference Result 1165 states and 2345 transitions. [2019-12-18 12:42:14,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 12:42:14,645 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 12:42:14,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:42:14,646 INFO L225 Difference]: With dead ends: 1165 [2019-12-18 12:42:14,646 INFO L226 Difference]: Without dead ends: 849 [2019-12-18 12:42:14,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:42:14,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2019-12-18 12:42:14,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 632. [2019-12-18 12:42:14,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-12-18 12:42:14,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 1249 transitions. [2019-12-18 12:42:14,656 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 1249 transitions. Word has length 65 [2019-12-18 12:42:14,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:42:14,657 INFO L462 AbstractCegarLoop]: Abstraction has 632 states and 1249 transitions. [2019-12-18 12:42:14,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:42:14,657 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 1249 transitions. [2019-12-18 12:42:14,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:42:14,658 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:42:14,658 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, 1, 1] [2019-12-18 12:42:14,658 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:42:14,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:42:14,659 INFO L82 PathProgramCache]: Analyzing trace with hash 5346039, now seen corresponding path program 2 times [2019-12-18 12:42:14,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:42:14,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377077631] [2019-12-18 12:42:14,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:42:14,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:42:14,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:42:14,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377077631] [2019-12-18 12:42:14,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:42:14,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:42:14,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419860954] [2019-12-18 12:42:14,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:42:14,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:42:14,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:42:14,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:42:14,729 INFO L87 Difference]: Start difference. First operand 632 states and 1249 transitions. Second operand 3 states. [2019-12-18 12:42:14,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:42:14,743 INFO L93 Difference]: Finished difference Result 631 states and 1247 transitions. [2019-12-18 12:42:14,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:42:14,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 12:42:14,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:42:14,745 INFO L225 Difference]: With dead ends: 631 [2019-12-18 12:42:14,745 INFO L226 Difference]: Without dead ends: 631 [2019-12-18 12:42:14,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:42:14,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-12-18 12:42:14,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2019-12-18 12:42:14,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-12-18 12:42:14,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 1247 transitions. [2019-12-18 12:42:14,754 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 1247 transitions. Word has length 65 [2019-12-18 12:42:14,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:42:14,754 INFO L462 AbstractCegarLoop]: Abstraction has 631 states and 1247 transitions. [2019-12-18 12:42:14,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:42:14,754 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 1247 transitions. [2019-12-18 12:42:14,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:42:14,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:42:14,755 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, 1, 1, 1] [2019-12-18 12:42:14,756 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:42:14,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:42:14,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1469521026, now seen corresponding path program 1 times [2019-12-18 12:42:14,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:42:14,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206105863] [2019-12-18 12:42:14,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:42:14,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:42:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:42:14,932 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:42:14,932 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:42:14,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L851: Formula: (let ((.cse0 (store |v_#valid_89| 0 0))) (and (= v_~__unbuffered_cnt~0_140 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t477~0.base_38|)) (= 0 v_~__unbuffered_p2_EAX~0_75) (= v_~main$tmp_guard1~0_60 0) (= v_~z$r_buff0_thd2~0_131 0) (= 0 v_~z$flush_delayed~0_223) (= |v_#NULL.offset_6| 0) (= v_~z$w_buff1~0_366 0) (= v_~z$r_buff0_thd0~0_214 0) (= v_~z$r_buff1_thd2~0_149 0) (= |v_ULTIMATE.start_main_~#t477~0.offset_25| 0) (= v_~z$read_delayed~0_8 0) (= v_~z$r_buff1_thd1~0_149 0) (= v_~z$read_delayed_var~0.base_8 0) (= v_~z$r_buff0_thd1~0_132 0) (= v_~y~0_46 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t477~0.base_38|) (= v_~a~0_48 0) (= 0 v_~z$mem_tmp~0_195) (= 0 v_~z$r_buff1_thd4~0_355) (= 0 |v_#NULL.base_6|) (= v_~z$w_buff1_used~0_712 0) (= |v_#valid_87| (store .cse0 |v_ULTIMATE.start_main_~#t477~0.base_38| 1)) (< 0 |v_#StackHeapBarrier_20|) (= v_~z$w_buff0~0_640 0) (= v_~main$tmp_guard0~0_47 0) (= 0 v_~__unbuffered_p1_EAX~0_63) (= v_~z~0_314 0) (= 0 v_~__unbuffered_p3_EBX~0_65) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t477~0.base_38| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t477~0.base_38|) |v_ULTIMATE.start_main_~#t477~0.offset_25| 0)) |v_#memory_int_25|) (= 0 v_~z$r_buff0_thd3~0_453) (= v_~z$w_buff0_used~0_1093 0) (= 0 v_~__unbuffered_p3_EAX~0_90) (= v_~weak$$choice2~0_273 0) (= 0 v_~weak$$choice0~0_182) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t477~0.base_38| 4)) (= 0 v_~z$r_buff0_thd4~0_575) (= v_~z$r_buff1_thd0~0_227 0) (= 0 v_~z$r_buff1_thd3~0_381) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~x~0_88 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_26|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ULTIMATE.start_main_~#t478~0.offset=|v_ULTIMATE.start_main_~#t478~0.offset_26|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_7|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_149, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_119|, ~a~0=v_~a~0_48, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_214, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_63, ULTIMATE.start_main_~#t480~0.offset=|v_ULTIMATE.start_main_~#t480~0.offset_16|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_575, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_90, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_75, ULTIMATE.start_main_~#t478~0.base=|v_ULTIMATE.start_main_~#t478~0.base_40|, ~z$mem_tmp~0=v_~z$mem_tmp~0_195, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_712, ~z$flush_delayed~0=v_~z$flush_delayed~0_223, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_43|, ULTIMATE.start_main_~#t480~0.base=|v_ULTIMATE.start_main_~#t480~0.base_22|, ~weak$$choice0~0=v_~weak$$choice0~0_182, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_183|, ULTIMATE.start_main_~#t479~0.base=|v_ULTIMATE.start_main_~#t479~0.base_30|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_149, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_453, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140, ~x~0=v_~x~0_88, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_355, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_24|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_7|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_366, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_60, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t477~0.offset=|v_ULTIMATE.start_main_~#t477~0.offset_25|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_227, ~y~0=v_~y~0_46, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_131, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1093, ~z$w_buff0~0=v_~z$w_buff0~0_640, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_381, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_47, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_65, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_37|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_58|, ULTIMATE.start_main_~#t477~0.base=|v_ULTIMATE.start_main_~#t477~0.base_38|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_33|, #valid=|v_#valid_87|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_~#t479~0.offset=|v_ULTIMATE.start_main_~#t479~0.offset_17|, ~z~0=v_~z~0_314, ~weak$$choice2~0=v_~weak$$choice2~0_273, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t478~0.offset, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t480~0.offset, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t478~0.base, ~z$mem_tmp~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_~#t480~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_~#t479~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t477~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t477~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t479~0.offset, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:42:14,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L851-1-->L853: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t478~0.offset_10|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t478~0.base_11| 4)) (= 0 (select |v_#valid_46| |v_ULTIMATE.start_main_~#t478~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t478~0.base_11|)) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t478~0.base_11| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t478~0.base_11|) |v_ULTIMATE.start_main_~#t478~0.offset_10| 1)) |v_#memory_int_21|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t478~0.base_11|) (= |v_#valid_45| (store |v_#valid_46| |v_ULTIMATE.start_main_~#t478~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t478~0.offset=|v_ULTIMATE.start_main_~#t478~0.offset_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_21|, #length=|v_#length_23|, ULTIMATE.start_main_~#t478~0.base=|v_ULTIMATE.start_main_~#t478~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t478~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t478~0.base] because there is no mapped edge [2019-12-18 12:42:14,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L853-1-->L855: Formula: (and (= (store |v_#valid_44| |v_ULTIMATE.start_main_~#t479~0.base_11| 1) |v_#valid_43|) (not (= |v_ULTIMATE.start_main_~#t479~0.base_11| 0)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t479~0.base_11| 4) |v_#length_21|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t479~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t479~0.base_11|) |v_ULTIMATE.start_main_~#t479~0.offset_11| 2)) |v_#memory_int_19|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t479~0.base_11|) (= 0 (select |v_#valid_44| |v_ULTIMATE.start_main_~#t479~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t479~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t479~0.base=|v_ULTIMATE.start_main_~#t479~0.base_11|, #valid=|v_#valid_43|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t479~0.offset=|v_ULTIMATE.start_main_~#t479~0.offset_11|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t479~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t479~0.offset, #length] because there is no mapped edge [2019-12-18 12:42:14,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L855-1-->L857: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t480~0.base_9| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t480~0.base_9|) |v_ULTIMATE.start_main_~#t480~0.offset_8| 3)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t480~0.base_9|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t480~0.base_9| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t480~0.base_9| 4)) (= |v_ULTIMATE.start_main_~#t480~0.offset_8| 0) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t480~0.base_9|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t480~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t480~0.base=|v_ULTIMATE.start_main_~#t480~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_4|, ULTIMATE.start_main_~#t480~0.offset=|v_ULTIMATE.start_main_~#t480~0.offset_8|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t480~0.base, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t480~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 12:42:14,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] L4-->L813: Formula: (and (= ~weak$$choice2~0_Out-644173127 ~z$flush_delayed~0_Out-644173127) (= ~z$r_buff1_thd4~0_Out-644173127 ~z$r_buff0_thd4~0_In-644173127) (not (= P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-644173127 0)) (= |P3Thread1of1ForFork2_#t~nondet27_In-644173127| ~weak$$choice2~0_Out-644173127) (= ~z$r_buff0_thd2~0_In-644173127 ~z$r_buff1_thd2~0_Out-644173127) (= ~z$r_buff0_thd1~0_In-644173127 ~z$r_buff1_thd1~0_Out-644173127) (= 1 ~z$r_buff0_thd4~0_Out-644173127) (= ~z$r_buff1_thd0~0_Out-644173127 ~z$r_buff0_thd0~0_In-644173127) (= ~z~0_In-644173127 ~z$mem_tmp~0_Out-644173127) (= ~weak$$choice0~0_Out-644173127 |P3Thread1of1ForFork2_#t~nondet26_In-644173127|) (= ~z$r_buff0_thd3~0_In-644173127 ~z$r_buff1_thd3~0_Out-644173127)) InVars {P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_In-644173127|, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_In-644173127|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-644173127, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-644173127, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-644173127, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-644173127, ~z~0=~z~0_In-644173127, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-644173127, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-644173127} OutVars{P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_Out-644173127|, ~z$mem_tmp~0=~z$mem_tmp~0_Out-644173127, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_Out-644173127|, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-644173127, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-644173127, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-644173127, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-644173127, ~z$flush_delayed~0=~z$flush_delayed~0_Out-644173127, ~weak$$choice0~0=~weak$$choice0~0_Out-644173127, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-644173127, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-644173127, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-644173127, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-644173127, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-644173127, ~z~0=~z~0_In-644173127, ~weak$$choice2~0=~weak$$choice2~0_Out-644173127, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-644173127, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-644173127} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~nondet26, ~z$mem_tmp~0, P3Thread1of1ForFork2_#t~nondet27, ~weak$$choice0~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0, ~z$flush_delayed~0, ~weak$$choice2~0] because there is no mapped edge [2019-12-18 12:42:14,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L813-2-->L813-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork2_#t~ite29_Out-541895783| |P3Thread1of1ForFork2_#t~ite28_Out-541895783|)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-541895783 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-541895783 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= ~z$w_buff1~0_In-541895783 |P3Thread1of1ForFork2_#t~ite28_Out-541895783|)) (and .cse0 (not .cse2) (not .cse1) (= ~z$w_buff0~0_In-541895783 |P3Thread1of1ForFork2_#t~ite28_Out-541895783|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-541895783, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-541895783, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-541895783, ~z$w_buff1~0=~z$w_buff1~0_In-541895783} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-541895783|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-541895783|, ~z$w_buff0~0=~z$w_buff0~0_In-541895783, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-541895783, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-541895783, ~z$w_buff1~0=~z$w_buff1~0_In-541895783} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-18 12:42:14,953 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L818-->L819: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_61 256))) (= v_~z$r_buff0_thd4~0_131 v_~z$r_buff0_thd4~0_130)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_131, ~weak$$choice2~0=v_~weak$$choice2~0_61} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_12|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_11|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_11|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_61} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-18 12:42:14,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In2052713446 256) 0))) (or (and .cse0 (= |P3Thread1of1ForFork2_#t~ite48_Out2052713446| ~z~0_In2052713446)) (and (= |P3Thread1of1ForFork2_#t~ite48_Out2052713446| ~z$mem_tmp~0_In2052713446) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In2052713446, ~z$flush_delayed~0=~z$flush_delayed~0_In2052713446, ~z~0=~z~0_In2052713446} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In2052713446, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out2052713446|, ~z$flush_delayed~0=~z$flush_delayed~0_In2052713446, ~z~0=~z~0_In2052713446} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-18 12:42:14,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= v_~a~0_15 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_12| v_P0Thread1of1ForFork3_~arg.offset_12) (= |v_P0Thread1of1ForFork3_#res.offset_5| 0) (= v_P0Thread1of1ForFork3_~arg.base_12 |v_P0Thread1of1ForFork3_#in~arg.base_12|) (= v_~x~0_23 1)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|} OutVars{~a~0=v_~a~0_15, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_12, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_5|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_12, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-18 12:42:14,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] P1ENTRY-->P1EXIT: Formula: (and (= v_P1Thread1of1ForFork0_~arg.offset_6 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_P1Thread1of1ForFork0_~arg.base_6 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= v_~y~0_32 v_~__unbuffered_p1_EAX~0_9) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~x~0_11 2)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~y~0=v_~y~0_32} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_6, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_6, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_32, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-18 12:42:14,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-2135695936 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-2135695936 256) 0))) (or (and (= |P3Thread1of1ForFork2_#t~ite51_Out-2135695936| ~z$w_buff0_used~0_In-2135695936) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork2_#t~ite51_Out-2135695936| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2135695936, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2135695936} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out-2135695936|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2135695936, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2135695936} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-18 12:42:14,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-2015189764 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork1_#t~ite25_Out-2015189764| ~z~0_In-2015189764)) (and (= |P2Thread1of1ForFork1_#t~ite25_Out-2015189764| ~z$mem_tmp~0_In-2015189764) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-2015189764, ~z$flush_delayed~0=~z$flush_delayed~0_In-2015189764, ~z~0=~z~0_In-2015189764} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-2015189764, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out-2015189764|, ~z$flush_delayed~0=~z$flush_delayed~0_In-2015189764, ~z~0=~z~0_In-2015189764} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-18 12:42:14,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L830-->L830-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In1497284980 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1497284980 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1497284980 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd4~0_In1497284980 256) 0))) (or (and (= ~z$w_buff1_used~0_In1497284980 |P3Thread1of1ForFork2_#t~ite52_Out1497284980|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork2_#t~ite52_Out1497284980|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1497284980, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1497284980, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1497284980, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1497284980} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out1497284980|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1497284980, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1497284980, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1497284980, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1497284980} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-18 12:42:14,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L831-->L832: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1225302276 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-1225302276 256) 0))) (or (and (= ~z$r_buff0_thd4~0_Out-1225302276 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd4~0_Out-1225302276 ~z$r_buff0_thd4~0_In-1225302276) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1225302276, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1225302276} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out-1225302276|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1225302276, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1225302276} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-18 12:42:14,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L832-->L832-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-261005393 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-261005393 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In-261005393 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-261005393 256) 0))) (or (and (= |P3Thread1of1ForFork2_#t~ite54_Out-261005393| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P3Thread1of1ForFork2_#t~ite54_Out-261005393| ~z$r_buff1_thd4~0_In-261005393) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-261005393, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-261005393, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-261005393, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-261005393} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-261005393|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-261005393, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-261005393, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-261005393, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-261005393} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-18 12:42:14,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L832-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= |v_P3Thread1of1ForFork2_#t~ite54_24| v_~z$r_buff1_thd4~0_191) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_23|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_191, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 12:42:14,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L783-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_61 (+ v_~__unbuffered_cnt~0_62 1)) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= 0 v_~z$flush_delayed~0_137) (= v_~z~0_175 |v_P2Thread1of1ForFork1_#t~ite25_38|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_37|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~z$flush_delayed~0=v_~z$flush_delayed~0_137, ~z~0=v_~z~0_175, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 12:42:14,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] L861-->L863-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~z$w_buff0_used~0_139 256)) (= 0 (mod v_~z$r_buff0_thd0~0_18 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 12:42:14,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L863-2-->L863-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In2004530480 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In2004530480 256)))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In2004530480 |ULTIMATE.start_main_#t~ite59_Out2004530480|)) (and (= ~z~0_In2004530480 |ULTIMATE.start_main_#t~ite59_Out2004530480|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2004530480, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2004530480, ~z$w_buff1~0=~z$w_buff1~0_In2004530480, ~z~0=~z~0_In2004530480} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2004530480, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2004530480, ~z$w_buff1~0=~z$w_buff1~0_In2004530480, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out2004530480|, ~z~0=~z~0_In2004530480} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-18 12:42:14,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L863-4-->L864: Formula: (= v_~z~0_54 |v_ULTIMATE.start_main_#t~ite59_8|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_8|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_7|, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-18 12:42:14,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L864-->L864-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1573057023 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1573057023 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite61_Out-1573057023| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite61_Out-1573057023| ~z$w_buff0_used~0_In-1573057023)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1573057023, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1573057023} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1573057023, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1573057023|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1573057023} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-18 12:42:14,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L865-->L865-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In319602549 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In319602549 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In319602549 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In319602549 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite62_Out319602549| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite62_Out319602549| ~z$w_buff1_used~0_In319602549)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In319602549, ~z$w_buff0_used~0=~z$w_buff0_used~0_In319602549, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In319602549, ~z$w_buff1_used~0=~z$w_buff1_used~0_In319602549} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out319602549|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In319602549, ~z$w_buff0_used~0=~z$w_buff0_used~0_In319602549, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In319602549, ~z$w_buff1_used~0=~z$w_buff1_used~0_In319602549} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-18 12:42:14,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L866-->L866-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-438567984 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-438567984 256)))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out-438567984| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite63_Out-438567984| ~z$r_buff0_thd0~0_In-438567984)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-438567984, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-438567984} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-438567984|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-438567984, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-438567984} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-18 12:42:14,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L867-->L867-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In1217307653 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In1217307653 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In1217307653 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In1217307653 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite64_Out1217307653| ~z$r_buff1_thd0~0_In1217307653)) (and (= |ULTIMATE.start_main_#t~ite64_Out1217307653| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1217307653, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1217307653, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1217307653, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1217307653} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1217307653, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1217307653, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1217307653, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1217307653, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out1217307653|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-18 12:42:14,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1043] [1043] L867-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p1_EAX~0_21) (= 0 v_~__unbuffered_p2_EAX~0_33) (= v_~z$r_buff1_thd0~0_171 |v_ULTIMATE.start_main_#t~ite64_41|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= 1 v_~__unbuffered_p3_EAX~0_35) (= v_~main$tmp_guard1~0_19 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0) (= 0 v_~__unbuffered_p3_EBX~0_22) (= v_~x~0_35 2)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_35, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_171, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_35, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_40|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:42:15,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:42:15 BasicIcfg [2019-12-18 12:42:15,139 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:42:15,140 INFO L168 Benchmark]: Toolchain (without parser) took 180461.72 ms. Allocated memory was 144.7 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 101.1 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-18 12:42:15,141 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 12:42:15,142 INFO L168 Benchmark]: CACSL2BoogieTranslator took 805.50 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 100.6 MB in the beginning and 154.0 MB in the end (delta: -53.4 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. [2019-12-18 12:42:15,143 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.57 ms. Allocated memory is still 201.9 MB. Free memory was 154.0 MB in the beginning and 150.6 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-18 12:42:15,143 INFO L168 Benchmark]: Boogie Preprocessor took 68.14 ms. Allocated memory is still 201.9 MB. Free memory was 150.6 MB in the beginning and 147.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:42:15,144 INFO L168 Benchmark]: RCFGBuilder took 1032.91 ms. Allocated memory is still 201.9 MB. Free memory was 147.9 MB in the beginning and 90.8 MB in the end (delta: 57.2 MB). Peak memory consumption was 57.2 MB. Max. memory is 7.1 GB. [2019-12-18 12:42:15,144 INFO L168 Benchmark]: TraceAbstraction took 178474.46 ms. Allocated memory was 201.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 90.1 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-18 12:42:15,147 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.21 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 805.50 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 100.6 MB in the beginning and 154.0 MB in the end (delta: -53.4 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.57 ms. Allocated memory is still 201.9 MB. Free memory was 154.0 MB in the beginning and 150.6 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 68.14 ms. Allocated memory is still 201.9 MB. Free memory was 150.6 MB in the beginning and 147.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1032.91 ms. Allocated memory is still 201.9 MB. Free memory was 147.9 MB in the beginning and 90.8 MB in the end (delta: 57.2 MB). Peak memory consumption was 57.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 178474.46 ms. Allocated memory was 201.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 90.1 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.4s, 211 ProgramPointsBefore, 112 ProgramPointsAfterwards, 254 TransitionsBefore, 131 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 29 ChoiceCompositions, 11185 VarBasedMoverChecksPositive, 340 VarBasedMoverChecksNegative, 67 SemBasedMoverChecksPositive, 380 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.8s, 0 MoverChecksTotal, 142340 CheckedPairsTotal, 134 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L851] FCALL, FORK 0 pthread_create(&t477, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] FCALL, FORK 0 pthread_create(&t478, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] FCALL, FORK 0 pthread_create(&t479, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] FCALL, FORK 0 pthread_create(&t480, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 1 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L813] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L813] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L814] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L814] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L815] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L816] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L817] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L819] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L820] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 z = z$flush_delayed ? z$mem_tmp : z [L822] 4 z$flush_delayed = (_Bool)0 [L825] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 1 [L771] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 3 z$flush_delayed = weak$$choice2 [L774] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L776] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L777] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L778] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L779] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L781] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L782] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L829] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L830] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L865] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L866] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 199 locations, 2 error locations. Result: UNSAFE, OverallTime: 178.0s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 73.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3674 SDtfs, 5038 SDslu, 5559 SDs, 0 SdLazy, 1438 SolverSat, 201 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=220082occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 85.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 120148 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 713 NumberOfCodeBlocks, 713 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 628 ConstructedInterpolants, 0 QuantifiedInterpolants, 85310 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...