/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-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix031_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 01:59:58,597 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 01:59:58,600 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 01:59:58,618 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 01:59:58,619 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 01:59:58,622 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 01:59:58,624 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 01:59:58,634 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 01:59:58,638 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 01:59:58,642 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 01:59:58,644 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 01:59:58,646 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 01:59:58,646 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 01:59:58,648 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 01:59:58,650 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 01:59:58,652 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 01:59:58,653 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 01:59:58,654 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 01:59:58,656 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 01:59:58,661 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 01:59:58,664 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 01:59:58,669 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 01:59:58,671 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 01:59:58,672 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 01:59:58,673 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 01:59:58,674 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 01:59:58,674 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 01:59:58,675 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 01:59:58,675 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 01:59:58,676 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 01:59:58,676 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 01:59:58,677 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 01:59:58,677 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 01:59:58,678 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 01:59:58,679 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 01:59:58,679 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 01:59:58,680 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 01:59:58,680 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 01:59:58,680 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 01:59:58,681 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 01:59:58,682 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 01:59:58,682 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-NoLbe.epf [2019-12-19 01:59:58,696 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 01:59:58,696 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 01:59:58,698 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 01:59:58,698 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 01:59:58,698 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 01:59:58,698 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 01:59:58,699 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 01:59:58,699 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 01:59:58,699 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 01:59:58,699 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 01:59:58,699 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 01:59:58,699 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 01:59:58,700 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 01:59:58,700 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 01:59:58,700 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 01:59:58,700 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 01:59:58,700 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 01:59:58,701 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 01:59:58,701 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 01:59:58,701 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 01:59:58,701 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 01:59:58,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 01:59:58,702 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 01:59:58,702 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 01:59:58,702 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 01:59:58,702 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 01:59:58,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 01:59:58,702 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 01:59:58,703 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 01:59:58,703 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 01:59:58,980 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 01:59:58,993 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 01:59:58,997 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 01:59:58,998 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 01:59:58,999 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 01:59:58,999 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031_power.opt.i [2019-12-19 01:59:59,082 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49db0b942/d9e0d580bc1a4ae9b4975e25893ca8cd/FLAG07eb594a9 [2019-12-19 01:59:59,668 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 01:59:59,669 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031_power.opt.i [2019-12-19 01:59:59,684 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49db0b942/d9e0d580bc1a4ae9b4975e25893ca8cd/FLAG07eb594a9 [2019-12-19 01:59:59,987 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49db0b942/d9e0d580bc1a4ae9b4975e25893ca8cd [2019-12-19 01:59:59,997 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 01:59:59,999 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 02:00:00,000 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 02:00:00,000 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 02:00:00,007 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 02:00:00,008 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:59:59" (1/1) ... [2019-12-19 02:00:00,011 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11d40257 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:00:00, skipping insertion in model container [2019-12-19 02:00:00,011 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:59:59" (1/1) ... [2019-12-19 02:00:00,019 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 02:00:00,082 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 02:00:00,558 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 02:00:00,572 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 02:00:00,662 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 02:00:00,741 INFO L208 MainTranslator]: Completed translation [2019-12-19 02:00:00,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:00:00 WrapperNode [2019-12-19 02:00:00,742 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 02:00:00,743 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 02:00:00,743 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 02:00:00,743 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 02:00:00,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:00:00" (1/1) ... [2019-12-19 02:00:00,771 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:00:00" (1/1) ... [2019-12-19 02:00:00,804 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 02:00:00,805 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 02:00:00,805 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 02:00:00,805 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 02:00:00,814 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:00:00" (1/1) ... [2019-12-19 02:00:00,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:00:00" (1/1) ... [2019-12-19 02:00:00,819 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:00:00" (1/1) ... [2019-12-19 02:00:00,819 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:00:00" (1/1) ... [2019-12-19 02:00:00,828 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:00:00" (1/1) ... [2019-12-19 02:00:00,832 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:00:00" (1/1) ... [2019-12-19 02:00:00,836 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:00:00" (1/1) ... [2019-12-19 02:00:00,841 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 02:00:00,841 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 02:00:00,841 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 02:00:00,842 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 02:00:00,842 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:00:00" (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-19 02:00:00,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 02:00:00,907 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 02:00:00,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 02:00:00,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 02:00:00,907 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 02:00:00,908 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 02:00:00,908 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 02:00:00,908 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 02:00:00,908 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 02:00:00,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 02:00:00,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 02:00:00,910 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-19 02:00:01,650 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 02:00:01,651 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 02:00:01,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 02:00:01 BoogieIcfgContainer [2019-12-19 02:00:01,653 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 02:00:01,654 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 02:00:01,655 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 02:00:01,659 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 02:00:01,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 01:59:59" (1/3) ... [2019-12-19 02:00:01,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16e89d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 02:00:01, skipping insertion in model container [2019-12-19 02:00:01,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:00:00" (2/3) ... [2019-12-19 02:00:01,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16e89d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 02:00:01, skipping insertion in model container [2019-12-19 02:00:01,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 02:00:01" (3/3) ... [2019-12-19 02:00:01,668 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_power.opt.i [2019-12-19 02:00:01,680 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 02:00:01,680 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 02:00:01,692 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 02:00:01,693 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 02:00:01,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,731 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,732 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,760 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,760 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,760 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,761 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,761 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,773 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,775 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,781 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,782 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,782 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:01,800 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 02:00:01,838 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 02:00:01,838 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 02:00:01,839 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 02:00:01,839 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 02:00:01,839 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 02:00:01,839 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 02:00:01,839 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 02:00:01,839 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 02:00:01,854 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 139 places, 167 transitions [2019-12-19 02:00:03,342 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25979 states. [2019-12-19 02:00:03,344 INFO L276 IsEmpty]: Start isEmpty. Operand 25979 states. [2019-12-19 02:00:03,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-19 02:00:03,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:03,355 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] [2019-12-19 02:00:03,355 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:03,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:03,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1982457826, now seen corresponding path program 1 times [2019-12-19 02:00:03,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:03,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737990412] [2019-12-19 02:00:03,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:03,677 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-19 02:00:03,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737990412] [2019-12-19 02:00:03,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:03,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:00:03,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692907098] [2019-12-19 02:00:03,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:00:03,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:03,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:00:03,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:00:03,704 INFO L87 Difference]: Start difference. First operand 25979 states. Second operand 4 states. [2019-12-19 02:00:05,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:05,206 INFO L93 Difference]: Finished difference Result 26619 states and 102124 transitions. [2019-12-19 02:00:05,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 02:00:05,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-19 02:00:05,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:05,394 INFO L225 Difference]: With dead ends: 26619 [2019-12-19 02:00:05,395 INFO L226 Difference]: Without dead ends: 20363 [2019-12-19 02:00:05,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:00:05,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20363 states. [2019-12-19 02:00:06,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20363 to 20363. [2019-12-19 02:00:06,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20363 states. [2019-12-19 02:00:06,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20363 states to 20363 states and 78428 transitions. [2019-12-19 02:00:06,461 INFO L78 Accepts]: Start accepts. Automaton has 20363 states and 78428 transitions. Word has length 42 [2019-12-19 02:00:06,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:06,462 INFO L462 AbstractCegarLoop]: Abstraction has 20363 states and 78428 transitions. [2019-12-19 02:00:06,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:00:06,462 INFO L276 IsEmpty]: Start isEmpty. Operand 20363 states and 78428 transitions. [2019-12-19 02:00:06,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-19 02:00:06,470 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:06,470 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] [2019-12-19 02:00:06,471 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:06,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:06,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1965107530, now seen corresponding path program 1 times [2019-12-19 02:00:06,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:06,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092653673] [2019-12-19 02:00:06,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:06,600 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-19 02:00:06,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092653673] [2019-12-19 02:00:06,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:06,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:00:06,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298881560] [2019-12-19 02:00:06,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:00:06,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:06,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:00:06,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:00:06,604 INFO L87 Difference]: Start difference. First operand 20363 states and 78428 transitions. Second operand 5 states. [2019-12-19 02:00:07,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:07,921 INFO L93 Difference]: Finished difference Result 31841 states and 116045 transitions. [2019-12-19 02:00:07,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:00:07,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-12-19 02:00:07,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:08,070 INFO L225 Difference]: With dead ends: 31841 [2019-12-19 02:00:08,070 INFO L226 Difference]: Without dead ends: 31289 [2019-12-19 02:00:08,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:00:08,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31289 states. [2019-12-19 02:00:10,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31289 to 29708. [2019-12-19 02:00:10,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29708 states. [2019-12-19 02:00:10,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29708 states to 29708 states and 109522 transitions. [2019-12-19 02:00:10,293 INFO L78 Accepts]: Start accepts. Automaton has 29708 states and 109522 transitions. Word has length 50 [2019-12-19 02:00:10,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:10,296 INFO L462 AbstractCegarLoop]: Abstraction has 29708 states and 109522 transitions. [2019-12-19 02:00:10,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:00:10,297 INFO L276 IsEmpty]: Start isEmpty. Operand 29708 states and 109522 transitions. [2019-12-19 02:00:10,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-19 02:00:10,501 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:10,502 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] [2019-12-19 02:00:10,502 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:10,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:10,502 INFO L82 PathProgramCache]: Analyzing trace with hash -2091945449, now seen corresponding path program 1 times [2019-12-19 02:00:10,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:10,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586575213] [2019-12-19 02:00:10,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:10,646 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-19 02:00:10,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586575213] [2019-12-19 02:00:10,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:10,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:00:10,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415768025] [2019-12-19 02:00:10,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:00:10,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:10,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:00:10,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:00:10,649 INFO L87 Difference]: Start difference. First operand 29708 states and 109522 transitions. Second operand 5 states. [2019-12-19 02:00:11,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:11,182 INFO L93 Difference]: Finished difference Result 38699 states and 139694 transitions. [2019-12-19 02:00:11,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:00:11,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-19 02:00:11,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:11,336 INFO L225 Difference]: With dead ends: 38699 [2019-12-19 02:00:11,337 INFO L226 Difference]: Without dead ends: 38251 [2019-12-19 02:00:11,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:00:11,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38251 states. [2019-12-19 02:00:13,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38251 to 32954. [2019-12-19 02:00:13,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32954 states. [2019-12-19 02:00:13,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32954 states to 32954 states and 120531 transitions. [2019-12-19 02:00:13,673 INFO L78 Accepts]: Start accepts. Automaton has 32954 states and 120531 transitions. Word has length 51 [2019-12-19 02:00:13,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:13,674 INFO L462 AbstractCegarLoop]: Abstraction has 32954 states and 120531 transitions. [2019-12-19 02:00:13,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:00:13,674 INFO L276 IsEmpty]: Start isEmpty. Operand 32954 states and 120531 transitions. [2019-12-19 02:00:13,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-19 02:00:13,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:13,687 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] [2019-12-19 02:00:13,687 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:13,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:13,688 INFO L82 PathProgramCache]: Analyzing trace with hash 568644221, now seen corresponding path program 1 times [2019-12-19 02:00:13,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:13,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507812822] [2019-12-19 02:00:13,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:13,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:13,746 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-19 02:00:13,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507812822] [2019-12-19 02:00:13,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:13,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 02:00:13,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331942961] [2019-12-19 02:00:13,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 02:00:13,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:13,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 02:00:13,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:00:13,750 INFO L87 Difference]: Start difference. First operand 32954 states and 120531 transitions. Second operand 3 states. [2019-12-19 02:00:14,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:14,246 INFO L93 Difference]: Finished difference Result 42415 states and 152022 transitions. [2019-12-19 02:00:14,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 02:00:14,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-19 02:00:14,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:14,378 INFO L225 Difference]: With dead ends: 42415 [2019-12-19 02:00:14,378 INFO L226 Difference]: Without dead ends: 42415 [2019-12-19 02:00:14,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:00:14,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42415 states. [2019-12-19 02:00:16,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42415 to 37668. [2019-12-19 02:00:16,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37668 states. [2019-12-19 02:00:16,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37668 states to 37668 states and 136335 transitions. [2019-12-19 02:00:16,988 INFO L78 Accepts]: Start accepts. Automaton has 37668 states and 136335 transitions. Word has length 53 [2019-12-19 02:00:16,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:16,989 INFO L462 AbstractCegarLoop]: Abstraction has 37668 states and 136335 transitions. [2019-12-19 02:00:16,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 02:00:16,989 INFO L276 IsEmpty]: Start isEmpty. Operand 37668 states and 136335 transitions. [2019-12-19 02:00:17,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-19 02:00:17,006 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:17,006 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] [2019-12-19 02:00:17,006 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:17,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:17,007 INFO L82 PathProgramCache]: Analyzing trace with hash -208895999, now seen corresponding path program 1 times [2019-12-19 02:00:17,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:17,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153018035] [2019-12-19 02:00:17,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:17,138 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-19 02:00:17,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153018035] [2019-12-19 02:00:17,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:17,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:00:17,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783494976] [2019-12-19 02:00:17,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:00:17,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:17,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:00:17,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:00:17,141 INFO L87 Difference]: Start difference. First operand 37668 states and 136335 transitions. Second operand 6 states. [2019-12-19 02:00:17,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:17,923 INFO L93 Difference]: Finished difference Result 51814 states and 185563 transitions. [2019-12-19 02:00:17,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:00:17,924 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-19 02:00:17,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:18,078 INFO L225 Difference]: With dead ends: 51814 [2019-12-19 02:00:18,079 INFO L226 Difference]: Without dead ends: 51014 [2019-12-19 02:00:18,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:00:18,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51014 states. [2019-12-19 02:00:19,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51014 to 47936. [2019-12-19 02:00:19,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47936 states. [2019-12-19 02:00:19,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47936 states to 47936 states and 172264 transitions. [2019-12-19 02:00:19,353 INFO L78 Accepts]: Start accepts. Automaton has 47936 states and 172264 transitions. Word has length 57 [2019-12-19 02:00:19,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:19,353 INFO L462 AbstractCegarLoop]: Abstraction has 47936 states and 172264 transitions. [2019-12-19 02:00:19,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:00:19,354 INFO L276 IsEmpty]: Start isEmpty. Operand 47936 states and 172264 transitions. [2019-12-19 02:00:19,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-19 02:00:19,373 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:19,375 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] [2019-12-19 02:00:19,375 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:19,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:19,376 INFO L82 PathProgramCache]: Analyzing trace with hash -2005847358, now seen corresponding path program 1 times [2019-12-19 02:00:19,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:19,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123691456] [2019-12-19 02:00:19,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:19,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:19,519 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-19 02:00:19,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123691456] [2019-12-19 02:00:19,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:19,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:00:19,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540894743] [2019-12-19 02:00:19,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:00:19,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:19,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:00:19,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:00:19,524 INFO L87 Difference]: Start difference. First operand 47936 states and 172264 transitions. Second operand 7 states. [2019-12-19 02:00:21,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:21,093 INFO L93 Difference]: Finished difference Result 68550 states and 236789 transitions. [2019-12-19 02:00:21,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 02:00:21,094 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-19 02:00:21,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:21,242 INFO L225 Difference]: With dead ends: 68550 [2019-12-19 02:00:21,242 INFO L226 Difference]: Without dead ends: 68550 [2019-12-19 02:00:21,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 02:00:21,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68550 states. [2019-12-19 02:00:24,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68550 to 56774. [2019-12-19 02:00:24,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56774 states. [2019-12-19 02:00:24,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56774 states to 56774 states and 199367 transitions. [2019-12-19 02:00:24,504 INFO L78 Accepts]: Start accepts. Automaton has 56774 states and 199367 transitions. Word has length 57 [2019-12-19 02:00:24,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:24,504 INFO L462 AbstractCegarLoop]: Abstraction has 56774 states and 199367 transitions. [2019-12-19 02:00:24,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:00:24,504 INFO L276 IsEmpty]: Start isEmpty. Operand 56774 states and 199367 transitions. [2019-12-19 02:00:24,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-19 02:00:24,519 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:24,519 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] [2019-12-19 02:00:24,519 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:24,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:24,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1118343677, now seen corresponding path program 1 times [2019-12-19 02:00:24,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:24,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527560043] [2019-12-19 02:00:24,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:24,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:24,608 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-19 02:00:24,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527560043] [2019-12-19 02:00:24,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:24,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:00:24,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718668175] [2019-12-19 02:00:24,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:00:24,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:24,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:00:24,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:00:24,610 INFO L87 Difference]: Start difference. First operand 56774 states and 199367 transitions. Second operand 4 states. [2019-12-19 02:00:24,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:24,680 INFO L93 Difference]: Finished difference Result 10469 states and 32215 transitions. [2019-12-19 02:00:24,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:00:24,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-19 02:00:24,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:24,699 INFO L225 Difference]: With dead ends: 10469 [2019-12-19 02:00:24,699 INFO L226 Difference]: Without dead ends: 9223 [2019-12-19 02:00:24,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-19 02:00:24,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9223 states. [2019-12-19 02:00:24,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9223 to 9175. [2019-12-19 02:00:24,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9175 states. [2019-12-19 02:00:24,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9175 states to 9175 states and 27926 transitions. [2019-12-19 02:00:24,824 INFO L78 Accepts]: Start accepts. Automaton has 9175 states and 27926 transitions. Word has length 57 [2019-12-19 02:00:24,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:24,824 INFO L462 AbstractCegarLoop]: Abstraction has 9175 states and 27926 transitions. [2019-12-19 02:00:24,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:00:24,824 INFO L276 IsEmpty]: Start isEmpty. Operand 9175 states and 27926 transitions. [2019-12-19 02:00:24,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-19 02:00:24,826 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:24,827 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] [2019-12-19 02:00:24,827 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:24,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:24,827 INFO L82 PathProgramCache]: Analyzing trace with hash -195256504, now seen corresponding path program 1 times [2019-12-19 02:00:24,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:24,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426942435] [2019-12-19 02:00:24,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:24,941 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-19 02:00:24,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426942435] [2019-12-19 02:00:24,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:24,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:00:24,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700904703] [2019-12-19 02:00:24,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:00:24,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:24,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:00:24,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:00:24,944 INFO L87 Difference]: Start difference. First operand 9175 states and 27926 transitions. Second operand 6 states. [2019-12-19 02:00:25,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:25,387 INFO L93 Difference]: Finished difference Result 11222 states and 33697 transitions. [2019-12-19 02:00:25,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 02:00:25,388 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-19 02:00:25,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:25,794 INFO L225 Difference]: With dead ends: 11222 [2019-12-19 02:00:25,795 INFO L226 Difference]: Without dead ends: 11135 [2019-12-19 02:00:25,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-19 02:00:25,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11135 states. [2019-12-19 02:00:25,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11135 to 9316. [2019-12-19 02:00:25,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9316 states. [2019-12-19 02:00:25,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9316 states to 9316 states and 28348 transitions. [2019-12-19 02:00:25,940 INFO L78 Accepts]: Start accepts. Automaton has 9316 states and 28348 transitions. Word has length 57 [2019-12-19 02:00:25,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:25,940 INFO L462 AbstractCegarLoop]: Abstraction has 9316 states and 28348 transitions. [2019-12-19 02:00:25,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:00:25,940 INFO L276 IsEmpty]: Start isEmpty. Operand 9316 states and 28348 transitions. [2019-12-19 02:00:25,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 02:00:25,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:25,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] [2019-12-19 02:00:25,946 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:25,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:25,946 INFO L82 PathProgramCache]: Analyzing trace with hash 141668315, now seen corresponding path program 1 times [2019-12-19 02:00:25,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:25,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781263123] [2019-12-19 02:00:25,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:26,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:00:26,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781263123] [2019-12-19 02:00:26,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:26,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:00:26,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595256994] [2019-12-19 02:00:26,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:00:26,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:26,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:00:26,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:00:26,018 INFO L87 Difference]: Start difference. First operand 9316 states and 28348 transitions. Second operand 4 states. [2019-12-19 02:00:26,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:26,210 INFO L93 Difference]: Finished difference Result 10891 states and 33040 transitions. [2019-12-19 02:00:26,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:00:26,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-19 02:00:26,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:26,237 INFO L225 Difference]: With dead ends: 10891 [2019-12-19 02:00:26,238 INFO L226 Difference]: Without dead ends: 10891 [2019-12-19 02:00:26,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-19 02:00:26,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10891 states. [2019-12-19 02:00:26,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10891 to 9883. [2019-12-19 02:00:26,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9883 states. [2019-12-19 02:00:26,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9883 states to 9883 states and 30019 transitions. [2019-12-19 02:00:26,461 INFO L78 Accepts]: Start accepts. Automaton has 9883 states and 30019 transitions. Word has length 67 [2019-12-19 02:00:26,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:26,461 INFO L462 AbstractCegarLoop]: Abstraction has 9883 states and 30019 transitions. [2019-12-19 02:00:26,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:00:26,462 INFO L276 IsEmpty]: Start isEmpty. Operand 9883 states and 30019 transitions. [2019-12-19 02:00:26,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 02:00:26,469 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:26,469 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] [2019-12-19 02:00:26,470 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:26,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:26,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1884478650, now seen corresponding path program 1 times [2019-12-19 02:00:26,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:26,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500776479] [2019-12-19 02:00:26,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:26,586 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-19 02:00:26,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500776479] [2019-12-19 02:00:26,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:26,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:00:26,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174805219] [2019-12-19 02:00:26,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:00:26,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:26,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:00:26,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:00:26,588 INFO L87 Difference]: Start difference. First operand 9883 states and 30019 transitions. Second operand 6 states. [2019-12-19 02:00:27,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:27,103 INFO L93 Difference]: Finished difference Result 12789 states and 38229 transitions. [2019-12-19 02:00:27,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-19 02:00:27,103 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-19 02:00:27,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:27,121 INFO L225 Difference]: With dead ends: 12789 [2019-12-19 02:00:27,121 INFO L226 Difference]: Without dead ends: 12741 [2019-12-19 02:00:27,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-12-19 02:00:27,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12741 states. [2019-12-19 02:00:27,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12741 to 10622. [2019-12-19 02:00:27,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10622 states. [2019-12-19 02:00:27,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10622 states to 10622 states and 32072 transitions. [2019-12-19 02:00:27,274 INFO L78 Accepts]: Start accepts. Automaton has 10622 states and 32072 transitions. Word has length 67 [2019-12-19 02:00:27,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:27,275 INFO L462 AbstractCegarLoop]: Abstraction has 10622 states and 32072 transitions. [2019-12-19 02:00:27,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:00:27,275 INFO L276 IsEmpty]: Start isEmpty. Operand 10622 states and 32072 transitions. [2019-12-19 02:00:27,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 02:00:27,282 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:27,282 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] [2019-12-19 02:00:27,282 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:27,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:27,283 INFO L82 PathProgramCache]: Analyzing trace with hash -17868351, now seen corresponding path program 1 times [2019-12-19 02:00:27,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:27,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836311875] [2019-12-19 02:00:27,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:27,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:27,340 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-19 02:00:27,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836311875] [2019-12-19 02:00:27,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:27,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:00:27,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905910968] [2019-12-19 02:00:27,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:00:27,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:27,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:00:27,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:00:27,342 INFO L87 Difference]: Start difference. First operand 10622 states and 32072 transitions. Second operand 4 states. [2019-12-19 02:00:27,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:27,579 INFO L93 Difference]: Finished difference Result 13324 states and 39674 transitions. [2019-12-19 02:00:27,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 02:00:27,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-19 02:00:27,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:27,598 INFO L225 Difference]: With dead ends: 13324 [2019-12-19 02:00:27,598 INFO L226 Difference]: Without dead ends: 13324 [2019-12-19 02:00:27,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:00:27,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13324 states. [2019-12-19 02:00:27,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13324 to 12178. [2019-12-19 02:00:27,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12178 states. [2019-12-19 02:00:27,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12178 states to 12178 states and 36363 transitions. [2019-12-19 02:00:27,772 INFO L78 Accepts]: Start accepts. Automaton has 12178 states and 36363 transitions. Word has length 69 [2019-12-19 02:00:27,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:27,773 INFO L462 AbstractCegarLoop]: Abstraction has 12178 states and 36363 transitions. [2019-12-19 02:00:27,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:00:27,773 INFO L276 IsEmpty]: Start isEmpty. Operand 12178 states and 36363 transitions. [2019-12-19 02:00:27,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 02:00:27,782 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:27,782 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] [2019-12-19 02:00:27,782 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:27,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:27,782 INFO L82 PathProgramCache]: Analyzing trace with hash -2095077694, now seen corresponding path program 1 times [2019-12-19 02:00:27,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:27,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296949861] [2019-12-19 02:00:27,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:28,546 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-19 02:00:28,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296949861] [2019-12-19 02:00:28,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:28,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 02:00:28,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137876862] [2019-12-19 02:00:28,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 02:00:28,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:28,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 02:00:28,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:00:28,548 INFO L87 Difference]: Start difference. First operand 12178 states and 36363 transitions. Second operand 3 states. [2019-12-19 02:00:28,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:28,787 INFO L93 Difference]: Finished difference Result 12704 states and 37768 transitions. [2019-12-19 02:00:28,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 02:00:28,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-19 02:00:28,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:28,819 INFO L225 Difference]: With dead ends: 12704 [2019-12-19 02:00:28,819 INFO L226 Difference]: Without dead ends: 12704 [2019-12-19 02:00:28,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:00:28,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12704 states. [2019-12-19 02:00:29,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12704 to 12466. [2019-12-19 02:00:29,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12466 states. [2019-12-19 02:00:29,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12466 states to 12466 states and 37127 transitions. [2019-12-19 02:00:29,098 INFO L78 Accepts]: Start accepts. Automaton has 12466 states and 37127 transitions. Word has length 69 [2019-12-19 02:00:29,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:29,098 INFO L462 AbstractCegarLoop]: Abstraction has 12466 states and 37127 transitions. [2019-12-19 02:00:29,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 02:00:29,099 INFO L276 IsEmpty]: Start isEmpty. Operand 12466 states and 37127 transitions. [2019-12-19 02:00:29,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-19 02:00:29,113 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:29,113 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 02:00:29,114 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:29,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:29,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1715982354, now seen corresponding path program 1 times [2019-12-19 02:00:29,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:29,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618397222] [2019-12-19 02:00:29,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:29,214 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-19 02:00:29,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618397222] [2019-12-19 02:00:29,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:29,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:00:29,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485254428] [2019-12-19 02:00:29,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:00:29,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:29,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:00:29,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:00:29,217 INFO L87 Difference]: Start difference. First operand 12466 states and 37127 transitions. Second operand 6 states. [2019-12-19 02:00:29,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:29,767 INFO L93 Difference]: Finished difference Result 13737 states and 40366 transitions. [2019-12-19 02:00:29,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:00:29,767 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-12-19 02:00:29,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:29,787 INFO L225 Difference]: With dead ends: 13737 [2019-12-19 02:00:29,788 INFO L226 Difference]: Without dead ends: 13737 [2019-12-19 02:00:29,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:00:29,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13737 states. [2019-12-19 02:00:29,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13737 to 13251. [2019-12-19 02:00:29,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13251 states. [2019-12-19 02:00:29,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13251 states to 13251 states and 39082 transitions. [2019-12-19 02:00:29,971 INFO L78 Accepts]: Start accepts. Automaton has 13251 states and 39082 transitions. Word has length 71 [2019-12-19 02:00:29,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:29,971 INFO L462 AbstractCegarLoop]: Abstraction has 13251 states and 39082 transitions. [2019-12-19 02:00:29,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:00:29,971 INFO L276 IsEmpty]: Start isEmpty. Operand 13251 states and 39082 transitions. [2019-12-19 02:00:29,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-19 02:00:29,983 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:29,983 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-19 02:00:29,984 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:29,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:29,984 INFO L82 PathProgramCache]: Analyzing trace with hash 501775599, now seen corresponding path program 1 times [2019-12-19 02:00:29,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:29,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285375615] [2019-12-19 02:00:29,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:30,093 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-19 02:00:30,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285375615] [2019-12-19 02:00:30,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:30,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:00:30,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254654614] [2019-12-19 02:00:30,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:00:30,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:30,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:00:30,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:00:30,097 INFO L87 Difference]: Start difference. First operand 13251 states and 39082 transitions. Second operand 6 states. [2019-12-19 02:00:30,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:30,554 INFO L93 Difference]: Finished difference Result 15574 states and 44592 transitions. [2019-12-19 02:00:30,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 02:00:30,555 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-12-19 02:00:30,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:30,575 INFO L225 Difference]: With dead ends: 15574 [2019-12-19 02:00:30,576 INFO L226 Difference]: Without dead ends: 15574 [2019-12-19 02:00:30,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-19 02:00:30,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15574 states. [2019-12-19 02:00:30,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15574 to 13825. [2019-12-19 02:00:30,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13825 states. [2019-12-19 02:00:30,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13825 states to 13825 states and 39932 transitions. [2019-12-19 02:00:30,762 INFO L78 Accepts]: Start accepts. Automaton has 13825 states and 39932 transitions. Word has length 71 [2019-12-19 02:00:30,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:30,762 INFO L462 AbstractCegarLoop]: Abstraction has 13825 states and 39932 transitions. [2019-12-19 02:00:30,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:00:30,762 INFO L276 IsEmpty]: Start isEmpty. Operand 13825 states and 39932 transitions. [2019-12-19 02:00:30,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-19 02:00:30,775 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:30,775 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-19 02:00:30,775 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:30,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:30,776 INFO L82 PathProgramCache]: Analyzing trace with hash 713126512, now seen corresponding path program 1 times [2019-12-19 02:00:30,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:30,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847166124] [2019-12-19 02:00:30,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:30,965 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-19 02:00:30,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847166124] [2019-12-19 02:00:30,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:30,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:00:30,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146103995] [2019-12-19 02:00:30,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:00:30,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:30,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:00:30,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:00:30,967 INFO L87 Difference]: Start difference. First operand 13825 states and 39932 transitions. Second operand 5 states. [2019-12-19 02:00:31,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:31,331 INFO L93 Difference]: Finished difference Result 17386 states and 50011 transitions. [2019-12-19 02:00:31,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:00:31,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-19 02:00:31,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:31,356 INFO L225 Difference]: With dead ends: 17386 [2019-12-19 02:00:31,356 INFO L226 Difference]: Without dead ends: 17386 [2019-12-19 02:00:31,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:00:31,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17386 states. [2019-12-19 02:00:31,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17386 to 14863. [2019-12-19 02:00:31,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14863 states. [2019-12-19 02:00:31,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14863 states to 14863 states and 42564 transitions. [2019-12-19 02:00:31,559 INFO L78 Accepts]: Start accepts. Automaton has 14863 states and 42564 transitions. Word has length 71 [2019-12-19 02:00:31,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:31,559 INFO L462 AbstractCegarLoop]: Abstraction has 14863 states and 42564 transitions. [2019-12-19 02:00:31,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:00:31,559 INFO L276 IsEmpty]: Start isEmpty. Operand 14863 states and 42564 transitions. [2019-12-19 02:00:31,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-19 02:00:31,569 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:31,569 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-19 02:00:31,569 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:31,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:31,570 INFO L82 PathProgramCache]: Analyzing trace with hash 202592335, now seen corresponding path program 1 times [2019-12-19 02:00:31,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:31,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877059663] [2019-12-19 02:00:31,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:31,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:31,637 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-19 02:00:31,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877059663] [2019-12-19 02:00:31,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:31,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:00:31,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26197059] [2019-12-19 02:00:31,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:00:31,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:31,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:00:31,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:00:31,640 INFO L87 Difference]: Start difference. First operand 14863 states and 42564 transitions. Second operand 5 states. [2019-12-19 02:00:32,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:32,064 INFO L93 Difference]: Finished difference Result 19768 states and 56511 transitions. [2019-12-19 02:00:32,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:00:32,065 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-19 02:00:32,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:32,092 INFO L225 Difference]: With dead ends: 19768 [2019-12-19 02:00:32,092 INFO L226 Difference]: Without dead ends: 19768 [2019-12-19 02:00:32,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:00:32,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19768 states. [2019-12-19 02:00:32,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19768 to 15768. [2019-12-19 02:00:32,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15768 states. [2019-12-19 02:00:32,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15768 states to 15768 states and 45150 transitions. [2019-12-19 02:00:32,324 INFO L78 Accepts]: Start accepts. Automaton has 15768 states and 45150 transitions. Word has length 71 [2019-12-19 02:00:32,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:32,324 INFO L462 AbstractCegarLoop]: Abstraction has 15768 states and 45150 transitions. [2019-12-19 02:00:32,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:00:32,324 INFO L276 IsEmpty]: Start isEmpty. Operand 15768 states and 45150 transitions. [2019-12-19 02:00:32,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-19 02:00:32,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:32,334 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-19 02:00:32,334 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:32,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:32,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1604862128, now seen corresponding path program 1 times [2019-12-19 02:00:32,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:32,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177105129] [2019-12-19 02:00:32,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:32,403 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-19 02:00:32,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177105129] [2019-12-19 02:00:32,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:32,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:00:32,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479711134] [2019-12-19 02:00:32,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:00:32,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:32,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:00:32,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:00:32,405 INFO L87 Difference]: Start difference. First operand 15768 states and 45150 transitions. Second operand 4 states. [2019-12-19 02:00:32,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:32,911 INFO L93 Difference]: Finished difference Result 20664 states and 59358 transitions. [2019-12-19 02:00:32,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:00:32,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-12-19 02:00:32,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:32,937 INFO L225 Difference]: With dead ends: 20664 [2019-12-19 02:00:32,937 INFO L226 Difference]: Without dead ends: 20388 [2019-12-19 02:00:32,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-19 02:00:32,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20388 states. [2019-12-19 02:00:33,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20388 to 18951. [2019-12-19 02:00:33,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18951 states. [2019-12-19 02:00:33,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18951 states to 18951 states and 54439 transitions. [2019-12-19 02:00:33,383 INFO L78 Accepts]: Start accepts. Automaton has 18951 states and 54439 transitions. Word has length 71 [2019-12-19 02:00:33,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:33,383 INFO L462 AbstractCegarLoop]: Abstraction has 18951 states and 54439 transitions. [2019-12-19 02:00:33,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:00:33,383 INFO L276 IsEmpty]: Start isEmpty. Operand 18951 states and 54439 transitions. [2019-12-19 02:00:33,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-19 02:00:33,394 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:33,394 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-19 02:00:33,394 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:33,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:33,394 INFO L82 PathProgramCache]: Analyzing trace with hash 893153809, now seen corresponding path program 1 times [2019-12-19 02:00:33,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:33,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694321150] [2019-12-19 02:00:33,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:33,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:33,514 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-19 02:00:33,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694321150] [2019-12-19 02:00:33,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:33,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-19 02:00:33,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515749771] [2019-12-19 02:00:33,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-19 02:00:33,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:33,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-19 02:00:33,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-19 02:00:33,516 INFO L87 Difference]: Start difference. First operand 18951 states and 54439 transitions. Second operand 9 states. [2019-12-19 02:00:34,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:34,278 INFO L93 Difference]: Finished difference Result 24278 states and 69372 transitions. [2019-12-19 02:00:34,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 02:00:34,279 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2019-12-19 02:00:34,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:34,313 INFO L225 Difference]: With dead ends: 24278 [2019-12-19 02:00:34,314 INFO L226 Difference]: Without dead ends: 24278 [2019-12-19 02:00:34,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-19 02:00:34,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24278 states. [2019-12-19 02:00:34,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24278 to 20616. [2019-12-19 02:00:34,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20616 states. [2019-12-19 02:00:34,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20616 states to 20616 states and 59237 transitions. [2019-12-19 02:00:34,595 INFO L78 Accepts]: Start accepts. Automaton has 20616 states and 59237 transitions. Word has length 71 [2019-12-19 02:00:34,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:34,595 INFO L462 AbstractCegarLoop]: Abstraction has 20616 states and 59237 transitions. [2019-12-19 02:00:34,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-19 02:00:34,595 INFO L276 IsEmpty]: Start isEmpty. Operand 20616 states and 59237 transitions. [2019-12-19 02:00:34,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-19 02:00:34,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:34,606 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-19 02:00:34,607 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:34,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:34,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1780657490, now seen corresponding path program 1 times [2019-12-19 02:00:34,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:34,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650502764] [2019-12-19 02:00:34,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:34,693 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-19 02:00:34,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650502764] [2019-12-19 02:00:34,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:34,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:00:34,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412655895] [2019-12-19 02:00:34,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:00:34,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:34,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:00:34,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:00:34,696 INFO L87 Difference]: Start difference. First operand 20616 states and 59237 transitions. Second operand 5 states. [2019-12-19 02:00:34,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:34,764 INFO L93 Difference]: Finished difference Result 6192 states and 14494 transitions. [2019-12-19 02:00:34,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 02:00:34,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-19 02:00:34,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:34,772 INFO L225 Difference]: With dead ends: 6192 [2019-12-19 02:00:34,773 INFO L226 Difference]: Without dead ends: 5020 [2019-12-19 02:00:34,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:00:34,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5020 states. [2019-12-19 02:00:34,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5020 to 4283. [2019-12-19 02:00:34,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4283 states. [2019-12-19 02:00:34,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4283 states to 4283 states and 9830 transitions. [2019-12-19 02:00:34,848 INFO L78 Accepts]: Start accepts. Automaton has 4283 states and 9830 transitions. Word has length 71 [2019-12-19 02:00:34,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:34,848 INFO L462 AbstractCegarLoop]: Abstraction has 4283 states and 9830 transitions. [2019-12-19 02:00:34,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:00:34,848 INFO L276 IsEmpty]: Start isEmpty. Operand 4283 states and 9830 transitions. [2019-12-19 02:00:34,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-19 02:00:34,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:34,854 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:00:34,854 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:34,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:34,855 INFO L82 PathProgramCache]: Analyzing trace with hash -222857875, now seen corresponding path program 1 times [2019-12-19 02:00:34,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:34,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930956613] [2019-12-19 02:00:34,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:34,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:34,934 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-19 02:00:34,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930956613] [2019-12-19 02:00:34,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:34,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:00:34,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488529061] [2019-12-19 02:00:34,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:00:34,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:34,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:00:34,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:00:34,936 INFO L87 Difference]: Start difference. First operand 4283 states and 9830 transitions. Second operand 5 states. [2019-12-19 02:00:35,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:35,206 INFO L93 Difference]: Finished difference Result 4936 states and 11181 transitions. [2019-12-19 02:00:35,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:00:35,206 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-12-19 02:00:35,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:35,213 INFO L225 Difference]: With dead ends: 4936 [2019-12-19 02:00:35,213 INFO L226 Difference]: Without dead ends: 4905 [2019-12-19 02:00:35,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:00:35,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2019-12-19 02:00:35,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4420. [2019-12-19 02:00:35,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4420 states. [2019-12-19 02:00:35,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4420 states to 4420 states and 10099 transitions. [2019-12-19 02:00:35,259 INFO L78 Accepts]: Start accepts. Automaton has 4420 states and 10099 transitions. Word has length 86 [2019-12-19 02:00:35,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:35,259 INFO L462 AbstractCegarLoop]: Abstraction has 4420 states and 10099 transitions. [2019-12-19 02:00:35,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:00:35,259 INFO L276 IsEmpty]: Start isEmpty. Operand 4420 states and 10099 transitions. [2019-12-19 02:00:35,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-19 02:00:35,263 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:35,263 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:00:35,263 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:35,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:35,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1011259222, now seen corresponding path program 1 times [2019-12-19 02:00:35,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:35,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284042750] [2019-12-19 02:00:35,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:35,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:35,380 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-19 02:00:35,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284042750] [2019-12-19 02:00:35,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:35,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:00:35,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233907854] [2019-12-19 02:00:35,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:00:35,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:35,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:00:35,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:00:35,383 INFO L87 Difference]: Start difference. First operand 4420 states and 10099 transitions. Second operand 6 states. [2019-12-19 02:00:35,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:35,777 INFO L93 Difference]: Finished difference Result 5739 states and 13065 transitions. [2019-12-19 02:00:35,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:00:35,777 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-12-19 02:00:35,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:35,783 INFO L225 Difference]: With dead ends: 5739 [2019-12-19 02:00:35,784 INFO L226 Difference]: Without dead ends: 5721 [2019-12-19 02:00:35,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:00:35,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5721 states. [2019-12-19 02:00:35,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5721 to 4713. [2019-12-19 02:00:35,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4713 states. [2019-12-19 02:00:35,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4713 states to 4713 states and 10804 transitions. [2019-12-19 02:00:35,832 INFO L78 Accepts]: Start accepts. Automaton has 4713 states and 10804 transitions. Word has length 86 [2019-12-19 02:00:35,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:35,833 INFO L462 AbstractCegarLoop]: Abstraction has 4713 states and 10804 transitions. [2019-12-19 02:00:35,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:00:35,833 INFO L276 IsEmpty]: Start isEmpty. Operand 4713 states and 10804 transitions. [2019-12-19 02:00:35,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-19 02:00:35,839 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:35,839 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:00:35,839 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:35,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:35,840 INFO L82 PathProgramCache]: Analyzing trace with hash -785692137, now seen corresponding path program 1 times [2019-12-19 02:00:35,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:35,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557179979] [2019-12-19 02:00:35,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:35,969 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-19 02:00:35,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557179979] [2019-12-19 02:00:35,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:35,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:00:35,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080189602] [2019-12-19 02:00:35,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:00:35,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:35,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:00:35,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:00:35,972 INFO L87 Difference]: Start difference. First operand 4713 states and 10804 transitions. Second operand 7 states. [2019-12-19 02:00:36,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:36,490 INFO L93 Difference]: Finished difference Result 6904 states and 15920 transitions. [2019-12-19 02:00:36,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 02:00:36,490 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-12-19 02:00:36,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:36,499 INFO L225 Difference]: With dead ends: 6904 [2019-12-19 02:00:36,499 INFO L226 Difference]: Without dead ends: 6904 [2019-12-19 02:00:36,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-19 02:00:36,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6904 states. [2019-12-19 02:00:36,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6904 to 5162. [2019-12-19 02:00:36,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5162 states. [2019-12-19 02:00:36,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5162 states to 5162 states and 11892 transitions. [2019-12-19 02:00:36,592 INFO L78 Accepts]: Start accepts. Automaton has 5162 states and 11892 transitions. Word has length 86 [2019-12-19 02:00:36,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:36,592 INFO L462 AbstractCegarLoop]: Abstraction has 5162 states and 11892 transitions. [2019-12-19 02:00:36,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:00:36,592 INFO L276 IsEmpty]: Start isEmpty. Operand 5162 states and 11892 transitions. [2019-12-19 02:00:36,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-19 02:00:36,598 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:36,599 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:00:36,599 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:36,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:36,599 INFO L82 PathProgramCache]: Analyzing trace with hash 101811544, now seen corresponding path program 1 times [2019-12-19 02:00:36,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:36,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488641156] [2019-12-19 02:00:36,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:36,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:36,659 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-19 02:00:36,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488641156] [2019-12-19 02:00:36,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:36,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 02:00:36,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900259323] [2019-12-19 02:00:36,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 02:00:36,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:36,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 02:00:36,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:00:36,664 INFO L87 Difference]: Start difference. First operand 5162 states and 11892 transitions. Second operand 3 states. [2019-12-19 02:00:36,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:36,693 INFO L93 Difference]: Finished difference Result 5072 states and 11574 transitions. [2019-12-19 02:00:36,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 02:00:36,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-12-19 02:00:36,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:36,700 INFO L225 Difference]: With dead ends: 5072 [2019-12-19 02:00:36,700 INFO L226 Difference]: Without dead ends: 5054 [2019-12-19 02:00:36,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-19 02:00:36,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5054 states. [2019-12-19 02:00:36,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5054 to 3496. [2019-12-19 02:00:36,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3496 states. [2019-12-19 02:00:36,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3496 states to 3496 states and 8019 transitions. [2019-12-19 02:00:36,761 INFO L78 Accepts]: Start accepts. Automaton has 3496 states and 8019 transitions. Word has length 86 [2019-12-19 02:00:36,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:36,762 INFO L462 AbstractCegarLoop]: Abstraction has 3496 states and 8019 transitions. [2019-12-19 02:00:36,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 02:00:36,762 INFO L276 IsEmpty]: Start isEmpty. Operand 3496 states and 8019 transitions. [2019-12-19 02:00:36,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-19 02:00:36,766 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:36,767 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:00:36,767 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:36,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:36,767 INFO L82 PathProgramCache]: Analyzing trace with hash -751041092, now seen corresponding path program 1 times [2019-12-19 02:00:36,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:36,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830980966] [2019-12-19 02:00:36,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:36,932 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-19 02:00:36,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830980966] [2019-12-19 02:00:36,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:36,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 02:00:36,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123629536] [2019-12-19 02:00:36,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 02:00:36,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:36,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 02:00:36,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:00:36,934 INFO L87 Difference]: Start difference. First operand 3496 states and 8019 transitions. Second operand 8 states. [2019-12-19 02:00:37,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:37,429 INFO L93 Difference]: Finished difference Result 4122 states and 9321 transitions. [2019-12-19 02:00:37,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-19 02:00:37,429 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2019-12-19 02:00:37,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:37,437 INFO L225 Difference]: With dead ends: 4122 [2019-12-19 02:00:37,437 INFO L226 Difference]: Without dead ends: 4122 [2019-12-19 02:00:37,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-12-19 02:00:37,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4122 states. [2019-12-19 02:00:37,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4122 to 3168. [2019-12-19 02:00:37,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3168 states. [2019-12-19 02:00:37,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3168 states to 3168 states and 7228 transitions. [2019-12-19 02:00:37,514 INFO L78 Accepts]: Start accepts. Automaton has 3168 states and 7228 transitions. Word has length 88 [2019-12-19 02:00:37,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:37,514 INFO L462 AbstractCegarLoop]: Abstraction has 3168 states and 7228 transitions. [2019-12-19 02:00:37,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 02:00:37,514 INFO L276 IsEmpty]: Start isEmpty. Operand 3168 states and 7228 transitions. [2019-12-19 02:00:37,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-19 02:00:37,519 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:37,519 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:00:37,519 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:37,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:37,520 INFO L82 PathProgramCache]: Analyzing trace with hash 136462589, now seen corresponding path program 1 times [2019-12-19 02:00:37,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:37,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752402162] [2019-12-19 02:00:37,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:37,648 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-19 02:00:37,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752402162] [2019-12-19 02:00:37,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:37,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:00:37,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601359411] [2019-12-19 02:00:37,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:00:37,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:37,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:00:37,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:00:37,650 INFO L87 Difference]: Start difference. First operand 3168 states and 7228 transitions. Second operand 7 states. [2019-12-19 02:00:37,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:37,758 INFO L93 Difference]: Finished difference Result 5381 states and 12355 transitions. [2019-12-19 02:00:37,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:00:37,759 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 88 [2019-12-19 02:00:37,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:37,762 INFO L225 Difference]: With dead ends: 5381 [2019-12-19 02:00:37,762 INFO L226 Difference]: Without dead ends: 2305 [2019-12-19 02:00:37,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-19 02:00:37,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2019-12-19 02:00:37,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 2305. [2019-12-19 02:00:37,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2305 states. [2019-12-19 02:00:37,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 5276 transitions. [2019-12-19 02:00:37,795 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 5276 transitions. Word has length 88 [2019-12-19 02:00:37,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:37,795 INFO L462 AbstractCegarLoop]: Abstraction has 2305 states and 5276 transitions. [2019-12-19 02:00:37,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:00:37,795 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 5276 transitions. [2019-12-19 02:00:37,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-19 02:00:37,799 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:37,799 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:00:37,799 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:37,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:37,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1710229601, now seen corresponding path program 2 times [2019-12-19 02:00:37,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:37,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955496283] [2019-12-19 02:00:37,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:37,986 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-19 02:00:37,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955496283] [2019-12-19 02:00:37,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:37,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-19 02:00:37,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131696066] [2019-12-19 02:00:37,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-19 02:00:37,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:37,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-19 02:00:37,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-12-19 02:00:37,989 INFO L87 Difference]: Start difference. First operand 2305 states and 5276 transitions. Second operand 10 states. [2019-12-19 02:00:38,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:38,328 INFO L93 Difference]: Finished difference Result 3951 states and 9033 transitions. [2019-12-19 02:00:38,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-19 02:00:38,328 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2019-12-19 02:00:38,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:38,332 INFO L225 Difference]: With dead ends: 3951 [2019-12-19 02:00:38,332 INFO L226 Difference]: Without dead ends: 2572 [2019-12-19 02:00:38,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-12-19 02:00:38,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2019-12-19 02:00:38,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 2342. [2019-12-19 02:00:38,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2342 states. [2019-12-19 02:00:38,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2342 states to 2342 states and 5307 transitions. [2019-12-19 02:00:38,364 INFO L78 Accepts]: Start accepts. Automaton has 2342 states and 5307 transitions. Word has length 88 [2019-12-19 02:00:38,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:38,365 INFO L462 AbstractCegarLoop]: Abstraction has 2342 states and 5307 transitions. [2019-12-19 02:00:38,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-19 02:00:38,365 INFO L276 IsEmpty]: Start isEmpty. Operand 2342 states and 5307 transitions. [2019-12-19 02:00:38,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-19 02:00:38,368 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:38,368 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:00:38,369 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:38,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:38,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1220418877, now seen corresponding path program 3 times [2019-12-19 02:00:38,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:38,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385220994] [2019-12-19 02:00:38,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 02:00:38,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 02:00:38,480 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 02:00:38,481 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 02:00:38,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 02:00:38 BasicIcfg [2019-12-19 02:00:38,672 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 02:00:38,674 INFO L168 Benchmark]: Toolchain (without parser) took 38675.43 ms. Allocated memory was 138.9 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 102.4 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 588.6 MB. Max. memory is 7.1 GB. [2019-12-19 02:00:38,675 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory is still 121.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-19 02:00:38,675 INFO L168 Benchmark]: CACSL2BoogieTranslator took 742.26 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 102.0 MB in the beginning and 157.8 MB in the end (delta: -55.8 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2019-12-19 02:00:38,676 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.87 ms. Allocated memory is still 203.4 MB. Free memory was 157.8 MB in the beginning and 154.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-19 02:00:38,676 INFO L168 Benchmark]: Boogie Preprocessor took 36.11 ms. Allocated memory is still 203.4 MB. Free memory was 154.9 MB in the beginning and 153.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-19 02:00:38,677 INFO L168 Benchmark]: RCFGBuilder took 812.19 ms. Allocated memory is still 203.4 MB. Free memory was 153.0 MB in the beginning and 111.2 MB in the end (delta: 41.8 MB). Peak memory consumption was 41.8 MB. Max. memory is 7.1 GB. [2019-12-19 02:00:38,677 INFO L168 Benchmark]: TraceAbstraction took 37017.54 ms. Allocated memory was 203.4 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 111.2 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 532.9 MB. Max. memory is 7.1 GB. [2019-12-19 02:00:38,680 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory is still 121.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 742.26 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 102.0 MB in the beginning and 157.8 MB in the end (delta: -55.8 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.87 ms. Allocated memory is still 203.4 MB. Free memory was 157.8 MB in the beginning and 154.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.11 ms. Allocated memory is still 203.4 MB. Free memory was 154.9 MB in the beginning and 153.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 812.19 ms. Allocated memory is still 203.4 MB. Free memory was 153.0 MB in the beginning and 111.2 MB in the end (delta: 41.8 MB). Peak memory consumption was 41.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 37017.54 ms. Allocated memory was 203.4 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 111.2 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 532.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L701] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L703] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L705] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0] [L706] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0] [L707] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L709] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L711] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L712] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L713] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L714] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L715] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L716] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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] [L717] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0] [L718] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, y$r_buff1_thd1=0] [L719] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L720] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L721] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L722] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L723] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L724] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L725] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L727] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L728] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L729] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L809] 0 pthread_t t835; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L810] FCALL, FORK 0 pthread_create(&t835, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L811] 0 pthread_t t836; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t836, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L767] 2 y$w_buff1 = y$w_buff0 [L768] 2 y$w_buff0 = 1 [L769] 2 y$w_buff1_used = y$w_buff0_used [L770] 2 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L772] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L773] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L774] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L775] 2 y$r_buff0_thd2 = (_Bool)1 [L778] 2 z = 1 [L781] 2 __unbuffered_p1_EAX = z [L784] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 a = 1 [L736] 1 x = 1 [L739] 1 __unbuffered_p0_EAX = x [L742] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 1 y$flush_delayed = weak$$choice2 [L745] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 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) [L788] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L789] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L747] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L748] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L749] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L750] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L752] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L752] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 1 y = y$flush_delayed ? y$mem_tmp : y [L755] 1 y$flush_delayed = (_Bool)0 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] 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 [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] EXPR 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 [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] EXPR 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 [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L819] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L819] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L820] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 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 [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] 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 [L825] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 133 locations, 2 error locations. Result: UNSAFE, OverallTime: 36.6s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 14.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7026 SDtfs, 7436 SDslu, 16119 SDs, 0 SdLazy, 6018 SolverSat, 373 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 244 GetRequests, 68 SyntacticMatches, 13 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56774occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 15.8s AutomataMinimizationTime, 26 MinimizatonAttempts, 53428 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1889 NumberOfCodeBlocks, 1889 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1775 ConstructedInterpolants, 0 QuantifiedInterpolants, 321557 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...