/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix028_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:00:11,468 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:00:11,471 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:00:11,489 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:00:11,490 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:00:11,492 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:00:11,494 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:00:11,503 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:00:11,507 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:00:11,511 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:00:11,513 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:00:11,515 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:00:11,515 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:00:11,517 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:00:11,519 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:00:11,521 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:00:11,522 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:00:11,523 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:00:11,524 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:00:11,529 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:00:11,533 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:00:11,538 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:00:11,539 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:00:11,540 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:00:11,542 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:00:11,542 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:00:11,542 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:00:11,545 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:00:11,546 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:00:11,547 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:00:11,547 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:00:11,548 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:00:11,549 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:00:11,550 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:00:11,551 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:00:11,551 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:00:11,551 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:00:11,552 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:00:11,552 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:00:11,553 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:00:11,554 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:00:11,555 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:00:11,574 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:00:11,574 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:00:11,575 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:00:11,575 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:00:11,576 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:00:11,576 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:00:11,576 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:00:11,576 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:00:11,576 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:00:11,577 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:00:11,577 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:00:11,577 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:00:11,577 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:00:11,577 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:00:11,577 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:00:11,578 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:00:11,578 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:00:11,578 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:00:11,578 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:00:11,578 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:00:11,579 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:00:11,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:00:11,579 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:00:11,579 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:00:11,579 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:00:11,579 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:00:11,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:00:11,580 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:00:11,580 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:00:11,580 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:00:11,850 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:00:11,864 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:00:11,868 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:00:11,869 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:00:11,869 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:00:11,870 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_tso.opt.i [2019-12-18 21:00:11,937 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/715b49425/246ac787e5eb46548890aed16544e3c8/FLAG35529317f [2019-12-18 21:00:12,481 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:00:12,484 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_tso.opt.i [2019-12-18 21:00:12,509 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/715b49425/246ac787e5eb46548890aed16544e3c8/FLAG35529317f [2019-12-18 21:00:12,773 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/715b49425/246ac787e5eb46548890aed16544e3c8 [2019-12-18 21:00:12,782 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:00:12,783 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:00:12,784 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:00:12,784 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:00:12,789 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:00:12,790 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:00:12" (1/1) ... [2019-12-18 21:00:12,793 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49c2c113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:00:12, skipping insertion in model container [2019-12-18 21:00:12,793 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:00:12" (1/1) ... [2019-12-18 21:00:12,799 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:00:12,843 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:00:13,386 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:00:13,399 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:00:13,473 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:00:13,549 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:00:13,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:00:13 WrapperNode [2019-12-18 21:00:13,550 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:00:13,551 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:00:13,551 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:00:13,551 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:00:13,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:00:13" (1/1) ... [2019-12-18 21:00:13,584 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:00:13" (1/1) ... [2019-12-18 21:00:13,629 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:00:13,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:00:13,629 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:00:13,630 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:00:13,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:00:13" (1/1) ... [2019-12-18 21:00:13,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:00:13" (1/1) ... [2019-12-18 21:00:13,646 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:00:13" (1/1) ... [2019-12-18 21:00:13,647 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:00:13" (1/1) ... [2019-12-18 21:00:13,659 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:00:13" (1/1) ... [2019-12-18 21:00:13,664 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:00:13" (1/1) ... [2019-12-18 21:00:13,668 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:00:13" (1/1) ... [2019-12-18 21:00:13,674 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:00:13,675 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:00:13,675 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:00:13,675 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:00:13,676 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:00:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:00:13,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:00:13,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:00:13,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:00:13,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:00:13,762 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:00:13,763 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:00:13,763 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:00:13,763 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:00:13,763 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:00:13,763 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:00:13,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:00:13,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:00:13,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:00:13,766 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:00:14,857 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:00:14,857 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:00:14,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:00:14 BoogieIcfgContainer [2019-12-18 21:00:14,859 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:00:14,860 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:00:14,860 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:00:14,863 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:00:14,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:00:12" (1/3) ... [2019-12-18 21:00:14,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fde489e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:00:14, skipping insertion in model container [2019-12-18 21:00:14,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:00:13" (2/3) ... [2019-12-18 21:00:14,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fde489e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:00:14, skipping insertion in model container [2019-12-18 21:00:14,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:00:14" (3/3) ... [2019-12-18 21:00:14,867 INFO L109 eAbstractionObserver]: Analyzing ICFG mix028_tso.opt.i [2019-12-18 21:00:14,876 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:00:14,876 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:00:14,884 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:00:14,885 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:00:14,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,922 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,923 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,924 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,924 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,933 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,933 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,933 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,934 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,934 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,953 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,954 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,955 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,956 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,957 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,958 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,959 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,960 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,964 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,965 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,969 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,969 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,970 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,971 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,971 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,972 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,973 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,979 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,980 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:00:14,998 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 21:00:15,019 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:00:15,019 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:00:15,019 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:00:15,019 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:00:15,019 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:00:15,020 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:00:15,020 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:00:15,020 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:00:15,038 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 257 transitions [2019-12-18 21:00:15,040 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 205 places, 257 transitions [2019-12-18 21:00:15,143 INFO L126 PetriNetUnfolder]: 62/254 cut-off events. [2019-12-18 21:00:15,144 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:00:15,168 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 254 events. 62/254 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 519 event pairs. 9/199 useless extension candidates. Maximal degree in co-relation 224. Up to 2 conditions per place. [2019-12-18 21:00:15,207 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 205 places, 257 transitions [2019-12-18 21:00:15,270 INFO L126 PetriNetUnfolder]: 62/254 cut-off events. [2019-12-18 21:00:15,270 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:00:15,286 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 254 events. 62/254 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 519 event pairs. 9/199 useless extension candidates. Maximal degree in co-relation 224. Up to 2 conditions per place. [2019-12-18 21:00:15,318 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26988 [2019-12-18 21:00:15,319 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:00:18,505 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-18 21:00:18,608 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-18 21:00:18,969 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 21:00:19,094 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 21:00:19,205 INFO L206 etLargeBlockEncoding]: Checked pairs total: 170994 [2019-12-18 21:00:19,205 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-18 21:00:19,209 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 122 places, 145 transitions [2019-12-18 21:00:24,400 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 59962 states. [2019-12-18 21:00:24,402 INFO L276 IsEmpty]: Start isEmpty. Operand 59962 states. [2019-12-18 21:00:24,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 21:00:24,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:00:24,410 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:00:24,410 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:00:24,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:00:24,417 INFO L82 PathProgramCache]: Analyzing trace with hash -211659802, now seen corresponding path program 1 times [2019-12-18 21:00:24,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:00:24,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932028528] [2019-12-18 21:00:24,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:00:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:00:24,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:00:24,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932028528] [2019-12-18 21:00:24,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:00:24,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:00:24,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796580893] [2019-12-18 21:00:24,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:00:24,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:00:24,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:00:24,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:00:24,720 INFO L87 Difference]: Start difference. First operand 59962 states. Second operand 3 states. [2019-12-18 21:00:26,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:00:26,912 INFO L93 Difference]: Finished difference Result 59782 states and 240290 transitions. [2019-12-18 21:00:26,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:00:26,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 21:00:26,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:00:27,338 INFO L225 Difference]: With dead ends: 59782 [2019-12-18 21:00:27,339 INFO L226 Difference]: Without dead ends: 58586 [2019-12-18 21:00:27,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:00:28,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58586 states. [2019-12-18 21:00:30,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58586 to 58586. [2019-12-18 21:00:30,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58586 states. [2019-12-18 21:00:32,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58586 states to 58586 states and 235740 transitions. [2019-12-18 21:00:32,772 INFO L78 Accepts]: Start accepts. Automaton has 58586 states and 235740 transitions. Word has length 7 [2019-12-18 21:00:32,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:00:32,773 INFO L462 AbstractCegarLoop]: Abstraction has 58586 states and 235740 transitions. [2019-12-18 21:00:32,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:00:32,773 INFO L276 IsEmpty]: Start isEmpty. Operand 58586 states and 235740 transitions. [2019-12-18 21:00:32,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:00:32,778 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:00:32,778 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:00:32,779 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:00:32,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:00:32,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1955894819, now seen corresponding path program 1 times [2019-12-18 21:00:32,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:00:32,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227455561] [2019-12-18 21:00:32,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:00:32,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:00:32,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:00:32,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227455561] [2019-12-18 21:00:32,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:00:32,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:00:32,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036961882] [2019-12-18 21:00:32,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:00:32,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:00:32,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:00:32,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:00:32,898 INFO L87 Difference]: Start difference. First operand 58586 states and 235740 transitions. Second operand 4 states. [2019-12-18 21:00:34,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:00:34,443 INFO L93 Difference]: Finished difference Result 94168 states and 363659 transitions. [2019-12-18 21:00:34,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:00:34,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 21:00:34,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:00:35,005 INFO L225 Difference]: With dead ends: 94168 [2019-12-18 21:00:35,006 INFO L226 Difference]: Without dead ends: 94154 [2019-12-18 21:00:35,007 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 21:00:39,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94154 states. [2019-12-18 21:00:41,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94154 to 90710. [2019-12-18 21:00:41,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90710 states. [2019-12-18 21:00:41,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90710 states to 90710 states and 352628 transitions. [2019-12-18 21:00:41,713 INFO L78 Accepts]: Start accepts. Automaton has 90710 states and 352628 transitions. Word has length 13 [2019-12-18 21:00:41,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:00:41,714 INFO L462 AbstractCegarLoop]: Abstraction has 90710 states and 352628 transitions. [2019-12-18 21:00:41,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:00:41,714 INFO L276 IsEmpty]: Start isEmpty. Operand 90710 states and 352628 transitions. [2019-12-18 21:00:41,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:00:41,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:00:41,716 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:00:41,717 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:00:41,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:00:41,717 INFO L82 PathProgramCache]: Analyzing trace with hash -380053055, now seen corresponding path program 1 times [2019-12-18 21:00:41,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:00:41,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580099421] [2019-12-18 21:00:41,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:00:41,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:00:41,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:00:41,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580099421] [2019-12-18 21:00:41,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:00:41,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:00:41,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181877838] [2019-12-18 21:00:41,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:00:41,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:00:41,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:00:41,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:00:41,770 INFO L87 Difference]: Start difference. First operand 90710 states and 352628 transitions. Second operand 3 states. [2019-12-18 21:00:41,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:00:41,954 INFO L93 Difference]: Finished difference Result 49511 states and 167787 transitions. [2019-12-18 21:00:41,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:00:41,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 21:00:41,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:00:42,044 INFO L225 Difference]: With dead ends: 49511 [2019-12-18 21:00:42,044 INFO L226 Difference]: Without dead ends: 49511 [2019-12-18 21:00:42,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:00:45,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49511 states. [2019-12-18 21:00:46,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49511 to 49511. [2019-12-18 21:00:46,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49511 states. [2019-12-18 21:00:46,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49511 states to 49511 states and 167787 transitions. [2019-12-18 21:00:46,496 INFO L78 Accepts]: Start accepts. Automaton has 49511 states and 167787 transitions. Word has length 13 [2019-12-18 21:00:46,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:00:46,496 INFO L462 AbstractCegarLoop]: Abstraction has 49511 states and 167787 transitions. [2019-12-18 21:00:46,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:00:46,497 INFO L276 IsEmpty]: Start isEmpty. Operand 49511 states and 167787 transitions. [2019-12-18 21:00:46,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:00:46,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:00:46,498 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:00:46,498 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:00:46,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:00:46,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1312328818, now seen corresponding path program 1 times [2019-12-18 21:00:46,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:00:46,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771423646] [2019-12-18 21:00:46,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:00:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:00:46,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:00:46,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771423646] [2019-12-18 21:00:46,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:00:46,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:00:46,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461965950] [2019-12-18 21:00:46,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:00:46,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:00:46,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:00:46,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:00:46,561 INFO L87 Difference]: Start difference. First operand 49511 states and 167787 transitions. Second operand 4 states. [2019-12-18 21:00:46,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:00:46,614 INFO L93 Difference]: Finished difference Result 5190 states and 13229 transitions. [2019-12-18 21:00:46,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:00:46,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 21:00:46,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:00:46,622 INFO L225 Difference]: With dead ends: 5190 [2019-12-18 21:00:46,622 INFO L226 Difference]: Without dead ends: 5190 [2019-12-18 21:00:46,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:00:46,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5190 states. [2019-12-18 21:00:46,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5190 to 5190. [2019-12-18 21:00:46,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5190 states. [2019-12-18 21:00:46,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5190 states to 5190 states and 13229 transitions. [2019-12-18 21:00:46,704 INFO L78 Accepts]: Start accepts. Automaton has 5190 states and 13229 transitions. Word has length 14 [2019-12-18 21:00:46,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:00:46,705 INFO L462 AbstractCegarLoop]: Abstraction has 5190 states and 13229 transitions. [2019-12-18 21:00:46,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:00:46,705 INFO L276 IsEmpty]: Start isEmpty. Operand 5190 states and 13229 transitions. [2019-12-18 21:00:46,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 21:00:46,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:00:46,710 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 21:00:46,710 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:00:46,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:00:46,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1825338, now seen corresponding path program 1 times [2019-12-18 21:00:46,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:00:46,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459119411] [2019-12-18 21:00:46,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:00:46,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:00:46,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:00:46,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459119411] [2019-12-18 21:00:46,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:00:46,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:00:46,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801985538] [2019-12-18 21:00:46,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:00:46,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:00:46,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:00:46,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:00:46,833 INFO L87 Difference]: Start difference. First operand 5190 states and 13229 transitions. Second operand 5 states. [2019-12-18 21:00:46,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:00:46,865 INFO L93 Difference]: Finished difference Result 2021 states and 5327 transitions. [2019-12-18 21:00:46,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:00:46,865 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 21:00:46,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:00:46,868 INFO L225 Difference]: With dead ends: 2021 [2019-12-18 21:00:46,868 INFO L226 Difference]: Without dead ends: 2021 [2019-12-18 21:00:46,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:00:46,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2021 states. [2019-12-18 21:00:46,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2021 to 1923. [2019-12-18 21:00:46,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1923 states. [2019-12-18 21:00:46,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1923 states to 1923 states and 5096 transitions. [2019-12-18 21:00:46,897 INFO L78 Accepts]: Start accepts. Automaton has 1923 states and 5096 transitions. Word has length 26 [2019-12-18 21:00:46,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:00:46,898 INFO L462 AbstractCegarLoop]: Abstraction has 1923 states and 5096 transitions. [2019-12-18 21:00:46,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:00:46,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1923 states and 5096 transitions. [2019-12-18 21:00:46,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-18 21:00:46,904 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:00:46,904 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, 1, 1, 1, 1, 1] [2019-12-18 21:00:46,905 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:00:46,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:00:46,905 INFO L82 PathProgramCache]: Analyzing trace with hash -285304999, now seen corresponding path program 1 times [2019-12-18 21:00:46,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:00:46,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516583727] [2019-12-18 21:00:46,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:00:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:00:47,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:00:47,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516583727] [2019-12-18 21:00:47,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:00:47,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:00:47,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416876014] [2019-12-18 21:00:47,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:00:47,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:00:47,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:00:47,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:00:47,109 INFO L87 Difference]: Start difference. First operand 1923 states and 5096 transitions. Second operand 3 states. [2019-12-18 21:00:47,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:00:47,128 INFO L93 Difference]: Finished difference Result 1923 states and 5006 transitions. [2019-12-18 21:00:47,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:00:47,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-12-18 21:00:47,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:00:47,131 INFO L225 Difference]: With dead ends: 1923 [2019-12-18 21:00:47,131 INFO L226 Difference]: Without dead ends: 1923 [2019-12-18 21:00:47,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:00:47,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2019-12-18 21:00:47,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1923. [2019-12-18 21:00:47,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1923 states. [2019-12-18 21:00:47,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1923 states to 1923 states and 5006 transitions. [2019-12-18 21:00:47,162 INFO L78 Accepts]: Start accepts. Automaton has 1923 states and 5006 transitions. Word has length 71 [2019-12-18 21:00:47,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:00:47,162 INFO L462 AbstractCegarLoop]: Abstraction has 1923 states and 5006 transitions. [2019-12-18 21:00:47,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:00:47,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1923 states and 5006 transitions. [2019-12-18 21:00:47,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 21:00:47,168 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:00:47,168 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, 1, 1, 1, 1, 1, 1] [2019-12-18 21:00:47,169 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:00:47,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:00:47,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1404202995, now seen corresponding path program 1 times [2019-12-18 21:00:47,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:00:47,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246065616] [2019-12-18 21:00:47,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:00:47,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:00:47,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:00:47,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246065616] [2019-12-18 21:00:47,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:00:47,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:00:47,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075617874] [2019-12-18 21:00:47,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:00:47,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:00:47,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:00:47,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:00:47,287 INFO L87 Difference]: Start difference. First operand 1923 states and 5006 transitions. Second operand 5 states. [2019-12-18 21:00:47,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:00:47,548 INFO L93 Difference]: Finished difference Result 2180 states and 5594 transitions. [2019-12-18 21:00:47,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:00:47,548 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-12-18 21:00:47,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:00:47,552 INFO L225 Difference]: With dead ends: 2180 [2019-12-18 21:00:47,553 INFO L226 Difference]: Without dead ends: 2180 [2019-12-18 21:00:47,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:00:47,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2180 states. [2019-12-18 21:00:47,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2180 to 1993. [2019-12-18 21:00:47,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1993 states. [2019-12-18 21:00:47,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 5175 transitions. [2019-12-18 21:00:47,587 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 5175 transitions. Word has length 72 [2019-12-18 21:00:47,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:00:47,587 INFO L462 AbstractCegarLoop]: Abstraction has 1993 states and 5175 transitions. [2019-12-18 21:00:47,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:00:47,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 5175 transitions. [2019-12-18 21:00:47,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 21:00:47,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:00:47,594 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, 1, 1, 1, 1, 1, 1] [2019-12-18 21:00:47,594 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:00:47,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:00:47,595 INFO L82 PathProgramCache]: Analyzing trace with hash 247016729, now seen corresponding path program 2 times [2019-12-18 21:00:47,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:00:47,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388893274] [2019-12-18 21:00:47,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:00:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:00:47,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:00:47,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388893274] [2019-12-18 21:00:47,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:00:47,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:00:47,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468766625] [2019-12-18 21:00:47,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:00:47,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:00:47,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:00:47,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:00:47,740 INFO L87 Difference]: Start difference. First operand 1993 states and 5175 transitions. Second operand 3 states. [2019-12-18 21:00:47,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:00:47,787 INFO L93 Difference]: Finished difference Result 1992 states and 5173 transitions. [2019-12-18 21:00:47,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:00:47,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-12-18 21:00:47,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:00:47,792 INFO L225 Difference]: With dead ends: 1992 [2019-12-18 21:00:47,793 INFO L226 Difference]: Without dead ends: 1992 [2019-12-18 21:00:47,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:00:47,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2019-12-18 21:00:47,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1815. [2019-12-18 21:00:47,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1815 states. [2019-12-18 21:00:47,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1815 states and 4765 transitions. [2019-12-18 21:00:47,824 INFO L78 Accepts]: Start accepts. Automaton has 1815 states and 4765 transitions. Word has length 72 [2019-12-18 21:00:47,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:00:47,827 INFO L462 AbstractCegarLoop]: Abstraction has 1815 states and 4765 transitions. [2019-12-18 21:00:47,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:00:47,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 4765 transitions. [2019-12-18 21:00:47,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-18 21:00:47,831 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:00:47,831 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:00:47,832 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:00:47,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:00:47,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1630724456, now seen corresponding path program 1 times [2019-12-18 21:00:47,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:00:47,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110397020] [2019-12-18 21:00:47,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:00:47,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:00:47,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:00:47,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110397020] [2019-12-18 21:00:47,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:00:47,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:00:47,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998371378] [2019-12-18 21:00:47,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:00:47,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:00:47,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:00:47,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:00:47,979 INFO L87 Difference]: Start difference. First operand 1815 states and 4765 transitions. Second operand 4 states. [2019-12-18 21:00:48,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:00:48,171 INFO L93 Difference]: Finished difference Result 2067 states and 5345 transitions. [2019-12-18 21:00:48,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:00:48,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-12-18 21:00:48,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:00:48,174 INFO L225 Difference]: With dead ends: 2067 [2019-12-18 21:00:48,174 INFO L226 Difference]: Without dead ends: 2067 [2019-12-18 21:00:48,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:00:48,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2019-12-18 21:00:48,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 2039. [2019-12-18 21:00:48,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2039 states. [2019-12-18 21:00:48,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 2039 states and 5279 transitions. [2019-12-18 21:00:48,196 INFO L78 Accepts]: Start accepts. Automaton has 2039 states and 5279 transitions. Word has length 73 [2019-12-18 21:00:48,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:00:48,197 INFO L462 AbstractCegarLoop]: Abstraction has 2039 states and 5279 transitions. [2019-12-18 21:00:48,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:00:48,197 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 5279 transitions. [2019-12-18 21:00:48,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-18 21:00:48,201 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:00:48,201 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:00:48,201 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:00:48,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:00:48,202 INFO L82 PathProgramCache]: Analyzing trace with hash 613964530, now seen corresponding path program 2 times [2019-12-18 21:00:48,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:00:48,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608206759] [2019-12-18 21:00:48,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:00:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:00:48,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:00:48,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608206759] [2019-12-18 21:00:48,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:00:48,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 21:00:48,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085518426] [2019-12-18 21:00:48,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 21:00:48,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:00:48,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 21:00:48,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:00:48,493 INFO L87 Difference]: Start difference. First operand 2039 states and 5279 transitions. Second operand 8 states. [2019-12-18 21:00:48,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:00:48,939 INFO L93 Difference]: Finished difference Result 2913 states and 7490 transitions. [2019-12-18 21:00:48,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 21:00:48,939 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2019-12-18 21:00:48,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:00:48,942 INFO L225 Difference]: With dead ends: 2913 [2019-12-18 21:00:48,943 INFO L226 Difference]: Without dead ends: 2913 [2019-12-18 21:00:48,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:00:48,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2019-12-18 21:00:48,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 2313. [2019-12-18 21:00:48,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2313 states. [2019-12-18 21:00:48,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 5996 transitions. [2019-12-18 21:00:48,971 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 5996 transitions. Word has length 73 [2019-12-18 21:00:48,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:00:48,972 INFO L462 AbstractCegarLoop]: Abstraction has 2313 states and 5996 transitions. [2019-12-18 21:00:48,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 21:00:48,972 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 5996 transitions. [2019-12-18 21:00:48,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-18 21:00:48,975 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:00:48,975 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:00:48,976 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:00:48,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:00:48,976 INFO L82 PathProgramCache]: Analyzing trace with hash -412461650, now seen corresponding path program 3 times [2019-12-18 21:00:48,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:00:48,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892346470] [2019-12-18 21:00:48,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:00:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:00:49,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:00:49,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892346470] [2019-12-18 21:00:49,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:00:49,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 21:00:49,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643482501] [2019-12-18 21:00:49,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 21:00:49,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:00:49,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 21:00:49,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:00:49,216 INFO L87 Difference]: Start difference. First operand 2313 states and 5996 transitions. Second operand 8 states. [2019-12-18 21:00:50,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:00:50,144 INFO L93 Difference]: Finished difference Result 3095 states and 7919 transitions. [2019-12-18 21:00:50,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:00:50,144 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2019-12-18 21:00:50,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:00:50,149 INFO L225 Difference]: With dead ends: 3095 [2019-12-18 21:00:50,150 INFO L226 Difference]: Without dead ends: 3095 [2019-12-18 21:00:50,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:00:50,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3095 states. [2019-12-18 21:00:50,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3095 to 2159. [2019-12-18 21:00:50,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2159 states. [2019-12-18 21:00:50,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2159 states to 2159 states and 5549 transitions. [2019-12-18 21:00:50,177 INFO L78 Accepts]: Start accepts. Automaton has 2159 states and 5549 transitions. Word has length 73 [2019-12-18 21:00:50,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:00:50,177 INFO L462 AbstractCegarLoop]: Abstraction has 2159 states and 5549 transitions. [2019-12-18 21:00:50,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 21:00:50,177 INFO L276 IsEmpty]: Start isEmpty. Operand 2159 states and 5549 transitions. [2019-12-18 21:00:50,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-18 21:00:50,180 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:00:50,180 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:00:50,180 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:00:50,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:00:50,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1389200384, now seen corresponding path program 4 times [2019-12-18 21:00:50,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:00:50,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944803401] [2019-12-18 21:00:50,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:00:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:00:50,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:00:50,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944803401] [2019-12-18 21:00:50,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:00:50,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 21:00:50,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734615383] [2019-12-18 21:00:50,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 21:00:50,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:00:50,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 21:00:50,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:00:50,434 INFO L87 Difference]: Start difference. First operand 2159 states and 5549 transitions. Second operand 8 states. [2019-12-18 21:00:50,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:00:50,949 INFO L93 Difference]: Finished difference Result 2512 states and 6389 transitions. [2019-12-18 21:00:50,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:00:50,950 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2019-12-18 21:00:50,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:00:50,953 INFO L225 Difference]: With dead ends: 2512 [2019-12-18 21:00:50,953 INFO L226 Difference]: Without dead ends: 2512 [2019-12-18 21:00:50,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-12-18 21:00:50,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2512 states. [2019-12-18 21:00:50,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2512 to 2055. [2019-12-18 21:00:50,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2055 states. [2019-12-18 21:00:50,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 5279 transitions. [2019-12-18 21:00:50,979 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 5279 transitions. Word has length 73 [2019-12-18 21:00:50,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:00:50,979 INFO L462 AbstractCegarLoop]: Abstraction has 2055 states and 5279 transitions. [2019-12-18 21:00:50,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 21:00:50,979 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 5279 transitions. [2019-12-18 21:00:50,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-18 21:00:50,982 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:00:50,982 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:00:50,982 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:00:50,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:00:50,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1282272910, now seen corresponding path program 5 times [2019-12-18 21:00:50,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:00:50,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418847792] [2019-12-18 21:00:50,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:00:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:00:51,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:00:51,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418847792] [2019-12-18 21:00:51,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:00:51,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 21:00:51,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293494355] [2019-12-18 21:00:51,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:00:51,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:00:51,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:00:51,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:00:51,193 INFO L87 Difference]: Start difference. First operand 2055 states and 5279 transitions. Second operand 9 states. [2019-12-18 21:00:51,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:00:51,550 INFO L93 Difference]: Finished difference Result 2446 states and 6224 transitions. [2019-12-18 21:00:51,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:00:51,550 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-12-18 21:00:51,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:00:51,555 INFO L225 Difference]: With dead ends: 2446 [2019-12-18 21:00:51,555 INFO L226 Difference]: Without dead ends: 2446 [2019-12-18 21:00:51,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:00:51,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2446 states. [2019-12-18 21:00:51,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2446 to 2083. [2019-12-18 21:00:51,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2083 states. [2019-12-18 21:00:51,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 2083 states and 5345 transitions. [2019-12-18 21:00:51,587 INFO L78 Accepts]: Start accepts. Automaton has 2083 states and 5345 transitions. Word has length 73 [2019-12-18 21:00:51,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:00:51,589 INFO L462 AbstractCegarLoop]: Abstraction has 2083 states and 5345 transitions. [2019-12-18 21:00:51,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:00:51,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2083 states and 5345 transitions. [2019-12-18 21:00:51,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-18 21:00:51,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:00:51,594 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:00:51,594 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:00:51,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:00:51,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1809443492, now seen corresponding path program 1 times [2019-12-18 21:00:51,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:00:51,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872433089] [2019-12-18 21:00:51,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:00:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:00:51,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:00:51,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872433089] [2019-12-18 21:00:51,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:00:51,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:00:51,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254633752] [2019-12-18 21:00:51,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:00:51,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:00:51,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:00:51,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:00:51,786 INFO L87 Difference]: Start difference. First operand 2083 states and 5345 transitions. Second operand 6 states. [2019-12-18 21:00:51,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:00:51,926 INFO L93 Difference]: Finished difference Result 3381 states and 8141 transitions. [2019-12-18 21:00:51,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:00:51,927 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2019-12-18 21:00:51,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:00:51,930 INFO L225 Difference]: With dead ends: 3381 [2019-12-18 21:00:51,930 INFO L226 Difference]: Without dead ends: 1503 [2019-12-18 21:00:51,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:00:51,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2019-12-18 21:00:51,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1237. [2019-12-18 21:00:51,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1237 states. [2019-12-18 21:00:51,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 2697 transitions. [2019-12-18 21:00:51,942 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 2697 transitions. Word has length 74 [2019-12-18 21:00:51,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:00:51,943 INFO L462 AbstractCegarLoop]: Abstraction has 1237 states and 2697 transitions. [2019-12-18 21:00:51,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:00:51,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 2697 transitions. [2019-12-18 21:00:51,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-18 21:00:51,944 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:00:51,945 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:00:51,945 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:00:51,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:00:51,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1804184334, now seen corresponding path program 2 times [2019-12-18 21:00:51,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:00:51,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589508950] [2019-12-18 21:00:51,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:00:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:00:52,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:00:52,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589508950] [2019-12-18 21:00:52,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:00:52,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:00:52,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397557303] [2019-12-18 21:00:52,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:00:52,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:00:52,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:00:52,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:00:52,044 INFO L87 Difference]: Start difference. First operand 1237 states and 2697 transitions. Second operand 4 states. [2019-12-18 21:00:52,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:00:52,065 INFO L93 Difference]: Finished difference Result 1425 states and 3029 transitions. [2019-12-18 21:00:52,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:00:52,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-18 21:00:52,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:00:52,066 INFO L225 Difference]: With dead ends: 1425 [2019-12-18 21:00:52,067 INFO L226 Difference]: Without dead ends: 253 [2019-12-18 21:00:52,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:00:52,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-12-18 21:00:52,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2019-12-18 21:00:52,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-12-18 21:00:52,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 430 transitions. [2019-12-18 21:00:52,070 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 430 transitions. Word has length 74 [2019-12-18 21:00:52,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:00:52,071 INFO L462 AbstractCegarLoop]: Abstraction has 253 states and 430 transitions. [2019-12-18 21:00:52,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:00:52,071 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 430 transitions. [2019-12-18 21:00:52,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-18 21:00:52,072 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:00:52,072 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:00:52,072 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:00:52,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:00:52,073 INFO L82 PathProgramCache]: Analyzing trace with hash 53493272, now seen corresponding path program 3 times [2019-12-18 21:00:52,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:00:52,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209622261] [2019-12-18 21:00:52,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:00:52,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:00:52,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:00:52,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209622261] [2019-12-18 21:00:52,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:00:52,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 21:00:52,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517917453] [2019-12-18 21:00:52,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 21:00:52,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:00:52,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 21:00:52,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:00:52,435 INFO L87 Difference]: Start difference. First operand 253 states and 430 transitions. Second operand 14 states. [2019-12-18 21:00:53,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:00:53,465 INFO L93 Difference]: Finished difference Result 543 states and 956 transitions. [2019-12-18 21:00:53,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 21:00:53,466 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 74 [2019-12-18 21:00:53,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:00:53,467 INFO L225 Difference]: With dead ends: 543 [2019-12-18 21:00:53,467 INFO L226 Difference]: Without dead ends: 513 [2019-12-18 21:00:53,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2019-12-18 21:00:53,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-12-18 21:00:53,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 391. [2019-12-18 21:00:53,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-12-18 21:00:53,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 676 transitions. [2019-12-18 21:00:53,473 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 676 transitions. Word has length 74 [2019-12-18 21:00:53,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:00:53,473 INFO L462 AbstractCegarLoop]: Abstraction has 391 states and 676 transitions. [2019-12-18 21:00:53,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 21:00:53,473 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 676 transitions. [2019-12-18 21:00:53,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-18 21:00:53,474 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:00:53,474 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:00:53,474 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:00:53,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:00:53,474 INFO L82 PathProgramCache]: Analyzing trace with hash 328981008, now seen corresponding path program 4 times [2019-12-18 21:00:53,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:00:53,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32838562] [2019-12-18 21:00:53,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:00:53,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:00:53,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:00:53,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32838562] [2019-12-18 21:00:53,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:00:53,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 21:00:53,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684992652] [2019-12-18 21:00:53,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 21:00:53,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:00:53,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 21:00:53,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-12-18 21:00:53,857 INFO L87 Difference]: Start difference. First operand 391 states and 676 transitions. Second operand 16 states. [2019-12-18 21:00:54,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:00:54,748 INFO L93 Difference]: Finished difference Result 650 states and 1123 transitions. [2019-12-18 21:00:54,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 21:00:54,749 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 74 [2019-12-18 21:00:54,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:00:54,750 INFO L225 Difference]: With dead ends: 650 [2019-12-18 21:00:54,750 INFO L226 Difference]: Without dead ends: 620 [2019-12-18 21:00:54,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=667, Unknown=0, NotChecked=0, Total=812 [2019-12-18 21:00:54,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-12-18 21:00:54,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 401. [2019-12-18 21:00:54,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-12-18 21:00:54,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 694 transitions. [2019-12-18 21:00:54,757 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 694 transitions. Word has length 74 [2019-12-18 21:00:54,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:00:54,757 INFO L462 AbstractCegarLoop]: Abstraction has 401 states and 694 transitions. [2019-12-18 21:00:54,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 21:00:54,758 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 694 transitions. [2019-12-18 21:00:54,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-18 21:00:54,758 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:00:54,758 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:00:54,759 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:00:54,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:00:54,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1942440816, now seen corresponding path program 5 times [2019-12-18 21:00:54,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:00:54,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37893010] [2019-12-18 21:00:54,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:00:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:00:55,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:00:55,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37893010] [2019-12-18 21:00:55,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:00:55,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:00:55,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353767157] [2019-12-18 21:00:55,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:00:55,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:00:55,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:00:55,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:00:55,063 INFO L87 Difference]: Start difference. First operand 401 states and 694 transitions. Second operand 11 states. [2019-12-18 21:00:55,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:00:55,483 INFO L93 Difference]: Finished difference Result 557 states and 952 transitions. [2019-12-18 21:00:55,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:00:55,484 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2019-12-18 21:00:55,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:00:55,485 INFO L225 Difference]: With dead ends: 557 [2019-12-18 21:00:55,485 INFO L226 Difference]: Without dead ends: 527 [2019-12-18 21:00:55,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-18 21:00:55,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-12-18 21:00:55,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 361. [2019-12-18 21:00:55,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-12-18 21:00:55,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 615 transitions. [2019-12-18 21:00:55,491 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 615 transitions. Word has length 74 [2019-12-18 21:00:55,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:00:55,492 INFO L462 AbstractCegarLoop]: Abstraction has 361 states and 615 transitions. [2019-12-18 21:00:55,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:00:55,492 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 615 transitions. [2019-12-18 21:00:55,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-18 21:00:55,493 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:00:55,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:00:55,493 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:00:55,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:00:55,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1807969600, now seen corresponding path program 6 times [2019-12-18 21:00:55,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:00:55,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708432580] [2019-12-18 21:00:55,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:00:55,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:00:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:00:55,624 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:00:55,624 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:00:55,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1033] [1033] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_63| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= 0 v_~weak$$choice0~0_10) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~y$r_buff1_thd2~0_20) (= 0 v_~y$read_delayed_var~0.offset_7) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t766~0.base_27| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t766~0.base_27|) |v_ULTIMATE.start_main_~#t766~0.offset_21| 0)) |v_#memory_int_23|) (= v_~y$r_buff0_thd1~0_10 0) (= v_~z~0_11 0) (= v_~y$w_buff1_used~0_77 0) (= v_~y$read_delayed~0_7 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t766~0.base_27|) (= 0 v_~y$r_buff1_thd3~0_40) (= v_~y$mem_tmp~0_13 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t766~0.base_27| 1) |v_#valid_61|) (< 0 |v_#StackHeapBarrier_17|) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t766~0.base_27| 4) |v_#length_25|) (= 0 v_~y$r_buff1_thd1~0_10) (= 0 v_~y$w_buff1~0_33) (= |v_ULTIMATE.start_main_~#t766~0.offset_21| 0) (= v_~__unbuffered_p2_EBX~0_5 0) (= 0 v_~y$flush_delayed~0_19) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$r_buff1_thd0~0_38) (= v_~y$r_buff0_thd0~0_68 0) (= 0 v_~weak$$choice2~0_35) (= |v_#NULL.offset_5| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t766~0.base_27|) 0) (= v_~y$r_buff0_thd3~0_80 0) (= v_~__unbuffered_p2_EAX~0_9 0) (= 0 v_~__unbuffered_cnt~0_22) (= v_~x~0_12 0) (= v_~y~0_35 0) (= v_~y$w_buff0_used~0_143 0) (= v_~y$r_buff0_thd2~0_21 0) (= 0 |v_#NULL.base_5|) (= 0 v_~y$w_buff0~0_34))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t766~0.base=|v_ULTIMATE.start_main_~#t766~0.base_27|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_13|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_14|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_11|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_15|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_14|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_13|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_16|, ~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_40, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, ~y$flush_delayed~0=v_~y$flush_delayed~0_19, #length=|v_#length_25|, ULTIMATE.start_main_#t~nondet48=|v_ULTIMATE.start_main_#t~nondet48_9|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_5, ULTIMATE.start_main_#t~nondet47=|v_ULTIMATE.start_main_#t~nondet47_9|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_15|, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_14|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_14|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_13|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_15|, ULTIMATE.start_main_~#t767~0.offset=|v_ULTIMATE.start_main_~#t767~0.offset_16|, ~y$w_buff1~0=v_~y$w_buff1~0_33, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ULTIMATE.start_main_~#t766~0.offset=|v_ULTIMATE.start_main_~#t766~0.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_38, ~x~0=v_~x~0_12, ULTIMATE.start_main_~#t768~0.offset=|v_ULTIMATE.start_main_~#t768~0.offset_15|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_143, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_15|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_16|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_14|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_10, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_14|, ULTIMATE.start_main_~#t768~0.base=|v_ULTIMATE.start_main_~#t768~0.base_18|, ~y$w_buff0~0=v_~y$w_buff0~0_34, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_80, ~y~0=v_~y~0_35, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_9|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_14|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_13|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_14|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_16|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_13|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_14|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_68, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ULTIMATE.start_main_~#t767~0.base=|v_ULTIMATE.start_main_~#t767~0.base_19|, ~z~0=v_~z~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_77} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t766~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet48, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet47, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_~#t767~0.offset, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t766~0.offset, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t768~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite69, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite65, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t768~0.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite53, #NULL.base, ULTIMATE.start_main_#t~ite55, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t767~0.base, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 21:00:55,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1003] [1003] L818-1-->L820: Formula: (and (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t767~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t767~0.offset_11| 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t767~0.base_11| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t767~0.base_11|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t767~0.base_11|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t767~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t767~0.base_11|) |v_ULTIMATE.start_main_~#t767~0.offset_11| 1)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t767~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t767~0.offset=|v_ULTIMATE.start_main_~#t767~0.offset_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_17|, ULTIMATE.start_main_~#t767~0.base=|v_ULTIMATE.start_main_~#t767~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t767~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t767~0.base] because there is no mapped edge [2019-12-18 21:00:55,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L820-1-->L822: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t768~0.base_12|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t768~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t768~0.offset_10| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t768~0.base_12|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t768~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t768~0.base_12|) |v_ULTIMATE.start_main_~#t768~0.offset_10| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t768~0.base_12|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t768~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t768~0.base=|v_ULTIMATE.start_main_~#t768~0.base_12|, ULTIMATE.start_main_~#t768~0.offset=|v_ULTIMATE.start_main_~#t768~0.offset_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t768~0.base, ULTIMATE.start_main_~#t768~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 21:00:55,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L4-->L780: Formula: (and (= |v_P2Thread1of1ForFork1_#t~nondet10_6| v_~weak$$choice2~0_30) (= v_~weak$$choice2~0_30 v_~y$flush_delayed~0_10) (= |v_P2Thread1of1ForFork1_#t~nondet9_6| v_~weak$$choice0~0_5) (= v_~y$r_buff0_thd2~0_15 v_~y$r_buff1_thd2~0_13) (= v_~y$r_buff1_thd1~0_4 v_~y$r_buff0_thd1~0_4) (= v_~y$r_buff0_thd3~0_66 1) (= v_~y$r_buff0_thd3~0_67 v_~y$r_buff1_thd3~0_31) (not (= v_P2Thread1of1ForFork1___VERIFIER_assert_~expression_6 0)) (= v_~y$r_buff0_thd0~0_59 v_~y$r_buff1_thd0~0_31) (= v_~y~0_26 v_~y$mem_tmp~0_6)) InVars {P2Thread1of1ForFork1_#t~nondet10=|v_P2Thread1of1ForFork1_#t~nondet10_6|, P2Thread1of1ForFork1_#t~nondet9=|v_P2Thread1of1ForFork1_#t~nondet9_6|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_59, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_15, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, ~y~0=v_~y~0_26, P2Thread1of1ForFork1___VERIFIER_assert_~expression=v_P2Thread1of1ForFork1___VERIFIER_assert_~expression_6} OutVars{P2Thread1of1ForFork1_#t~nondet10=|v_P2Thread1of1ForFork1_#t~nondet10_5|, P2Thread1of1ForFork1_#t~nondet9=|v_P2Thread1of1ForFork1_#t~nondet9_5|, P2Thread1of1ForFork1___VERIFIER_assert_~expression=v_P2Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, ~weak$$choice0~0=v_~weak$$choice0~0_5, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_4, ~y$mem_tmp~0=v_~y$mem_tmp~0_6, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_31, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_66, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_59, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_15, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ~y~0=v_~y~0_26, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#t~nondet10, P2Thread1of1ForFork1_#t~nondet9, ~y$r_buff0_thd3~0, ~y$flush_delayed~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 21:00:55,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L780-2-->L780-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1482757422 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1482757422 256))) (.cse2 (= |P2Thread1of1ForFork1_#t~ite12_Out1482757422| |P2Thread1of1ForFork1_#t~ite11_Out1482757422|))) (or (and (not .cse0) (= ~y$w_buff0~0_In1482757422 |P2Thread1of1ForFork1_#t~ite11_Out1482757422|) (not .cse1) .cse2) (and (= ~y$w_buff1~0_In1482757422 |P2Thread1of1ForFork1_#t~ite11_Out1482757422|) (or .cse0 .cse1) .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1482757422, ~y$w_buff1~0=~y$w_buff1~0_In1482757422, ~y$w_buff0~0=~y$w_buff0~0_In1482757422, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1482757422} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1482757422, ~y$w_buff1~0=~y$w_buff1~0_In1482757422, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out1482757422|, ~y$w_buff0~0=~y$w_buff0~0_In1482757422, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1482757422, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out1482757422|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 21:00:55,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L785-->L786: Formula: (and (= v_~y$r_buff0_thd3~0_63 v_~y$r_buff0_thd3~0_62) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_9|, P2Thread1of1ForFork1_#t~ite26=|v_P2Thread1of1ForFork1_#t~ite26_10|, P2Thread1of1ForFork1_#t~ite27=|v_P2Thread1of1ForFork1_#t~ite27_8|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_62, ~weak$$choice2~0=v_~weak$$choice2~0_29} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 21:00:55,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [956] [956] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1546329354 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite31_Out-1546329354| ~y~0_In-1546329354) .cse0) (and (= |P2Thread1of1ForFork1_#t~ite31_Out-1546329354| ~y$mem_tmp~0_In-1546329354) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1546329354, ~y$flush_delayed~0=~y$flush_delayed~0_In-1546329354, ~y~0=~y~0_In-1546329354} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1546329354, P2Thread1of1ForFork1_#t~ite31=|P2Thread1of1ForFork1_#t~ite31_Out-1546329354|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1546329354, ~y~0=~y~0_In-1546329354} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 21:00:55,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= v_P0Thread1of1ForFork2_~arg.offset_5 |v_P0Thread1of1ForFork2_#in~arg.offset_5|) (= 1 v_~x~0_8) (= v_P0Thread1of1ForFork2_~arg.base_5 |v_P0Thread1of1ForFork2_#in~arg.base_5|) (= 1 v_~z~0_7) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_5, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|, ~z~0=v_~z~0_7, ~x~0=v_~x~0_8, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~z~0, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-18 21:00:55,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1118070973 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In1118070973 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite34_Out1118070973| ~y$w_buff0_used~0_In1118070973) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite34_Out1118070973| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1118070973, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1118070973} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1118070973, P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1118070973|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1118070973} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 21:00:55,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [967] [967] L750-2-->L750-5: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1743778132 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In1743778132 256) 0)) (.cse2 (= |P1Thread1of1ForFork0_#t~ite4_Out1743778132| |P1Thread1of1ForFork0_#t~ite3_Out1743778132|))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite3_Out1743778132| ~y~0_In1743778132) .cse2) (and (not .cse1) (not .cse0) (= ~y$w_buff1~0_In1743778132 |P1Thread1of1ForFork0_#t~ite3_Out1743778132|) .cse2))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1743778132, ~y$w_buff1~0=~y$w_buff1~0_In1743778132, ~y~0=~y~0_In1743778132, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1743778132} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1743778132, ~y$w_buff1~0=~y$w_buff1~0_In1743778132, P1Thread1of1ForFork0_#t~ite3=|P1Thread1of1ForFork0_#t~ite3_Out1743778132|, ~y~0=~y~0_In1743778132, P1Thread1of1ForFork0_#t~ite4=|P1Thread1of1ForFork0_#t~ite4_Out1743778132|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1743778132} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite3, P1Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 21:00:55,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L751-->L751-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1040676746 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1040676746 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite5_Out-1040676746|)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1040676746 |P1Thread1of1ForFork0_#t~ite5_Out-1040676746|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1040676746, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1040676746} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1040676746, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1040676746, P1Thread1of1ForFork0_#t~ite5=|P1Thread1of1ForFork0_#t~ite5_Out-1040676746|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 21:00:55,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L752-->L752-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In339502451 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In339502451 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In339502451 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In339502451 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite6_Out339502451|)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite6_Out339502451| ~y$w_buff1_used~0_In339502451) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In339502451, ~y$w_buff0_used~0=~y$w_buff0_used~0_In339502451, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In339502451, ~y$w_buff1_used~0=~y$w_buff1_used~0_In339502451} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In339502451, ~y$w_buff0_used~0=~y$w_buff0_used~0_In339502451, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In339502451, P1Thread1of1ForFork0_#t~ite6=|P1Thread1of1ForFork0_#t~ite6_Out339502451|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In339502451} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 21:00:55,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L753-->L753-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1316339326 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1316339326 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite7_Out1316339326| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite7_Out1316339326| ~y$r_buff0_thd2~0_In1316339326) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1316339326, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1316339326} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1316339326, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1316339326, P1Thread1of1ForFork0_#t~ite7=|P1Thread1of1ForFork0_#t~ite7_Out1316339326|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 21:00:55,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L754-->L754-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In-279100288 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-279100288 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-279100288 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-279100288 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite8_Out-279100288| ~y$r_buff1_thd2~0_In-279100288) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite8_Out-279100288| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-279100288, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-279100288, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-279100288, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-279100288} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-279100288, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-279100288, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-279100288, P1Thread1of1ForFork0_#t~ite8=|P1Thread1of1ForFork0_#t~ite8_Out-279100288|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-279100288} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 21:00:55,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L797-->L797-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1248193145 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1248193145 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1248193145 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd3~0_In1248193145 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1248193145 |P2Thread1of1ForFork1_#t~ite35_Out1248193145|)) (and (= |P2Thread1of1ForFork1_#t~ite35_Out1248193145| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1248193145, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1248193145, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1248193145, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1248193145} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out1248193145|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1248193145, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1248193145, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1248193145, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1248193145} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 21:00:55,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L798-->L799: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1558221849 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-1558221849 256) 0))) (or (and (= ~y$r_buff0_thd3~0_In-1558221849 ~y$r_buff0_thd3~0_Out-1558221849) (or .cse0 .cse1)) (and (not .cse1) (= 0 ~y$r_buff0_thd3~0_Out-1558221849) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1558221849, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1558221849} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-1558221849|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1558221849, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1558221849} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 21:00:55,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [963] [963] L799-->L799-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-37055418 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In-37055418 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-37055418 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-37055418 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out-37055418| ~y$r_buff1_thd3~0_In-37055418) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork1_#t~ite37_Out-37055418| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-37055418, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-37055418, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-37055418, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-37055418} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-37055418, P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-37055418|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-37055418, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-37055418, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-37055418} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 21:00:55,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L799-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd3~0_34 |v_P2Thread1of1ForFork1_#t~ite37_8|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_34, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 21:00:55,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L754-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= |v_P1Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd2~0_15) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_7|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#t~ite8, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 21:00:55,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L822-1-->L828: Formula: (and (= v_~main$tmp_guard0~0_5 1) (= 3 v_~__unbuffered_cnt~0_12)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 21:00:55,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [971] [971] L828-2-->L828-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In240438853 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In240438853 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite41_Out240438853| ~y$w_buff1~0_In240438853) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite41_Out240438853| ~y~0_In240438853)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In240438853, ~y~0=~y~0_In240438853, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In240438853, ~y$w_buff1_used~0=~y$w_buff1_used~0_In240438853} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out240438853|, ~y$w_buff1~0=~y$w_buff1~0_In240438853, ~y~0=~y~0_In240438853, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In240438853, ~y$w_buff1_used~0=~y$w_buff1_used~0_In240438853} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 21:00:55,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] L828-4-->L829: Formula: (= v_~y~0_24 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ~y~0=v_~y~0_24, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 21:00:55,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1971522392 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1971522392 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite43_Out-1971522392| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1971522392 |ULTIMATE.start_main_#t~ite43_Out-1971522392|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1971522392, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1971522392} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1971522392, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1971522392, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1971522392|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 21:00:55,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L830-->L830-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In804702033 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In804702033 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In804702033 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In804702033 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite44_Out804702033|)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out804702033| ~y$w_buff1_used~0_In804702033) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In804702033, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In804702033, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In804702033, ~y$w_buff1_used~0=~y$w_buff1_used~0_In804702033} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In804702033, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In804702033, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In804702033, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out804702033|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In804702033} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 21:00:55,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-632746506 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-632746506 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-632746506| ~y$r_buff0_thd0~0_In-632746506) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-632746506| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-632746506, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-632746506} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-632746506, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-632746506, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-632746506|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 21:00:55,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L832-->L832-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd0~0_In-1022048646 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1022048646 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1022048646 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1022048646 256)))) (or (and (= ~y$r_buff1_thd0~0_In-1022048646 |ULTIMATE.start_main_#t~ite46_Out-1022048646|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite46_Out-1022048646|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1022048646, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1022048646, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1022048646, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1022048646} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1022048646, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1022048646, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1022048646|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1022048646, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1022048646} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 21:00:55,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L847-->L847-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-2105133474 256) 0))) (or (and .cse0 (= ~y~0_In-2105133474 |ULTIMATE.start_main_#t~ite69_Out-2105133474|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite69_Out-2105133474| ~y$mem_tmp~0_In-2105133474)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-2105133474, ~y$flush_delayed~0=~y$flush_delayed~0_In-2105133474, ~y~0=~y~0_In-2105133474} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-2105133474, ~y$flush_delayed~0=~y$flush_delayed~0_In-2105133474, ULTIMATE.start_main_#t~ite69=|ULTIMATE.start_main_#t~ite69_Out-2105133474|, ~y~0=~y~0_In-2105133474} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite69] because there is no mapped edge [2019-12-18 21:00:55,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1029] [1029] L847-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~y~0_32 |v_ULTIMATE.start_main_#t~ite69_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= (mod v_~main$tmp_guard1~0_14 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= 0 v_~y$flush_delayed~0_16)) InVars {~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_11|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_10|, ~y~0=v_~y~0_32, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite69, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:00:55,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:00:55 BasicIcfg [2019-12-18 21:00:55,800 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:00:55,802 INFO L168 Benchmark]: Toolchain (without parser) took 43019.55 ms. Allocated memory was 144.7 MB in the beginning and 2.0 GB in the end (delta: 1.9 GB). Free memory was 101.8 MB in the beginning and 822.9 MB in the end (delta: -721.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 21:00:55,804 INFO L168 Benchmark]: CDTParser took 1.41 ms. Allocated memory is still 144.7 MB. Free memory was 122.3 MB in the beginning and 122.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-18 21:00:55,805 INFO L168 Benchmark]: CACSL2BoogieTranslator took 766.23 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 101.6 MB in the beginning and 155.1 MB in the end (delta: -53.5 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:00:55,807 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.27 ms. Allocated memory is still 202.9 MB. Free memory was 155.1 MB in the beginning and 151.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-18 21:00:55,807 INFO L168 Benchmark]: Boogie Preprocessor took 45.43 ms. Allocated memory is still 202.9 MB. Free memory was 151.8 MB in the beginning and 149.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:00:55,808 INFO L168 Benchmark]: RCFGBuilder took 1183.87 ms. Allocated memory was 202.9 MB in the beginning and 234.9 MB in the end (delta: 32.0 MB). Free memory was 148.6 MB in the beginning and 205.2 MB in the end (delta: -56.6 MB). Peak memory consumption was 65.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:00:55,809 INFO L168 Benchmark]: TraceAbstraction took 40940.58 ms. Allocated memory was 234.9 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 203.8 MB in the beginning and 822.9 MB in the end (delta: -619.1 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-18 21:00:55,818 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.41 ms. Allocated memory is still 144.7 MB. Free memory was 122.3 MB in the beginning and 122.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 766.23 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 101.6 MB in the beginning and 155.1 MB in the end (delta: -53.5 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 78.27 ms. Allocated memory is still 202.9 MB. Free memory was 155.1 MB in the beginning and 151.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.43 ms. Allocated memory is still 202.9 MB. Free memory was 151.8 MB in the beginning and 149.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1183.87 ms. Allocated memory was 202.9 MB in the beginning and 234.9 MB in the end (delta: 32.0 MB). Free memory was 148.6 MB in the beginning and 205.2 MB in the end (delta: -56.6 MB). Peak memory consumption was 65.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 40940.58 ms. Allocated memory was 234.9 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 203.8 MB in the beginning and 822.9 MB in the end (delta: -619.1 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 205 ProgramPointsBefore, 122 ProgramPointsAfterwards, 257 TransitionsBefore, 145 TransitionsAfterwards, 26988 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 54 ConcurrentYvCompositions, 33 ChoiceCompositions, 9159 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 170994 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t766, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t767, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L822] FCALL, FORK 0 pthread_create(&t768, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L764] 3 y$w_buff1 = y$w_buff0 [L765] 3 y$w_buff0 = 2 [L766] 3 y$w_buff1_used = y$w_buff0_used [L767] 3 y$w_buff0_used = (_Bool)1 [L780] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=7, x=0, y=0, y$flush_delayed=7, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L781] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=7, x=0, y=2, y$flush_delayed=7, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L782] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=7, x=0, y=2, y$flush_delayed=7, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L782] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L783] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=7, x=0, y=2, y$flush_delayed=7, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L783] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L784] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=7, x=0, y=2, y$flush_delayed=7, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L784] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L786] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=7, x=0, y=2, y$flush_delayed=7, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=7, x=0, y=2, y$flush_delayed=7, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 y = y$flush_delayed ? y$mem_tmp : y [L789] 3 y$flush_delayed = (_Bool)0 [L792] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=7, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=7, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 2 x = 2 [L747] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=7, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L750] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=7, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L751] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L752] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L753] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L796] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L797] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L828] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=7, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L829] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L830] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L831] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L832] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L835] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 0 y$flush_delayed = weak$$choice2 [L838] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L839] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L839] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L840] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L840] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L841] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L841] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L842] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L842] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L843] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L843] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L844] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L845] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L845] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 196 locations, 2 error locations. Result: UNSAFE, OverallTime: 40.6s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3028 SDtfs, 3364 SDslu, 8082 SDs, 0 SdLazy, 3938 SolverSat, 184 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 24 SyntacticMatches, 26 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90710occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 16.9s AutomataMinimizationTime, 18 MinimizatonAttempts, 7063 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1097 NumberOfCodeBlocks, 1097 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1005 ConstructedInterpolants, 0 QuantifiedInterpolants, 323505 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...