/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/safe010_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 04:32:39,694 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 04:32:39,696 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 04:32:39,713 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 04:32:39,713 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 04:32:39,715 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 04:32:39,717 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 04:32:39,721 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 04:32:39,723 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 04:32:39,724 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 04:32:39,725 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 04:32:39,726 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 04:32:39,726 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 04:32:39,727 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 04:32:39,728 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 04:32:39,729 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 04:32:39,730 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 04:32:39,731 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 04:32:39,733 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 04:32:39,735 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 04:32:39,737 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 04:32:39,738 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 04:32:39,739 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 04:32:39,740 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 04:32:39,742 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 04:32:39,742 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 04:32:39,743 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 04:32:39,744 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 04:32:39,744 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 04:32:39,745 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 04:32:39,745 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 04:32:39,746 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 04:32:39,747 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 04:32:39,748 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 04:32:39,749 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 04:32:39,749 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 04:32:39,750 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 04:32:39,750 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 04:32:39,750 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 04:32:39,751 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 04:32:39,752 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 04:32:39,753 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 04:32:39,767 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 04:32:39,767 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 04:32:39,768 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 04:32:39,769 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 04:32:39,769 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 04:32:39,769 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 04:32:39,769 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 04:32:39,769 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 04:32:39,770 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 04:32:39,770 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 04:32:39,770 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 04:32:39,770 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 04:32:39,770 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 04:32:39,770 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 04:32:39,771 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 04:32:39,771 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 04:32:39,771 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 04:32:39,771 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 04:32:39,771 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 04:32:39,772 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 04:32:39,772 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 04:32:39,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 04:32:39,772 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 04:32:39,772 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 04:32:39,773 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 04:32:39,773 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 04:32:39,773 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 04:32:39,773 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 04:32:39,773 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 04:32:39,773 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 04:32:40,063 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 04:32:40,079 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 04:32:40,082 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 04:32:40,083 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 04:32:40,083 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 04:32:40,084 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_power.opt.i [2019-12-19 04:32:40,153 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50586b62a/b183ed0f8bde49c082c6ebe8cf7ec7ad/FLAGcdccc20a8 [2019-12-19 04:32:40,712 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 04:32:40,713 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.opt.i [2019-12-19 04:32:40,729 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50586b62a/b183ed0f8bde49c082c6ebe8cf7ec7ad/FLAGcdccc20a8 [2019-12-19 04:32:40,995 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50586b62a/b183ed0f8bde49c082c6ebe8cf7ec7ad [2019-12-19 04:32:41,004 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 04:32:41,006 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 04:32:41,007 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 04:32:41,007 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 04:32:41,010 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 04:32:41,011 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 04:32:40" (1/1) ... [2019-12-19 04:32:41,014 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28c488c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:32:41, skipping insertion in model container [2019-12-19 04:32:41,014 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 04:32:40" (1/1) ... [2019-12-19 04:32:41,020 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 04:32:41,070 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 04:32:41,569 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 04:32:41,588 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 04:32:41,673 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 04:32:41,748 INFO L208 MainTranslator]: Completed translation [2019-12-19 04:32:41,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:32:41 WrapperNode [2019-12-19 04:32:41,749 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 04:32:41,750 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 04:32:41,750 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 04:32:41,750 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 04:32:41,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:32:41" (1/1) ... [2019-12-19 04:32:41,783 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:32:41" (1/1) ... [2019-12-19 04:32:41,826 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 04:32:41,830 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 04:32:41,830 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 04:32:41,830 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 04:32:41,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:32:41" (1/1) ... [2019-12-19 04:32:41,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:32:41" (1/1) ... [2019-12-19 04:32:41,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:32:41" (1/1) ... [2019-12-19 04:32:41,847 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:32:41" (1/1) ... [2019-12-19 04:32:41,857 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:32:41" (1/1) ... [2019-12-19 04:32:41,861 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:32:41" (1/1) ... [2019-12-19 04:32:41,864 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:32:41" (1/1) ... [2019-12-19 04:32:41,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 04:32:41,870 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 04:32:41,870 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 04:32:41,870 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 04:32:41,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:32:41" (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 04:32:41,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 04:32:41,947 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 04:32:41,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 04:32:41,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 04:32:41,948 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 04:32:41,948 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 04:32:41,948 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 04:32:41,948 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 04:32:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 04:32:41,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 04:32:41,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 04:32:41,951 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 04:32:42,627 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 04:32:42,627 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 04:32:42,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 04:32:42 BoogieIcfgContainer [2019-12-19 04:32:42,629 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 04:32:42,630 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 04:32:42,630 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 04:32:42,634 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 04:32:42,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 04:32:40" (1/3) ... [2019-12-19 04:32:42,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e7a374 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 04:32:42, skipping insertion in model container [2019-12-19 04:32:42,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:32:41" (2/3) ... [2019-12-19 04:32:42,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e7a374 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 04:32:42, skipping insertion in model container [2019-12-19 04:32:42,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 04:32:42" (3/3) ... [2019-12-19 04:32:42,639 INFO L109 eAbstractionObserver]: Analyzing ICFG safe010_power.opt.i [2019-12-19 04:32:42,650 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 04:32:42,650 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 04:32:42,659 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 04:32:42,660 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 04:32:42,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,698 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,699 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,699 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,700 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,700 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,710 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,711 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,732 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,732 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,733 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,737 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,738 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:32:42,756 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 04:32:42,778 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 04:32:42,778 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 04:32:42,778 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 04:32:42,779 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 04:32:42,779 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 04:32:42,779 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 04:32:42,779 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 04:32:42,779 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 04:32:42,795 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 146 places, 180 transitions [2019-12-19 04:32:44,088 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22510 states. [2019-12-19 04:32:44,090 INFO L276 IsEmpty]: Start isEmpty. Operand 22510 states. [2019-12-19 04:32:44,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-19 04:32:44,099 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:32:44,100 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] [2019-12-19 04:32:44,101 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:32:44,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:32:44,107 INFO L82 PathProgramCache]: Analyzing trace with hash 772326421, now seen corresponding path program 1 times [2019-12-19 04:32:44,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:32:44,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340325771] [2019-12-19 04:32:44,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:32:44,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:32:44,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 04:32:44,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340325771] [2019-12-19 04:32:44,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:32:44,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:32:44,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767688027] [2019-12-19 04:32:44,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:32:44,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:32:44,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:32:44,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:32:44,431 INFO L87 Difference]: Start difference. First operand 22510 states. Second operand 4 states. [2019-12-19 04:32:45,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:32:45,201 INFO L93 Difference]: Finished difference Result 23454 states and 91771 transitions. [2019-12-19 04:32:45,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 04:32:45,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-19 04:32:45,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:32:45,439 INFO L225 Difference]: With dead ends: 23454 [2019-12-19 04:32:45,440 INFO L226 Difference]: Without dead ends: 21278 [2019-12-19 04:32:45,442 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 04:32:46,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21278 states. [2019-12-19 04:32:47,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21278 to 21278. [2019-12-19 04:32:47,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21278 states. [2019-12-19 04:32:47,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21278 states to 21278 states and 83795 transitions. [2019-12-19 04:32:47,370 INFO L78 Accepts]: Start accepts. Automaton has 21278 states and 83795 transitions. Word has length 33 [2019-12-19 04:32:47,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:32:47,371 INFO L462 AbstractCegarLoop]: Abstraction has 21278 states and 83795 transitions. [2019-12-19 04:32:47,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:32:47,371 INFO L276 IsEmpty]: Start isEmpty. Operand 21278 states and 83795 transitions. [2019-12-19 04:32:47,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-19 04:32:47,378 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:32:47,378 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:32:47,378 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:32:47,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:32:47,379 INFO L82 PathProgramCache]: Analyzing trace with hash -2041424114, now seen corresponding path program 1 times [2019-12-19 04:32:47,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:32:47,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112970050] [2019-12-19 04:32:47,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:32:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:32:47,529 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 04:32:47,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112970050] [2019-12-19 04:32:47,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:32:47,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:32:47,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530994110] [2019-12-19 04:32:47,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:32:47,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:32:47,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:32:47,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:32:47,533 INFO L87 Difference]: Start difference. First operand 21278 states and 83795 transitions. Second operand 5 states. [2019-12-19 04:32:49,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:32:49,419 INFO L93 Difference]: Finished difference Result 34712 states and 129091 transitions. [2019-12-19 04:32:49,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:32:49,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-19 04:32:49,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:32:49,589 INFO L225 Difference]: With dead ends: 34712 [2019-12-19 04:32:49,589 INFO L226 Difference]: Without dead ends: 34568 [2019-12-19 04:32:49,590 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 04:32:49,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34568 states. [2019-12-19 04:32:50,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34568 to 33068. [2019-12-19 04:32:50,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33068 states. [2019-12-19 04:32:50,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33068 states to 33068 states and 123979 transitions. [2019-12-19 04:32:50,740 INFO L78 Accepts]: Start accepts. Automaton has 33068 states and 123979 transitions. Word has length 44 [2019-12-19 04:32:50,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:32:50,742 INFO L462 AbstractCegarLoop]: Abstraction has 33068 states and 123979 transitions. [2019-12-19 04:32:50,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:32:50,743 INFO L276 IsEmpty]: Start isEmpty. Operand 33068 states and 123979 transitions. [2019-12-19 04:32:50,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-19 04:32:50,754 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:32:50,754 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:32:50,755 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:32:50,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:32:50,755 INFO L82 PathProgramCache]: Analyzing trace with hash 865833508, now seen corresponding path program 1 times [2019-12-19 04:32:50,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:32:50,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721539851] [2019-12-19 04:32:50,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:32:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:32:50,892 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 04:32:50,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721539851] [2019-12-19 04:32:50,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:32:50,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:32:50,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220650907] [2019-12-19 04:32:50,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:32:50,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:32:50,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:32:50,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:32:50,894 INFO L87 Difference]: Start difference. First operand 33068 states and 123979 transitions. Second operand 5 states. [2019-12-19 04:32:51,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:32:51,712 INFO L93 Difference]: Finished difference Result 40220 states and 148648 transitions. [2019-12-19 04:32:51,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:32:51,713 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-12-19 04:32:51,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:32:51,895 INFO L225 Difference]: With dead ends: 40220 [2019-12-19 04:32:51,895 INFO L226 Difference]: Without dead ends: 40060 [2019-12-19 04:32:51,895 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 04:32:52,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40060 states. [2019-12-19 04:32:54,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40060 to 34641. [2019-12-19 04:32:54,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34641 states. [2019-12-19 04:32:54,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34641 states to 34641 states and 129275 transitions. [2019-12-19 04:32:54,279 INFO L78 Accepts]: Start accepts. Automaton has 34641 states and 129275 transitions. Word has length 45 [2019-12-19 04:32:54,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:32:54,279 INFO L462 AbstractCegarLoop]: Abstraction has 34641 states and 129275 transitions. [2019-12-19 04:32:54,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:32:54,279 INFO L276 IsEmpty]: Start isEmpty. Operand 34641 states and 129275 transitions. [2019-12-19 04:32:54,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-19 04:32:54,292 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:32:54,292 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] [2019-12-19 04:32:54,293 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:32:54,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:32:54,293 INFO L82 PathProgramCache]: Analyzing trace with hash -566493931, now seen corresponding path program 1 times [2019-12-19 04:32:54,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:32:54,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683452118] [2019-12-19 04:32:54,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:32:54,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:32:54,378 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 04:32:54,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683452118] [2019-12-19 04:32:54,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:32:54,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:32:54,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57216891] [2019-12-19 04:32:54,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:32:54,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:32:54,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:32:54,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:32:54,380 INFO L87 Difference]: Start difference. First operand 34641 states and 129275 transitions. Second operand 6 states. [2019-12-19 04:32:55,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:32:55,526 INFO L93 Difference]: Finished difference Result 45669 states and 166169 transitions. [2019-12-19 04:32:55,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 04:32:55,530 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-19 04:32:55,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:32:55,675 INFO L225 Difference]: With dead ends: 45669 [2019-12-19 04:32:55,675 INFO L226 Difference]: Without dead ends: 45525 [2019-12-19 04:32:55,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-19 04:32:55,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45525 states. [2019-12-19 04:32:57,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45525 to 33604. [2019-12-19 04:32:57,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33604 states. [2019-12-19 04:32:57,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33604 states to 33604 states and 125430 transitions. [2019-12-19 04:32:57,969 INFO L78 Accepts]: Start accepts. Automaton has 33604 states and 125430 transitions. Word has length 52 [2019-12-19 04:32:57,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:32:57,969 INFO L462 AbstractCegarLoop]: Abstraction has 33604 states and 125430 transitions. [2019-12-19 04:32:57,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:32:57,970 INFO L276 IsEmpty]: Start isEmpty. Operand 33604 states and 125430 transitions. [2019-12-19 04:32:58,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-19 04:32:58,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:32:58,003 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] [2019-12-19 04:32:58,003 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:32:58,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:32:58,004 INFO L82 PathProgramCache]: Analyzing trace with hash -885098341, now seen corresponding path program 1 times [2019-12-19 04:32:58,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:32:58,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476466498] [2019-12-19 04:32:58,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:32:58,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:32:58,086 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 04:32:58,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476466498] [2019-12-19 04:32:58,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:32:58,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:32:58,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003610580] [2019-12-19 04:32:58,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:32:58,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:32:58,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:32:58,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:32:58,088 INFO L87 Difference]: Start difference. First operand 33604 states and 125430 transitions. Second operand 6 states. [2019-12-19 04:32:58,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:32:58,760 INFO L93 Difference]: Finished difference Result 46076 states and 167863 transitions. [2019-12-19 04:32:58,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 04:32:58,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-19 04:32:58,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:32:59,202 INFO L225 Difference]: With dead ends: 46076 [2019-12-19 04:32:59,202 INFO L226 Difference]: Without dead ends: 45836 [2019-12-19 04:32:59,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-19 04:32:59,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45836 states. [2019-12-19 04:32:59,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45836 to 39965. [2019-12-19 04:32:59,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39965 states. [2019-12-19 04:33:02,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39965 states to 39965 states and 147354 transitions. [2019-12-19 04:33:02,100 INFO L78 Accepts]: Start accepts. Automaton has 39965 states and 147354 transitions. Word has length 59 [2019-12-19 04:33:02,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:02,100 INFO L462 AbstractCegarLoop]: Abstraction has 39965 states and 147354 transitions. [2019-12-19 04:33:02,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:33:02,101 INFO L276 IsEmpty]: Start isEmpty. Operand 39965 states and 147354 transitions. [2019-12-19 04:33:02,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-19 04:33:02,132 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:02,132 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:33:02,132 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:02,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:02,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1504066544, now seen corresponding path program 1 times [2019-12-19 04:33:02,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:02,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249114742] [2019-12-19 04:33:02,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:02,200 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 04:33:02,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249114742] [2019-12-19 04:33:02,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:02,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 04:33:02,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507080835] [2019-12-19 04:33:02,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 04:33:02,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:02,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 04:33:02,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:33:02,202 INFO L87 Difference]: Start difference. First operand 39965 states and 147354 transitions. Second operand 3 states. [2019-12-19 04:33:02,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:02,424 INFO L93 Difference]: Finished difference Result 50263 states and 182189 transitions. [2019-12-19 04:33:02,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 04:33:02,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-12-19 04:33:02,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:02,523 INFO L225 Difference]: With dead ends: 50263 [2019-12-19 04:33:02,523 INFO L226 Difference]: Without dead ends: 50263 [2019-12-19 04:33:02,523 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 04:33:02,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50263 states. [2019-12-19 04:33:03,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50263 to 43895. [2019-12-19 04:33:03,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43895 states. [2019-12-19 04:33:03,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43895 states to 43895 states and 160792 transitions. [2019-12-19 04:33:03,598 INFO L78 Accepts]: Start accepts. Automaton has 43895 states and 160792 transitions. Word has length 61 [2019-12-19 04:33:03,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:03,599 INFO L462 AbstractCegarLoop]: Abstraction has 43895 states and 160792 transitions. [2019-12-19 04:33:03,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 04:33:03,599 INFO L276 IsEmpty]: Start isEmpty. Operand 43895 states and 160792 transitions. [2019-12-19 04:33:03,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-19 04:33:03,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:03,633 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:33:03,634 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:03,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:03,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1371095923, now seen corresponding path program 1 times [2019-12-19 04:33:03,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:03,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791113630] [2019-12-19 04:33:03,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:03,740 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 04:33:03,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791113630] [2019-12-19 04:33:03,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:03,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:33:03,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383810214] [2019-12-19 04:33:03,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:33:03,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:03,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:33:03,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:33:03,743 INFO L87 Difference]: Start difference. First operand 43895 states and 160792 transitions. Second operand 7 states. [2019-12-19 04:33:04,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:04,739 INFO L93 Difference]: Finished difference Result 55891 states and 200526 transitions. [2019-12-19 04:33:04,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 04:33:04,739 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-19 04:33:04,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:04,846 INFO L225 Difference]: With dead ends: 55891 [2019-12-19 04:33:04,847 INFO L226 Difference]: Without dead ends: 55651 [2019-12-19 04:33:04,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-12-19 04:33:05,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55651 states. [2019-12-19 04:33:05,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55651 to 45121. [2019-12-19 04:33:05,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45121 states. [2019-12-19 04:33:06,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45121 states to 45121 states and 164959 transitions. [2019-12-19 04:33:06,100 INFO L78 Accepts]: Start accepts. Automaton has 45121 states and 164959 transitions. Word has length 65 [2019-12-19 04:33:06,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:06,100 INFO L462 AbstractCegarLoop]: Abstraction has 45121 states and 164959 transitions. [2019-12-19 04:33:06,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:33:06,101 INFO L276 IsEmpty]: Start isEmpty. Operand 45121 states and 164959 transitions. [2019-12-19 04:33:06,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 04:33:06,135 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:06,135 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:33:06,135 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:06,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:06,136 INFO L82 PathProgramCache]: Analyzing trace with hash -330249588, now seen corresponding path program 1 times [2019-12-19 04:33:06,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:06,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086038811] [2019-12-19 04:33:06,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:06,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:06,241 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 04:33:06,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086038811] [2019-12-19 04:33:06,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:06,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:33:06,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527298317] [2019-12-19 04:33:06,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:33:06,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:06,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:33:06,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:33:06,243 INFO L87 Difference]: Start difference. First operand 45121 states and 164959 transitions. Second operand 4 states. [2019-12-19 04:33:06,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:06,995 INFO L93 Difference]: Finished difference Result 69403 states and 252019 transitions. [2019-12-19 04:33:06,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 04:33:06,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-19 04:33:06,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:07,151 INFO L225 Difference]: With dead ends: 69403 [2019-12-19 04:33:07,151 INFO L226 Difference]: Without dead ends: 69403 [2019-12-19 04:33:07,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:33:07,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69403 states. [2019-12-19 04:33:08,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69403 to 53611. [2019-12-19 04:33:08,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53611 states. [2019-12-19 04:33:08,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53611 states to 53611 states and 195428 transitions. [2019-12-19 04:33:08,666 INFO L78 Accepts]: Start accepts. Automaton has 53611 states and 195428 transitions. Word has length 66 [2019-12-19 04:33:08,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:08,667 INFO L462 AbstractCegarLoop]: Abstraction has 53611 states and 195428 transitions. [2019-12-19 04:33:08,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:33:08,667 INFO L276 IsEmpty]: Start isEmpty. Operand 53611 states and 195428 transitions. [2019-12-19 04:33:08,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 04:33:08,704 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:08,704 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:33:08,704 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:08,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:08,704 INFO L82 PathProgramCache]: Analyzing trace with hash 434850924, now seen corresponding path program 1 times [2019-12-19 04:33:08,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:08,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048894521] [2019-12-19 04:33:08,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:08,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:08,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:08,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048894521] [2019-12-19 04:33:08,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:08,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:33:08,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953307746] [2019-12-19 04:33:08,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:33:08,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:08,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:33:08,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:33:08,836 INFO L87 Difference]: Start difference. First operand 53611 states and 195428 transitions. Second operand 7 states. [2019-12-19 04:33:10,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:10,125 INFO L93 Difference]: Finished difference Result 63822 states and 228895 transitions. [2019-12-19 04:33:10,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 04:33:10,126 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-19 04:33:10,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:10,272 INFO L225 Difference]: With dead ends: 63822 [2019-12-19 04:33:10,272 INFO L226 Difference]: Without dead ends: 63622 [2019-12-19 04:33:10,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2019-12-19 04:33:10,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63622 states. [2019-12-19 04:33:11,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63622 to 54380. [2019-12-19 04:33:11,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54380 states. [2019-12-19 04:33:11,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54380 states to 54380 states and 197958 transitions. [2019-12-19 04:33:11,765 INFO L78 Accepts]: Start accepts. Automaton has 54380 states and 197958 transitions. Word has length 66 [2019-12-19 04:33:11,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:11,765 INFO L462 AbstractCegarLoop]: Abstraction has 54380 states and 197958 transitions. [2019-12-19 04:33:11,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:33:11,766 INFO L276 IsEmpty]: Start isEmpty. Operand 54380 states and 197958 transitions. [2019-12-19 04:33:11,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 04:33:11,828 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:11,828 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] [2019-12-19 04:33:11,829 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:11,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:11,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1137053182, now seen corresponding path program 1 times [2019-12-19 04:33:11,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:11,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635348784] [2019-12-19 04:33:11,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:11,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:11,928 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 04:33:11,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635348784] [2019-12-19 04:33:11,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:11,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:33:11,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3974850] [2019-12-19 04:33:11,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:33:11,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:11,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:33:11,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:33:11,930 INFO L87 Difference]: Start difference. First operand 54380 states and 197958 transitions. Second operand 6 states. [2019-12-19 04:33:14,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:14,066 INFO L93 Difference]: Finished difference Result 75817 states and 274672 transitions. [2019-12-19 04:33:14,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:33:14,066 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-19 04:33:14,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:14,239 INFO L225 Difference]: With dead ends: 75817 [2019-12-19 04:33:14,239 INFO L226 Difference]: Without dead ends: 75173 [2019-12-19 04:33:14,240 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 04:33:14,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75173 states. [2019-12-19 04:33:15,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75173 to 65280. [2019-12-19 04:33:15,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65280 states. [2019-12-19 04:33:15,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65280 states to 65280 states and 238125 transitions. [2019-12-19 04:33:15,728 INFO L78 Accepts]: Start accepts. Automaton has 65280 states and 238125 transitions. Word has length 68 [2019-12-19 04:33:15,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:15,728 INFO L462 AbstractCegarLoop]: Abstraction has 65280 states and 238125 transitions. [2019-12-19 04:33:15,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:33:15,728 INFO L276 IsEmpty]: Start isEmpty. Operand 65280 states and 238125 transitions. [2019-12-19 04:33:15,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 04:33:15,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:15,793 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] [2019-12-19 04:33:15,793 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:15,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:15,794 INFO L82 PathProgramCache]: Analyzing trace with hash 2098667199, now seen corresponding path program 1 times [2019-12-19 04:33:15,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:15,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956015542] [2019-12-19 04:33:15,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:15,913 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 04:33:15,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956015542] [2019-12-19 04:33:15,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:15,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:33:15,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244476698] [2019-12-19 04:33:15,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:33:15,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:15,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:33:15,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:33:15,915 INFO L87 Difference]: Start difference. First operand 65280 states and 238125 transitions. Second operand 7 states. [2019-12-19 04:33:17,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:17,004 INFO L93 Difference]: Finished difference Result 92241 states and 326467 transitions. [2019-12-19 04:33:17,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 04:33:17,005 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-19 04:33:17,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:17,196 INFO L225 Difference]: With dead ends: 92241 [2019-12-19 04:33:17,197 INFO L226 Difference]: Without dead ends: 92241 [2019-12-19 04:33:17,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 04:33:17,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92241 states. [2019-12-19 04:33:19,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92241 to 84350. [2019-12-19 04:33:19,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84350 states. [2019-12-19 04:33:19,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84350 states to 84350 states and 301234 transitions. [2019-12-19 04:33:19,523 INFO L78 Accepts]: Start accepts. Automaton has 84350 states and 301234 transitions. Word has length 68 [2019-12-19 04:33:19,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:19,523 INFO L462 AbstractCegarLoop]: Abstraction has 84350 states and 301234 transitions. [2019-12-19 04:33:19,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:33:19,523 INFO L276 IsEmpty]: Start isEmpty. Operand 84350 states and 301234 transitions. [2019-12-19 04:33:19,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 04:33:19,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:19,602 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] [2019-12-19 04:33:19,602 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:19,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:19,602 INFO L82 PathProgramCache]: Analyzing trace with hash -951535616, now seen corresponding path program 1 times [2019-12-19 04:33:19,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:19,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101757573] [2019-12-19 04:33:19,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:22,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:22,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101757573] [2019-12-19 04:33:22,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:22,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:33:22,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806321153] [2019-12-19 04:33:22,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:33:22,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:22,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:33:22,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:33:22,654 INFO L87 Difference]: Start difference. First operand 84350 states and 301234 transitions. Second operand 4 states. [2019-12-19 04:33:22,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:22,752 INFO L93 Difference]: Finished difference Result 19361 states and 61140 transitions. [2019-12-19 04:33:22,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 04:33:22,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-12-19 04:33:22,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:22,790 INFO L225 Difference]: With dead ends: 19361 [2019-12-19 04:33:22,790 INFO L226 Difference]: Without dead ends: 18883 [2019-12-19 04:33:22,790 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 04:33:22,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18883 states. [2019-12-19 04:33:22,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18883 to 18871. [2019-12-19 04:33:22,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18871 states. [2019-12-19 04:33:23,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18871 states to 18871 states and 59635 transitions. [2019-12-19 04:33:23,032 INFO L78 Accepts]: Start accepts. Automaton has 18871 states and 59635 transitions. Word has length 68 [2019-12-19 04:33:23,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:23,032 INFO L462 AbstractCegarLoop]: Abstraction has 18871 states and 59635 transitions. [2019-12-19 04:33:23,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:33:23,032 INFO L276 IsEmpty]: Start isEmpty. Operand 18871 states and 59635 transitions. [2019-12-19 04:33:23,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-19 04:33:23,046 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:23,046 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] [2019-12-19 04:33:23,046 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:23,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:23,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1837430218, now seen corresponding path program 1 times [2019-12-19 04:33:23,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:23,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501157677] [2019-12-19 04:33:23,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:23,110 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 04:33:23,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501157677] [2019-12-19 04:33:23,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:23,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:33:23,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010419797] [2019-12-19 04:33:23,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:33:23,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:23,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:33:23,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:33:23,113 INFO L87 Difference]: Start difference. First operand 18871 states and 59635 transitions. Second operand 4 states. [2019-12-19 04:33:23,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:23,378 INFO L93 Difference]: Finished difference Result 24271 states and 75815 transitions. [2019-12-19 04:33:23,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 04:33:23,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-12-19 04:33:23,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:23,415 INFO L225 Difference]: With dead ends: 24271 [2019-12-19 04:33:23,415 INFO L226 Difference]: Without dead ends: 24271 [2019-12-19 04:33:23,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 04:33:23,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24271 states. [2019-12-19 04:33:23,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24271 to 19783. [2019-12-19 04:33:23,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19783 states. [2019-12-19 04:33:23,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19783 states to 19783 states and 62293 transitions. [2019-12-19 04:33:23,700 INFO L78 Accepts]: Start accepts. Automaton has 19783 states and 62293 transitions. Word has length 78 [2019-12-19 04:33:23,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:23,701 INFO L462 AbstractCegarLoop]: Abstraction has 19783 states and 62293 transitions. [2019-12-19 04:33:23,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:33:23,701 INFO L276 IsEmpty]: Start isEmpty. Operand 19783 states and 62293 transitions. [2019-12-19 04:33:23,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-19 04:33:23,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:23,723 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] [2019-12-19 04:33:23,723 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:23,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:23,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1582693673, now seen corresponding path program 1 times [2019-12-19 04:33:23,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:23,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714131271] [2019-12-19 04:33:23,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:23,840 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 04:33:23,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714131271] [2019-12-19 04:33:23,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:23,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 04:33:23,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801367165] [2019-12-19 04:33:23,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 04:33:23,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:23,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 04:33:23,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:33:23,843 INFO L87 Difference]: Start difference. First operand 19783 states and 62293 transitions. Second operand 8 states. [2019-12-19 04:33:25,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:25,170 INFO L93 Difference]: Finished difference Result 21937 states and 68541 transitions. [2019-12-19 04:33:25,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-19 04:33:25,170 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2019-12-19 04:33:25,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:25,206 INFO L225 Difference]: With dead ends: 21937 [2019-12-19 04:33:25,206 INFO L226 Difference]: Without dead ends: 21889 [2019-12-19 04:33:25,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2019-12-19 04:33:25,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21889 states. [2019-12-19 04:33:25,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21889 to 17452. [2019-12-19 04:33:25,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17452 states. [2019-12-19 04:33:25,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17452 states to 17452 states and 55312 transitions. [2019-12-19 04:33:25,658 INFO L78 Accepts]: Start accepts. Automaton has 17452 states and 55312 transitions. Word has length 78 [2019-12-19 04:33:25,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:25,658 INFO L462 AbstractCegarLoop]: Abstraction has 17452 states and 55312 transitions. [2019-12-19 04:33:25,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 04:33:25,658 INFO L276 IsEmpty]: Start isEmpty. Operand 17452 states and 55312 transitions. [2019-12-19 04:33:25,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-19 04:33:25,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:25,674 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] [2019-12-19 04:33:25,674 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:25,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:25,674 INFO L82 PathProgramCache]: Analyzing trace with hash -286863040, now seen corresponding path program 1 times [2019-12-19 04:33:25,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:25,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214678392] [2019-12-19 04:33:25,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:25,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:25,724 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 04:33:25,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214678392] [2019-12-19 04:33:25,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:25,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 04:33:25,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083472967] [2019-12-19 04:33:25,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 04:33:25,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:25,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 04:33:25,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:33:25,726 INFO L87 Difference]: Start difference. First operand 17452 states and 55312 transitions. Second operand 3 states. [2019-12-19 04:33:25,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:25,942 INFO L93 Difference]: Finished difference Result 18716 states and 59025 transitions. [2019-12-19 04:33:25,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 04:33:25,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-12-19 04:33:25,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:25,970 INFO L225 Difference]: With dead ends: 18716 [2019-12-19 04:33:25,970 INFO L226 Difference]: Without dead ends: 18716 [2019-12-19 04:33:25,971 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 04:33:26,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18716 states. [2019-12-19 04:33:26,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18716 to 18068. [2019-12-19 04:33:26,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18068 states. [2019-12-19 04:33:26,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18068 states to 18068 states and 57126 transitions. [2019-12-19 04:33:26,218 INFO L78 Accepts]: Start accepts. Automaton has 18068 states and 57126 transitions. Word has length 79 [2019-12-19 04:33:26,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:26,219 INFO L462 AbstractCegarLoop]: Abstraction has 18068 states and 57126 transitions. [2019-12-19 04:33:26,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 04:33:26,219 INFO L276 IsEmpty]: Start isEmpty. Operand 18068 states and 57126 transitions. [2019-12-19 04:33:26,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 04:33:26,236 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:26,237 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:33:26,237 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:26,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:26,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1882330754, now seen corresponding path program 1 times [2019-12-19 04:33:26,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:26,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036999486] [2019-12-19 04:33:26,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:26,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:26,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:26,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036999486] [2019-12-19 04:33:26,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:26,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:33:26,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405281140] [2019-12-19 04:33:26,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:33:26,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:26,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:33:26,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:33:26,313 INFO L87 Difference]: Start difference. First operand 18068 states and 57126 transitions. Second operand 4 states. [2019-12-19 04:33:26,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:26,613 INFO L93 Difference]: Finished difference Result 21236 states and 66256 transitions. [2019-12-19 04:33:26,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 04:33:26,614 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-12-19 04:33:26,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:26,645 INFO L225 Difference]: With dead ends: 21236 [2019-12-19 04:33:26,645 INFO L226 Difference]: Without dead ends: 21236 [2019-12-19 04:33:26,645 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 04:33:26,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21236 states. [2019-12-19 04:33:26,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21236 to 20213. [2019-12-19 04:33:26,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20213 states. [2019-12-19 04:33:26,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20213 states to 20213 states and 63372 transitions. [2019-12-19 04:33:26,920 INFO L78 Accepts]: Start accepts. Automaton has 20213 states and 63372 transitions. Word has length 80 [2019-12-19 04:33:26,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:26,920 INFO L462 AbstractCegarLoop]: Abstraction has 20213 states and 63372 transitions. [2019-12-19 04:33:26,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:33:26,920 INFO L276 IsEmpty]: Start isEmpty. Operand 20213 states and 63372 transitions. [2019-12-19 04:33:26,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 04:33:26,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:26,940 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] [2019-12-19 04:33:26,940 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:26,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:26,940 INFO L82 PathProgramCache]: Analyzing trace with hash 476976255, now seen corresponding path program 1 times [2019-12-19 04:33:26,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:26,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817234637] [2019-12-19 04:33:26,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:26,987 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 04:33:26,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817234637] [2019-12-19 04:33:26,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:26,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 04:33:26,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321545907] [2019-12-19 04:33:26,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 04:33:26,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:26,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 04:33:26,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:33:26,989 INFO L87 Difference]: Start difference. First operand 20213 states and 63372 transitions. Second operand 3 states. [2019-12-19 04:33:27,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:27,224 INFO L93 Difference]: Finished difference Result 21556 states and 67295 transitions. [2019-12-19 04:33:27,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 04:33:27,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-12-19 04:33:27,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:27,257 INFO L225 Difference]: With dead ends: 21556 [2019-12-19 04:33:27,257 INFO L226 Difference]: Without dead ends: 21556 [2019-12-19 04:33:27,257 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 04:33:27,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21556 states. [2019-12-19 04:33:27,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21556 to 20893. [2019-12-19 04:33:27,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20893 states. [2019-12-19 04:33:27,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20893 states to 20893 states and 65352 transitions. [2019-12-19 04:33:27,558 INFO L78 Accepts]: Start accepts. Automaton has 20893 states and 65352 transitions. Word has length 80 [2019-12-19 04:33:27,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:27,558 INFO L462 AbstractCegarLoop]: Abstraction has 20893 states and 65352 transitions. [2019-12-19 04:33:27,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 04:33:27,558 INFO L276 IsEmpty]: Start isEmpty. Operand 20893 states and 65352 transitions. [2019-12-19 04:33:27,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-19 04:33:27,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:27,580 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] [2019-12-19 04:33:27,580 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:27,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:27,581 INFO L82 PathProgramCache]: Analyzing trace with hash 286965984, now seen corresponding path program 1 times [2019-12-19 04:33:27,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:27,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523295553] [2019-12-19 04:33:27,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:27,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:27,710 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 04:33:27,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523295553] [2019-12-19 04:33:27,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:27,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:33:27,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518000954] [2019-12-19 04:33:27,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:33:27,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:27,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:33:27,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:33:27,713 INFO L87 Difference]: Start difference. First operand 20893 states and 65352 transitions. Second operand 6 states. [2019-12-19 04:33:28,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:28,667 INFO L93 Difference]: Finished difference Result 29926 states and 92023 transitions. [2019-12-19 04:33:28,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 04:33:28,667 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-12-19 04:33:28,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:28,732 INFO L225 Difference]: With dead ends: 29926 [2019-12-19 04:33:28,732 INFO L226 Difference]: Without dead ends: 29620 [2019-12-19 04:33:28,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-19 04:33:28,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29620 states. [2019-12-19 04:33:29,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29620 to 23908. [2019-12-19 04:33:29,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23908 states. [2019-12-19 04:33:29,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23908 states to 23908 states and 74649 transitions. [2019-12-19 04:33:29,221 INFO L78 Accepts]: Start accepts. Automaton has 23908 states and 74649 transitions. Word has length 81 [2019-12-19 04:33:29,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:29,221 INFO L462 AbstractCegarLoop]: Abstraction has 23908 states and 74649 transitions. [2019-12-19 04:33:29,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:33:29,221 INFO L276 IsEmpty]: Start isEmpty. Operand 23908 states and 74649 transitions. [2019-12-19 04:33:29,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-19 04:33:29,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:29,244 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] [2019-12-19 04:33:29,244 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:29,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:29,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1248580001, now seen corresponding path program 1 times [2019-12-19 04:33:29,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:29,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820009020] [2019-12-19 04:33:29,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:29,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:29,336 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 04:33:29,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820009020] [2019-12-19 04:33:29,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:29,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:33:29,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707778992] [2019-12-19 04:33:29,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:33:29,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:29,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:33:29,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:33:29,338 INFO L87 Difference]: Start difference. First operand 23908 states and 74649 transitions. Second operand 7 states. [2019-12-19 04:33:30,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:30,582 INFO L93 Difference]: Finished difference Result 41338 states and 124799 transitions. [2019-12-19 04:33:30,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-19 04:33:30,583 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2019-12-19 04:33:30,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:30,643 INFO L225 Difference]: With dead ends: 41338 [2019-12-19 04:33:30,643 INFO L226 Difference]: Without dead ends: 41266 [2019-12-19 04:33:30,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-12-19 04:33:30,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41266 states. [2019-12-19 04:33:31,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41266 to 25666. [2019-12-19 04:33:31,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25666 states. [2019-12-19 04:33:31,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25666 states to 25666 states and 78735 transitions. [2019-12-19 04:33:31,077 INFO L78 Accepts]: Start accepts. Automaton has 25666 states and 78735 transitions. Word has length 81 [2019-12-19 04:33:31,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:31,077 INFO L462 AbstractCegarLoop]: Abstraction has 25666 states and 78735 transitions. [2019-12-19 04:33:31,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:33:31,077 INFO L276 IsEmpty]: Start isEmpty. Operand 25666 states and 78735 transitions. [2019-12-19 04:33:31,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-19 04:33:31,099 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:31,099 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] [2019-12-19 04:33:31,099 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:31,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:31,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1471857053, now seen corresponding path program 1 times [2019-12-19 04:33:31,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:31,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8456453] [2019-12-19 04:33:31,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:31,187 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 04:33:31,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8456453] [2019-12-19 04:33:31,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:31,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:33:31,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591164706] [2019-12-19 04:33:31,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:33:31,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:31,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:33:31,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:33:31,189 INFO L87 Difference]: Start difference. First operand 25666 states and 78735 transitions. Second operand 5 states. [2019-12-19 04:33:31,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:31,234 INFO L93 Difference]: Finished difference Result 3883 states and 9541 transitions. [2019-12-19 04:33:31,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 04:33:31,235 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-12-19 04:33:31,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:31,239 INFO L225 Difference]: With dead ends: 3883 [2019-12-19 04:33:31,240 INFO L226 Difference]: Without dead ends: 3244 [2019-12-19 04:33:31,240 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 04:33:31,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3244 states. [2019-12-19 04:33:31,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3244 to 2748. [2019-12-19 04:33:31,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2748 states. [2019-12-19 04:33:31,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2748 states to 2748 states and 6752 transitions. [2019-12-19 04:33:31,287 INFO L78 Accepts]: Start accepts. Automaton has 2748 states and 6752 transitions. Word has length 81 [2019-12-19 04:33:31,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:31,288 INFO L462 AbstractCegarLoop]: Abstraction has 2748 states and 6752 transitions. [2019-12-19 04:33:31,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:33:31,288 INFO L276 IsEmpty]: Start isEmpty. Operand 2748 states and 6752 transitions. [2019-12-19 04:33:31,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-19 04:33:31,292 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:31,292 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, 1, 1, 1, 1, 1] [2019-12-19 04:33:31,292 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:31,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:31,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1371074038, now seen corresponding path program 1 times [2019-12-19 04:33:31,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:31,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897417389] [2019-12-19 04:33:31,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:31,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 04:33:31,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897417389] [2019-12-19 04:33:31,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:31,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:33:31,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420052390] [2019-12-19 04:33:31,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:33:31,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:31,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:33:31,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:33:31,406 INFO L87 Difference]: Start difference. First operand 2748 states and 6752 transitions. Second operand 6 states. [2019-12-19 04:33:31,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:31,522 INFO L93 Difference]: Finished difference Result 3045 states and 7292 transitions. [2019-12-19 04:33:31,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:33:31,522 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-19 04:33:31,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:31,525 INFO L225 Difference]: With dead ends: 3045 [2019-12-19 04:33:31,526 INFO L226 Difference]: Without dead ends: 2991 [2019-12-19 04:33:31,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:33:31,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2991 states. [2019-12-19 04:33:31,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2991 to 2763. [2019-12-19 04:33:31,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2763 states. [2019-12-19 04:33:31,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2763 states to 2763 states and 6721 transitions. [2019-12-19 04:33:31,552 INFO L78 Accepts]: Start accepts. Automaton has 2763 states and 6721 transitions. Word has length 93 [2019-12-19 04:33:31,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:31,552 INFO L462 AbstractCegarLoop]: Abstraction has 2763 states and 6721 transitions. [2019-12-19 04:33:31,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:33:31,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2763 states and 6721 transitions. [2019-12-19 04:33:31,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-19 04:33:31,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:31,579 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, 1, 1, 1, 1, 1] [2019-12-19 04:33:31,579 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:31,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:31,579 INFO L82 PathProgramCache]: Analyzing trace with hash -652047913, now seen corresponding path program 1 times [2019-12-19 04:33:31,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:31,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911959368] [2019-12-19 04:33:31,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:31,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 04:33:31,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911959368] [2019-12-19 04:33:31,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:31,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:33:31,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407898862] [2019-12-19 04:33:31,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:33:31,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:31,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:33:31,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:33:31,650 INFO L87 Difference]: Start difference. First operand 2763 states and 6721 transitions. Second operand 5 states. [2019-12-19 04:33:31,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:31,917 INFO L93 Difference]: Finished difference Result 3358 states and 8038 transitions. [2019-12-19 04:33:31,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:33:31,918 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-12-19 04:33:31,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:31,924 INFO L225 Difference]: With dead ends: 3358 [2019-12-19 04:33:31,925 INFO L226 Difference]: Without dead ends: 3323 [2019-12-19 04:33:31,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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 04:33:31,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3323 states. [2019-12-19 04:33:31,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3323 to 2834. [2019-12-19 04:33:31,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2834 states. [2019-12-19 04:33:31,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2834 states to 2834 states and 6869 transitions. [2019-12-19 04:33:31,985 INFO L78 Accepts]: Start accepts. Automaton has 2834 states and 6869 transitions. Word has length 93 [2019-12-19 04:33:31,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:31,986 INFO L462 AbstractCegarLoop]: Abstraction has 2834 states and 6869 transitions. [2019-12-19 04:33:31,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:33:31,986 INFO L276 IsEmpty]: Start isEmpty. Operand 2834 states and 6869 transitions. [2019-12-19 04:33:31,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-19 04:33:31,991 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:31,991 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:33:31,991 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:31,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:31,992 INFO L82 PathProgramCache]: Analyzing trace with hash 189307245, now seen corresponding path program 1 times [2019-12-19 04:33:31,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:31,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097504561] [2019-12-19 04:33:31,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:32,113 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 04:33:32,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097504561] [2019-12-19 04:33:32,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:32,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:33:32,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138100135] [2019-12-19 04:33:32,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:33:32,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:32,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:33:32,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:33:32,116 INFO L87 Difference]: Start difference. First operand 2834 states and 6869 transitions. Second operand 6 states. [2019-12-19 04:33:32,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:32,267 INFO L93 Difference]: Finished difference Result 2895 states and 6964 transitions. [2019-12-19 04:33:32,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:33:32,268 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-19 04:33:32,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:32,274 INFO L225 Difference]: With dead ends: 2895 [2019-12-19 04:33:32,274 INFO L226 Difference]: Without dead ends: 2895 [2019-12-19 04:33:32,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:33:32,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2019-12-19 04:33:32,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 2715. [2019-12-19 04:33:32,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2715 states. [2019-12-19 04:33:32,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2715 states to 2715 states and 6540 transitions. [2019-12-19 04:33:32,315 INFO L78 Accepts]: Start accepts. Automaton has 2715 states and 6540 transitions. Word has length 93 [2019-12-19 04:33:32,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:32,315 INFO L462 AbstractCegarLoop]: Abstraction has 2715 states and 6540 transitions. [2019-12-19 04:33:32,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:33:32,316 INFO L276 IsEmpty]: Start isEmpty. Operand 2715 states and 6540 transitions. [2019-12-19 04:33:32,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-19 04:33:32,320 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:32,320 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, 1, 1, 1, 1, 1] [2019-12-19 04:33:32,321 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:32,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:32,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1511433234, now seen corresponding path program 1 times [2019-12-19 04:33:32,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:32,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262585493] [2019-12-19 04:33:32,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:32,433 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 04:33:32,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262585493] [2019-12-19 04:33:32,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:32,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:33:32,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148039309] [2019-12-19 04:33:32,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:33:32,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:32,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:33:32,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:33:32,436 INFO L87 Difference]: Start difference. First operand 2715 states and 6540 transitions. Second operand 6 states. [2019-12-19 04:33:32,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:32,731 INFO L93 Difference]: Finished difference Result 3669 states and 8759 transitions. [2019-12-19 04:33:32,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:33:32,732 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-19 04:33:32,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:32,737 INFO L225 Difference]: With dead ends: 3669 [2019-12-19 04:33:32,737 INFO L226 Difference]: Without dead ends: 3651 [2019-12-19 04:33:32,737 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 04:33:32,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3651 states. [2019-12-19 04:33:32,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3651 to 2845. [2019-12-19 04:33:32,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2845 states. [2019-12-19 04:33:32,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2845 states to 2845 states and 6827 transitions. [2019-12-19 04:33:32,766 INFO L78 Accepts]: Start accepts. Automaton has 2845 states and 6827 transitions. Word has length 93 [2019-12-19 04:33:32,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:32,766 INFO L462 AbstractCegarLoop]: Abstraction has 2845 states and 6827 transitions. [2019-12-19 04:33:32,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:33:32,766 INFO L276 IsEmpty]: Start isEmpty. Operand 2845 states and 6827 transitions. [2019-12-19 04:33:32,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-19 04:33:32,769 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:32,769 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, 1, 1, 1, 1, 1] [2019-12-19 04:33:32,769 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:32,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:32,769 INFO L82 PathProgramCache]: Analyzing trace with hash -549819217, now seen corresponding path program 1 times [2019-12-19 04:33:32,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:32,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023564054] [2019-12-19 04:33:32,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:32,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:32,853 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 04:33:32,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023564054] [2019-12-19 04:33:32,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:32,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:33:32,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304965910] [2019-12-19 04:33:32,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:33:32,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:32,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:33:32,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:33:32,855 INFO L87 Difference]: Start difference. First operand 2845 states and 6827 transitions. Second operand 7 states. [2019-12-19 04:33:33,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:33,276 INFO L93 Difference]: Finished difference Result 5636 states and 13822 transitions. [2019-12-19 04:33:33,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 04:33:33,276 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-12-19 04:33:33,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:33,285 INFO L225 Difference]: With dead ends: 5636 [2019-12-19 04:33:33,285 INFO L226 Difference]: Without dead ends: 5636 [2019-12-19 04:33:33,286 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 04:33:33,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5636 states. [2019-12-19 04:33:33,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5636 to 2925. [2019-12-19 04:33:33,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2925 states. [2019-12-19 04:33:33,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2925 states to 2925 states and 7017 transitions. [2019-12-19 04:33:33,345 INFO L78 Accepts]: Start accepts. Automaton has 2925 states and 7017 transitions. Word has length 93 [2019-12-19 04:33:33,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:33,345 INFO L462 AbstractCegarLoop]: Abstraction has 2925 states and 7017 transitions. [2019-12-19 04:33:33,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:33:33,345 INFO L276 IsEmpty]: Start isEmpty. Operand 2925 states and 7017 transitions. [2019-12-19 04:33:33,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-19 04:33:33,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:33,349 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, 1, 1, 1, 1, 1] [2019-12-19 04:33:33,349 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:33,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:33,350 INFO L82 PathProgramCache]: Analyzing trace with hash 694945264, now seen corresponding path program 1 times [2019-12-19 04:33:33,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:33,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845444092] [2019-12-19 04:33:33,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:33,462 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 04:33:33,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845444092] [2019-12-19 04:33:33,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:33,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:33:33,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043316894] [2019-12-19 04:33:33,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:33:33,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:33,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:33:33,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:33:33,464 INFO L87 Difference]: Start difference. First operand 2925 states and 7017 transitions. Second operand 5 states. [2019-12-19 04:33:33,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:33,509 INFO L93 Difference]: Finished difference Result 4582 states and 11187 transitions. [2019-12-19 04:33:33,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 04:33:33,509 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-12-19 04:33:33,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:33,516 INFO L225 Difference]: With dead ends: 4582 [2019-12-19 04:33:33,516 INFO L226 Difference]: Without dead ends: 4582 [2019-12-19 04:33:33,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:33:33,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4582 states. [2019-12-19 04:33:33,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4582 to 2893. [2019-12-19 04:33:33,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2893 states. [2019-12-19 04:33:33,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2893 states to 2893 states and 6860 transitions. [2019-12-19 04:33:33,564 INFO L78 Accepts]: Start accepts. Automaton has 2893 states and 6860 transitions. Word has length 93 [2019-12-19 04:33:33,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:33,565 INFO L462 AbstractCegarLoop]: Abstraction has 2893 states and 6860 transitions. [2019-12-19 04:33:33,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:33:33,565 INFO L276 IsEmpty]: Start isEmpty. Operand 2893 states and 6860 transitions. [2019-12-19 04:33:33,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-19 04:33:33,569 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:33,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, 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 04:33:33,569 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:33,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:33,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1240715023, now seen corresponding path program 1 times [2019-12-19 04:33:33,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:33,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972300388] [2019-12-19 04:33:33,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:33,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:33,680 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 04:33:33,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972300388] [2019-12-19 04:33:33,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:33,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:33:33,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922193710] [2019-12-19 04:33:33,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:33:33,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:33,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:33:33,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:33:33,684 INFO L87 Difference]: Start difference. First operand 2893 states and 6860 transitions. Second operand 6 states. [2019-12-19 04:33:33,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:33,735 INFO L93 Difference]: Finished difference Result 4278 states and 10364 transitions. [2019-12-19 04:33:33,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 04:33:33,736 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-19 04:33:33,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:33,742 INFO L225 Difference]: With dead ends: 4278 [2019-12-19 04:33:33,742 INFO L226 Difference]: Without dead ends: 4278 [2019-12-19 04:33:33,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:33:33,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4278 states. [2019-12-19 04:33:33,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4278 to 2722. [2019-12-19 04:33:33,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2722 states. [2019-12-19 04:33:33,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2722 states to 2722 states and 6411 transitions. [2019-12-19 04:33:33,788 INFO L78 Accepts]: Start accepts. Automaton has 2722 states and 6411 transitions. Word has length 93 [2019-12-19 04:33:33,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:33,788 INFO L462 AbstractCegarLoop]: Abstraction has 2722 states and 6411 transitions. [2019-12-19 04:33:33,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:33:33,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2722 states and 6411 transitions. [2019-12-19 04:33:33,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-19 04:33:33,792 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:33,792 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, 1, 1, 1, 1, 1] [2019-12-19 04:33:33,792 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:33,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:33,793 INFO L82 PathProgramCache]: Analyzing trace with hash -759998607, now seen corresponding path program 1 times [2019-12-19 04:33:33,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:33,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963246447] [2019-12-19 04:33:33,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:33,944 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 04:33:33,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963246447] [2019-12-19 04:33:33,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:33,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:33:33,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354838245] [2019-12-19 04:33:33,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:33:33,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:33,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:33:33,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:33:33,946 INFO L87 Difference]: Start difference. First operand 2722 states and 6411 transitions. Second operand 6 states. [2019-12-19 04:33:34,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:34,134 INFO L93 Difference]: Finished difference Result 2605 states and 6021 transitions. [2019-12-19 04:33:34,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:33:34,134 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-19 04:33:34,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:34,137 INFO L225 Difference]: With dead ends: 2605 [2019-12-19 04:33:34,138 INFO L226 Difference]: Without dead ends: 2605 [2019-12-19 04:33:34,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:33:34,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2605 states. [2019-12-19 04:33:34,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2605 to 1987. [2019-12-19 04:33:34,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1987 states. [2019-12-19 04:33:34,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1987 states and 4681 transitions. [2019-12-19 04:33:34,168 INFO L78 Accepts]: Start accepts. Automaton has 1987 states and 4681 transitions. Word has length 93 [2019-12-19 04:33:34,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:34,168 INFO L462 AbstractCegarLoop]: Abstraction has 1987 states and 4681 transitions. [2019-12-19 04:33:34,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:33:34,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 4681 transitions. [2019-12-19 04:33:34,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 04:33:34,172 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:34,172 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:33:34,173 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:34,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:34,173 INFO L82 PathProgramCache]: Analyzing trace with hash 469539040, now seen corresponding path program 1 times [2019-12-19 04:33:34,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:34,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540596730] [2019-12-19 04:33:34,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:34,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:34,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540596730] [2019-12-19 04:33:34,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:34,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:33:34,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451758233] [2019-12-19 04:33:34,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:33:34,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:34,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:33:34,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:33:34,287 INFO L87 Difference]: Start difference. First operand 1987 states and 4681 transitions. Second operand 6 states. [2019-12-19 04:33:34,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:34,469 INFO L93 Difference]: Finished difference Result 2215 states and 5077 transitions. [2019-12-19 04:33:34,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 04:33:34,470 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-19 04:33:34,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:34,475 INFO L225 Difference]: With dead ends: 2215 [2019-12-19 04:33:34,475 INFO L226 Difference]: Without dead ends: 2215 [2019-12-19 04:33:34,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 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 04:33:34,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2019-12-19 04:33:34,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 2019. [2019-12-19 04:33:34,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2019 states. [2019-12-19 04:33:34,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 4705 transitions. [2019-12-19 04:33:34,503 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 4705 transitions. Word has length 95 [2019-12-19 04:33:34,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:34,504 INFO L462 AbstractCegarLoop]: Abstraction has 2019 states and 4705 transitions. [2019-12-19 04:33:34,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:33:34,504 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 4705 transitions. [2019-12-19 04:33:34,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 04:33:34,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:34,507 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:33:34,507 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:34,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:34,507 INFO L82 PathProgramCache]: Analyzing trace with hash 593612287, now seen corresponding path program 1 times [2019-12-19 04:33:34,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:34,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001623536] [2019-12-19 04:33:34,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:34,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:34,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001623536] [2019-12-19 04:33:34,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:34,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:33:34,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413904899] [2019-12-19 04:33:34,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:33:34,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:34,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:33:34,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:33:34,582 INFO L87 Difference]: Start difference. First operand 2019 states and 4705 transitions. Second operand 5 states. [2019-12-19 04:33:34,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:34,765 INFO L93 Difference]: Finished difference Result 2271 states and 5284 transitions. [2019-12-19 04:33:34,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:33:34,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-19 04:33:34,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:34,769 INFO L225 Difference]: With dead ends: 2271 [2019-12-19 04:33:34,769 INFO L226 Difference]: Without dead ends: 2253 [2019-12-19 04:33:34,770 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 04:33:34,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2253 states. [2019-12-19 04:33:34,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2253 to 2046. [2019-12-19 04:33:34,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2046 states. [2019-12-19 04:33:34,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 2046 states and 4759 transitions. [2019-12-19 04:33:34,790 INFO L78 Accepts]: Start accepts. Automaton has 2046 states and 4759 transitions. Word has length 95 [2019-12-19 04:33:34,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:34,790 INFO L462 AbstractCegarLoop]: Abstraction has 2046 states and 4759 transitions. [2019-12-19 04:33:34,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:33:34,791 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 4759 transitions. [2019-12-19 04:33:34,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 04:33:34,792 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:34,792 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:33:34,793 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:34,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:34,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1838376768, now seen corresponding path program 1 times [2019-12-19 04:33:34,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:34,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125818477] [2019-12-19 04:33:34,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:34,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:34,881 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 04:33:34,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125818477] [2019-12-19 04:33:34,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:34,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:33:34,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969513625] [2019-12-19 04:33:34,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:33:34,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:34,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:33:34,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:33:34,883 INFO L87 Difference]: Start difference. First operand 2046 states and 4759 transitions. Second operand 6 states. [2019-12-19 04:33:34,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:34,988 INFO L93 Difference]: Finished difference Result 2123 states and 4906 transitions. [2019-12-19 04:33:34,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:33:34,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-19 04:33:34,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:34,991 INFO L225 Difference]: With dead ends: 2123 [2019-12-19 04:33:34,991 INFO L226 Difference]: Without dead ends: 2123 [2019-12-19 04:33:34,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:33:34,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2019-12-19 04:33:35,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 2020. [2019-12-19 04:33:35,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2020 states. [2019-12-19 04:33:35,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 4707 transitions. [2019-12-19 04:33:35,008 INFO L78 Accepts]: Start accepts. Automaton has 2020 states and 4707 transitions. Word has length 95 [2019-12-19 04:33:35,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:35,009 INFO L462 AbstractCegarLoop]: Abstraction has 2020 states and 4707 transitions. [2019-12-19 04:33:35,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:33:35,009 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 4707 transitions. [2019-12-19 04:33:35,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 04:33:35,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:35,012 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:33:35,013 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:35,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:35,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1806431583, now seen corresponding path program 1 times [2019-12-19 04:33:35,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:35,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423622561] [2019-12-19 04:33:35,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:35,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:35,197 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 04:33:35,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423622561] [2019-12-19 04:33:35,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:35,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:33:35,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148611380] [2019-12-19 04:33:35,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:33:35,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:35,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:33:35,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:33:35,200 INFO L87 Difference]: Start difference. First operand 2020 states and 4707 transitions. Second operand 7 states. [2019-12-19 04:33:35,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:35,319 INFO L93 Difference]: Finished difference Result 3287 states and 7773 transitions. [2019-12-19 04:33:35,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:33:35,320 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-19 04:33:35,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:35,323 INFO L225 Difference]: With dead ends: 3287 [2019-12-19 04:33:35,323 INFO L226 Difference]: Without dead ends: 1455 [2019-12-19 04:33:35,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-19 04:33:35,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2019-12-19 04:33:35,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 1455. [2019-12-19 04:33:35,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1455 states. [2019-12-19 04:33:35,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 3420 transitions. [2019-12-19 04:33:35,351 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 3420 transitions. Word has length 95 [2019-12-19 04:33:35,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:35,351 INFO L462 AbstractCegarLoop]: Abstraction has 1455 states and 3420 transitions. [2019-12-19 04:33:35,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:33:35,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 3420 transitions. [2019-12-19 04:33:35,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 04:33:35,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:35,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:33:35,355 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:35,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:35,355 INFO L82 PathProgramCache]: Analyzing trace with hash -2061196609, now seen corresponding path program 2 times [2019-12-19 04:33:35,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:35,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774515733] [2019-12-19 04:33:35,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:35,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:35,548 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 04:33:35,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774515733] [2019-12-19 04:33:35,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:35,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-19 04:33:35,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149325221] [2019-12-19 04:33:35,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-19 04:33:35,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:35,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-19 04:33:35,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-12-19 04:33:35,551 INFO L87 Difference]: Start difference. First operand 1455 states and 3420 transitions. Second operand 11 states. [2019-12-19 04:33:35,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:35,883 INFO L93 Difference]: Finished difference Result 2624 states and 6270 transitions. [2019-12-19 04:33:35,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 04:33:35,884 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2019-12-19 04:33:35,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:35,887 INFO L225 Difference]: With dead ends: 2624 [2019-12-19 04:33:35,888 INFO L226 Difference]: Without dead ends: 1985 [2019-12-19 04:33:35,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-12-19 04:33:35,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2019-12-19 04:33:35,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1873. [2019-12-19 04:33:35,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1873 states. [2019-12-19 04:33:35,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 4324 transitions. [2019-12-19 04:33:35,912 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 4324 transitions. Word has length 95 [2019-12-19 04:33:35,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:35,913 INFO L462 AbstractCegarLoop]: Abstraction has 1873 states and 4324 transitions. [2019-12-19 04:33:35,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-19 04:33:35,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 4324 transitions. [2019-12-19 04:33:35,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 04:33:35,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:35,915 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:33:35,916 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:35,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:35,916 INFO L82 PathProgramCache]: Analyzing trace with hash 331051299, now seen corresponding path program 3 times [2019-12-19 04:33:35,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:35,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551643265] [2019-12-19 04:33:35,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 04:33:35,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 04:33:36,020 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 04:33:36,020 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 04:33:36,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 04:33:36 BasicIcfg [2019-12-19 04:33:36,204 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 04:33:36,206 INFO L168 Benchmark]: Toolchain (without parser) took 55200.13 ms. Allocated memory was 144.2 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 100.5 MB in the beginning and 1.1 GB in the end (delta: -951.8 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-19 04:33:36,207 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-19 04:33:36,207 INFO L168 Benchmark]: CACSL2BoogieTranslator took 742.41 ms. Allocated memory was 144.2 MB in the beginning and 202.4 MB in the end (delta: 58.2 MB). Free memory was 100.1 MB in the beginning and 157.0 MB in the end (delta: -56.9 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. [2019-12-19 04:33:36,207 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.01 ms. Allocated memory is still 202.4 MB. Free memory was 156.4 MB in the beginning and 153.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-19 04:33:36,208 INFO L168 Benchmark]: Boogie Preprocessor took 39.65 ms. Allocated memory is still 202.4 MB. Free memory was 153.7 MB in the beginning and 151.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-19 04:33:36,208 INFO L168 Benchmark]: RCFGBuilder took 759.31 ms. Allocated memory is still 202.4 MB. Free memory was 151.6 MB in the beginning and 107.1 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. [2019-12-19 04:33:36,209 INFO L168 Benchmark]: TraceAbstraction took 53573.80 ms. Allocated memory was 202.4 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 107.1 MB in the beginning and 1.1 GB in the end (delta: -945.2 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-19 04:33:36,211 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 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 742.41 ms. Allocated memory was 144.2 MB in the beginning and 202.4 MB in the end (delta: 58.2 MB). Free memory was 100.1 MB in the beginning and 157.0 MB in the end (delta: -56.9 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.01 ms. Allocated memory is still 202.4 MB. Free memory was 156.4 MB in the beginning and 153.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.65 ms. Allocated memory is still 202.4 MB. Free memory was 153.7 MB in the beginning and 151.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 759.31 ms. Allocated memory is still 202.4 MB. Free memory was 151.6 MB in the beginning and 107.1 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 53573.80 ms. Allocated memory was 202.4 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 107.1 MB in the beginning and 1.1 GB in the end (delta: -945.2 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L697] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L698] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L700] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L703] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L704] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L705] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L706] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L707] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L708] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L709] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L710] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L711] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L712] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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}] [L713] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L714] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L715] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L716] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L717] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L718] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L778] 0 pthread_t t2011; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L779] FCALL, FORK 0 pthread_create(&t2011, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L780] 0 pthread_t t2012; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L781] FCALL, FORK 0 pthread_create(&t2012, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 2 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 __unbuffered_p1_EAX = x [L753] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L756] 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_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L756] 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_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L756] 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) [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] 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 [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L758] 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 [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L760] 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_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L760] 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 [L763] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 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_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 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_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 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) [L788] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] 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_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L789] 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 [L790] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] 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_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] 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 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 y$flush_delayed = weak$$choice2 [L797] 0 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L799] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L800] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L802] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L804] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y = y$flush_delayed ? y$mem_tmp : y [L807] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 53.2s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 21.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8654 SDtfs, 9196 SDslu, 20152 SDs, 0 SdLazy, 7815 SolverSat, 544 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 360 GetRequests, 95 SyntacticMatches, 19 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84350occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 23.0s AutomataMinimizationTime, 33 MinimizatonAttempts, 126401 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 2647 NumberOfCodeBlocks, 2647 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2519 ConstructedInterpolants, 0 QuantifiedInterpolants, 450991 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...