/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-mutex_fs-binfmt_misc.cil.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 01:31:44,624 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 01:31:44,627 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 01:31:44,646 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 01:31:44,646 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 01:31:44,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 01:31:44,650 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 01:31:44,659 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 01:31:44,663 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 01:31:44,666 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 01:31:44,668 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 01:31:44,669 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 01:31:44,670 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 01:31:44,671 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 01:31:44,674 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 01:31:44,675 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 01:31:44,676 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 01:31:44,677 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 01:31:44,678 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 01:31:44,683 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 01:31:44,687 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 01:31:44,691 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 01:31:44,692 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 01:31:44,693 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 01:31:44,694 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 01:31:44,695 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 01:31:44,695 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 01:31:44,696 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 01:31:44,698 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 01:31:44,698 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 01:31:44,699 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 01:31:44,700 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 01:31:44,701 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 01:31:44,702 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 01:31:44,703 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 01:31:44,703 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 01:31:44,704 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 01:31:44,704 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 01:31:44,704 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 01:31:44,705 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 01:31:44,706 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 01:31:44,707 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-24 01:31:44,738 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 01:31:44,738 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 01:31:44,739 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 01:31:44,740 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 01:31:44,740 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 01:31:44,741 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 01:31:44,741 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 01:31:44,741 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 01:31:44,741 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 01:31:44,742 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 01:31:44,743 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 01:31:44,743 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 01:31:44,743 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 01:31:44,744 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 01:31:44,744 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 01:31:44,745 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 01:31:44,745 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 01:31:44,745 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 01:31:44,745 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 01:31:44,746 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 01:31:44,747 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 01:31:44,748 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 01:31:44,748 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 01:31:44,749 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 01:31:44,750 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 01:31:44,750 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 01:31:44,750 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 01:31:44,750 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 01:31:44,751 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 01:31:44,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 01:31:44,753 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 01:31:44,753 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 01:31:44,753 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 01:31:44,753 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 01:31:44,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 01:31:44,754 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 01:31:44,754 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 01:31:44,754 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 01:31:45,008 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 01:31:45,022 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 01:31:45,026 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 01:31:45,031 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 01:31:45,032 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 01:31:45,032 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-mutex_fs-binfmt_misc.cil.i [2019-11-24 01:31:45,101 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97e546431/aa82e6f4fa0b46e7bc99c0dbf801f905/FLAGdc8dfba97 [2019-11-24 01:31:45,874 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 01:31:45,875 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-3.14/linux-3.14_complex_emg_linux-kernel-locking-mutex_fs-binfmt_misc.cil.i [2019-11-24 01:31:45,915 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97e546431/aa82e6f4fa0b46e7bc99c0dbf801f905/FLAGdc8dfba97 [2019-11-24 01:31:45,943 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97e546431/aa82e6f4fa0b46e7bc99c0dbf801f905 [2019-11-24 01:31:45,951 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 01:31:45,953 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 01:31:45,954 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 01:31:45,954 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 01:31:45,958 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 01:31:45,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:31:45" (1/1) ... [2019-11-24 01:31:45,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e9cb038 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:31:45, skipping insertion in model container [2019-11-24 01:31:45,962 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:31:45" (1/1) ... [2019-11-24 01:31:45,969 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 01:31:46,091 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 01:31:48,254 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 01:31:48,296 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 01:31:48,652 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 01:31:48,964 INFO L208 MainTranslator]: Completed translation [2019-11-24 01:31:48,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:31:48 WrapperNode [2019-11-24 01:31:48,965 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 01:31:48,966 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 01:31:48,966 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 01:31:48,966 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 01:31:48,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:31:48" (1/1) ... [2019-11-24 01:31:49,070 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:31:48" (1/1) ... [2019-11-24 01:31:49,409 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 01:31:49,410 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 01:31:49,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 01:31:49,410 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 01:31:49,426 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:31:48" (1/1) ... [2019-11-24 01:31:49,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:31:48" (1/1) ... [2019-11-24 01:31:49,487 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:31:48" (1/1) ... [2019-11-24 01:31:49,488 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:31:48" (1/1) ... [2019-11-24 01:31:49,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:31:48" (1/1) ... [2019-11-24 01:31:49,671 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:31:48" (1/1) ... [2019-11-24 01:31:49,697 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:31:48" (1/1) ... [2019-11-24 01:31:49,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 01:31:49,732 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 01:31:49,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 01:31:49,732 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 01:31:49,733 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:31:48" (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-11-24 01:31:49,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 01:31:49,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-24 01:31:49,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-24 01:31:49,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-24 01:31:49,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-24 01:31:49,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-24 01:31:49,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-24 01:31:49,804 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2019-11-24 01:31:49,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-24 01:31:49,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 01:31:49,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 01:31:49,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 01:31:55,124 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_switch_2_switch_break: ldv_switch_2_#res := 0; [2019-11-24 01:31:55,125 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_switch_1_switch_break#2: ldv_switch_1_#res := 0; [2019-11-24 01:31:55,125 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_switch_2_switch_break#2: ldv_switch_2_#res := 0; [2019-11-24 01:31:55,125 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_switch_1_switch_break: ldv_switch_1_#res := 0; [2019-11-24 01:31:55,126 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_switch_0_switch_break: ldv_switch_0_#res := 0; [2019-11-24 01:31:55,127 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-11-24 01:31:55,127 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_switch_0_switch_break#3: ldv_switch_0_#res := 0; [2019-11-24 01:31:55,127 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_switch_0_switch_break#4: ldv_switch_0_#res := 0; [2019-11-24 01:31:55,127 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_switch_0_switch_break#5: ldv_switch_0_#res := 0; [2019-11-24 01:31:55,127 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_switch_0_switch_break#6: ldv_switch_0_#res := 0; [2019-11-24 01:31:55,128 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_switch_0_switch_break#2: ldv_switch_0_#res := 0; [2019-11-24 01:32:06,949 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 01:32:06,949 INFO L284 CfgBuilder]: Removed 1490 assume(true) statements. [2019-11-24 01:32:06,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:32:06 BoogieIcfgContainer [2019-11-24 01:32:06,951 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 01:32:06,952 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 01:32:06,952 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 01:32:06,955 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 01:32:06,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:31:45" (1/3) ... [2019-11-24 01:32:06,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@351685e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:32:06, skipping insertion in model container [2019-11-24 01:32:06,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:31:48" (2/3) ... [2019-11-24 01:32:06,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@351685e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:32:06, skipping insertion in model container [2019-11-24 01:32:06,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:32:06" (3/3) ... [2019-11-24 01:32:06,958 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-3.14_complex_emg_linux-kernel-locking-mutex_fs-binfmt_misc.cil.i [2019-11-24 01:32:06,967 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 01:32:06,976 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2019-11-24 01:32:06,984 INFO L249 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2019-11-24 01:32:07,016 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 01:32:07,016 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 01:32:07,016 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 01:32:07,017 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 01:32:07,017 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 01:32:07,017 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 01:32:07,017 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 01:32:07,017 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 01:32:07,053 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states. [2019-11-24 01:32:07,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-24 01:32:07,063 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:32:07,064 INFO L410 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] [2019-11-24 01:32:07,065 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:32:07,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:32:07,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1443514630, now seen corresponding path program 1 times [2019-11-24 01:32:07,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:32:07,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191396754] [2019-11-24 01:32:07,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:32:07,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:32:07,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 01:32:07,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191396754] [2019-11-24 01:32:07,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:32:07,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 01:32:07,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214136472] [2019-11-24 01:32:07,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:32:07,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:32:07,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:32:07,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:32:07,737 INFO L87 Difference]: Start difference. First operand 737 states. Second operand 3 states. [2019-11-24 01:32:08,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:32:08,079 INFO L93 Difference]: Finished difference Result 1853 states and 2956 transitions. [2019-11-24 01:32:08,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:32:08,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-11-24 01:32:08,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:32:08,115 INFO L225 Difference]: With dead ends: 1853 [2019-11-24 01:32:08,115 INFO L226 Difference]: Without dead ends: 1033 [2019-11-24 01:32:08,125 INFO L630 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-11-24 01:32:08,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2019-11-24 01:32:08,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 1009. [2019-11-24 01:32:08,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1009 states. [2019-11-24 01:32:08,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1503 transitions. [2019-11-24 01:32:08,254 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1503 transitions. Word has length 56 [2019-11-24 01:32:08,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:32:08,255 INFO L462 AbstractCegarLoop]: Abstraction has 1009 states and 1503 transitions. [2019-11-24 01:32:08,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:32:08,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1503 transitions. [2019-11-24 01:32:08,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-24 01:32:08,267 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:32:08,267 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-24 01:32:08,268 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:32:08,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:32:08,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1682049833, now seen corresponding path program 1 times [2019-11-24 01:32:08,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:32:08,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657424879] [2019-11-24 01:32:08,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:32:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:32:08,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 01:32:08,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657424879] [2019-11-24 01:32:08,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:32:08,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 01:32:08,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492943129] [2019-11-24 01:32:08,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:32:08,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:32:08,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:32:08,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:32:08,551 INFO L87 Difference]: Start difference. First operand 1009 states and 1503 transitions. Second operand 3 states. [2019-11-24 01:32:08,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:32:08,737 INFO L93 Difference]: Finished difference Result 1945 states and 2905 transitions. [2019-11-24 01:32:08,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:32:08,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-24 01:32:08,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:32:08,746 INFO L225 Difference]: With dead ends: 1945 [2019-11-24 01:32:08,746 INFO L226 Difference]: Without dead ends: 1452 [2019-11-24 01:32:08,748 INFO L630 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-11-24 01:32:08,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2019-11-24 01:32:08,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 1428. [2019-11-24 01:32:08,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-11-24 01:32:08,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 2161 transitions. [2019-11-24 01:32:08,795 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 2161 transitions. Word has length 72 [2019-11-24 01:32:08,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:32:08,796 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 2161 transitions. [2019-11-24 01:32:08,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:32:08,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 2161 transitions. [2019-11-24 01:32:08,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-24 01:32:08,797 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:32:08,798 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 01:32:08,798 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:32:08,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:32:08,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1864287373, now seen corresponding path program 1 times [2019-11-24 01:32:08,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:32:08,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479513267] [2019-11-24 01:32:08,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:32:08,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:32:08,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 01:32:08,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479513267] [2019-11-24 01:32:08,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:32:08,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 01:32:08,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191482421] [2019-11-24 01:32:08,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:32:08,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:32:08,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:32:08,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:32:08,939 INFO L87 Difference]: Start difference. First operand 1428 states and 2161 transitions. Second operand 3 states. [2019-11-24 01:32:09,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:32:09,202 INFO L93 Difference]: Finished difference Result 3529 states and 5393 transitions. [2019-11-24 01:32:09,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:32:09,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-24 01:32:09,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:32:09,216 INFO L225 Difference]: With dead ends: 3529 [2019-11-24 01:32:09,216 INFO L226 Difference]: Without dead ends: 2198 [2019-11-24 01:32:09,219 INFO L630 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-11-24 01:32:09,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2198 states. [2019-11-24 01:32:09,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2198 to 2138. [2019-11-24 01:32:09,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2138 states. [2019-11-24 01:32:10,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 2138 states and 3276 transitions. [2019-11-24 01:32:10,205 INFO L78 Accepts]: Start accepts. Automaton has 2138 states and 3276 transitions. Word has length 73 [2019-11-24 01:32:10,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:32:10,205 INFO L462 AbstractCegarLoop]: Abstraction has 2138 states and 3276 transitions. [2019-11-24 01:32:10,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:32:10,205 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 3276 transitions. [2019-11-24 01:32:10,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-24 01:32:10,207 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:32:10,207 INFO L410 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] [2019-11-24 01:32:10,207 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:32:10,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:32:10,209 INFO L82 PathProgramCache]: Analyzing trace with hash 2091153187, now seen corresponding path program 1 times [2019-11-24 01:32:10,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:32:10,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427496089] [2019-11-24 01:32:10,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:32:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:32:10,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 01:32:10,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427496089] [2019-11-24 01:32:10,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:32:10,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 01:32:10,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438813910] [2019-11-24 01:32:10,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:32:10,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:32:10,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:32:10,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:32:10,413 INFO L87 Difference]: Start difference. First operand 2138 states and 3276 transitions. Second operand 3 states. [2019-11-24 01:32:10,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:32:10,697 INFO L93 Difference]: Finished difference Result 5648 states and 8740 transitions. [2019-11-24 01:32:10,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:32:10,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-11-24 01:32:10,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:32:10,716 INFO L225 Difference]: With dead ends: 5648 [2019-11-24 01:32:10,716 INFO L226 Difference]: Without dead ends: 3607 [2019-11-24 01:32:10,720 INFO L630 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-11-24 01:32:10,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3607 states. [2019-11-24 01:32:10,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3607 to 3547. [2019-11-24 01:32:10,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3547 states. [2019-11-24 01:32:10,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3547 states to 3547 states and 5488 transitions. [2019-11-24 01:32:10,836 INFO L78 Accepts]: Start accepts. Automaton has 3547 states and 5488 transitions. Word has length 75 [2019-11-24 01:32:10,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:32:10,837 INFO L462 AbstractCegarLoop]: Abstraction has 3547 states and 5488 transitions. [2019-11-24 01:32:10,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:32:10,837 INFO L276 IsEmpty]: Start isEmpty. Operand 3547 states and 5488 transitions. [2019-11-24 01:32:10,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-24 01:32:10,839 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:32:10,839 INFO L410 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] [2019-11-24 01:32:10,839 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:32:10,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:32:10,840 INFO L82 PathProgramCache]: Analyzing trace with hash -56965421, now seen corresponding path program 1 times [2019-11-24 01:32:10,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:32:10,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675711491] [2019-11-24 01:32:10,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:32:10,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:32:10,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 01:32:10,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675711491] [2019-11-24 01:32:10,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:32:10,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 01:32:10,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177902149] [2019-11-24 01:32:10,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:32:10,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:32:10,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:32:10,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:32:10,976 INFO L87 Difference]: Start difference. First operand 3547 states and 5488 transitions. Second operand 3 states. [2019-11-24 01:32:11,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:32:11,429 INFO L93 Difference]: Finished difference Result 8162 states and 12641 transitions. [2019-11-24 01:32:11,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:32:11,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-11-24 01:32:11,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:32:11,461 INFO L225 Difference]: With dead ends: 8162 [2019-11-24 01:32:11,462 INFO L226 Difference]: Without dead ends: 4712 [2019-11-24 01:32:11,470 INFO L630 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-11-24 01:32:11,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4712 states. [2019-11-24 01:32:11,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4712 to 4664. [2019-11-24 01:32:11,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4664 states. [2019-11-24 01:32:11,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4664 states to 4664 states and 7143 transitions. [2019-11-24 01:32:11,652 INFO L78 Accepts]: Start accepts. Automaton has 4664 states and 7143 transitions. Word has length 75 [2019-11-24 01:32:11,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:32:11,653 INFO L462 AbstractCegarLoop]: Abstraction has 4664 states and 7143 transitions. [2019-11-24 01:32:11,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:32:11,654 INFO L276 IsEmpty]: Start isEmpty. Operand 4664 states and 7143 transitions. [2019-11-24 01:32:11,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-24 01:32:11,655 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:32:11,655 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-24 01:32:11,655 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:32:11,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:32:11,656 INFO L82 PathProgramCache]: Analyzing trace with hash 893677446, now seen corresponding path program 1 times [2019-11-24 01:32:11,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:32:11,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018300955] [2019-11-24 01:32:11,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:32:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:32:11,913 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-24 01:32:11,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018300955] [2019-11-24 01:32:11,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:32:11,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 01:32:11,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214920295] [2019-11-24 01:32:11,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 01:32:11,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:32:11,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 01:32:11,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:32:11,916 INFO L87 Difference]: Start difference. First operand 4664 states and 7143 transitions. Second operand 4 states. [2019-11-24 01:32:12,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:32:12,351 INFO L93 Difference]: Finished difference Result 4664 states and 7143 transitions. [2019-11-24 01:32:12,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 01:32:12,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-24 01:32:12,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:32:12,387 INFO L225 Difference]: With dead ends: 4664 [2019-11-24 01:32:12,387 INFO L226 Difference]: Without dead ends: 4658 [2019-11-24 01:32:12,389 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 01:32:12,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4658 states. [2019-11-24 01:32:12,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4658 to 4658. [2019-11-24 01:32:12,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4658 states. [2019-11-24 01:32:12,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4658 states to 4658 states and 7137 transitions. [2019-11-24 01:32:12,584 INFO L78 Accepts]: Start accepts. Automaton has 4658 states and 7137 transitions. Word has length 78 [2019-11-24 01:32:12,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:32:12,585 INFO L462 AbstractCegarLoop]: Abstraction has 4658 states and 7137 transitions. [2019-11-24 01:32:12,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 01:32:12,585 INFO L276 IsEmpty]: Start isEmpty. Operand 4658 states and 7137 transitions. [2019-11-24 01:32:12,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-24 01:32:12,591 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:32:12,591 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-24 01:32:12,591 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:32:12,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:32:12,592 INFO L82 PathProgramCache]: Analyzing trace with hash -169277847, now seen corresponding path program 1 times [2019-11-24 01:32:12,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:32:12,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744115120] [2019-11-24 01:32:12,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:32:12,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:32:12,826 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-24 01:32:12,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744115120] [2019-11-24 01:32:12,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:32:12,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 01:32:12,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182114108] [2019-11-24 01:32:12,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 01:32:12,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:32:12,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 01:32:12,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:32:12,829 INFO L87 Difference]: Start difference. First operand 4658 states and 7137 transitions. Second operand 4 states. [2019-11-24 01:32:13,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:32:13,017 INFO L93 Difference]: Finished difference Result 4658 states and 7137 transitions. [2019-11-24 01:32:13,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 01:32:13,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-24 01:32:13,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:32:13,044 INFO L225 Difference]: With dead ends: 4658 [2019-11-24 01:32:13,044 INFO L226 Difference]: Without dead ends: 4652 [2019-11-24 01:32:13,047 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 01:32:13,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4652 states. [2019-11-24 01:32:13,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4652 to 4652. [2019-11-24 01:32:13,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4652 states. [2019-11-24 01:32:13,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4652 states to 4652 states and 7131 transitions. [2019-11-24 01:32:13,258 INFO L78 Accepts]: Start accepts. Automaton has 4652 states and 7131 transitions. Word has length 80 [2019-11-24 01:32:13,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:32:13,258 INFO L462 AbstractCegarLoop]: Abstraction has 4652 states and 7131 transitions. [2019-11-24 01:32:13,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 01:32:13,259 INFO L276 IsEmpty]: Start isEmpty. Operand 4652 states and 7131 transitions. [2019-11-24 01:32:13,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-24 01:32:13,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:32:13,260 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-24 01:32:13,260 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:32:13,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:32:13,261 INFO L82 PathProgramCache]: Analyzing trace with hash 532902348, now seen corresponding path program 1 times [2019-11-24 01:32:13,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:32:13,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444405971] [2019-11-24 01:32:13,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:32:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:32:13,451 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-24 01:32:13,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444405971] [2019-11-24 01:32:13,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:32:13,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 01:32:13,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854534973] [2019-11-24 01:32:13,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 01:32:13,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:32:13,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 01:32:13,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:32:13,454 INFO L87 Difference]: Start difference. First operand 4652 states and 7131 transitions. Second operand 4 states. [2019-11-24 01:32:13,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:32:13,707 INFO L93 Difference]: Finished difference Result 4652 states and 7131 transitions. [2019-11-24 01:32:13,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 01:32:13,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-11-24 01:32:13,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:32:13,744 INFO L225 Difference]: With dead ends: 4652 [2019-11-24 01:32:13,744 INFO L226 Difference]: Without dead ends: 4626 [2019-11-24 01:32:13,745 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 01:32:13,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4626 states. [2019-11-24 01:32:13,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4626 to 4626. [2019-11-24 01:32:13,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4626 states. [2019-11-24 01:32:13,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4626 states to 4626 states and 7076 transitions. [2019-11-24 01:32:13,977 INFO L78 Accepts]: Start accepts. Automaton has 4626 states and 7076 transitions. Word has length 82 [2019-11-24 01:32:13,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:32:13,978 INFO L462 AbstractCegarLoop]: Abstraction has 4626 states and 7076 transitions. [2019-11-24 01:32:13,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 01:32:13,978 INFO L276 IsEmpty]: Start isEmpty. Operand 4626 states and 7076 transitions. [2019-11-24 01:32:13,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-24 01:32:13,983 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:32:13,983 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-24 01:32:13,984 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:32:13,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:32:13,985 INFO L82 PathProgramCache]: Analyzing trace with hash -2101431629, now seen corresponding path program 1 times [2019-11-24 01:32:13,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:32:13,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11301702] [2019-11-24 01:32:13,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:32:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:32:14,216 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-24 01:32:14,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11301702] [2019-11-24 01:32:14,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:32:14,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 01:32:14,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594928017] [2019-11-24 01:32:14,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:32:14,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:32:14,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:32:14,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:32:14,224 INFO L87 Difference]: Start difference. First operand 4626 states and 7076 transitions. Second operand 3 states. [2019-11-24 01:32:14,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:32:14,622 INFO L93 Difference]: Finished difference Result 11058 states and 17026 transitions. [2019-11-24 01:32:14,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:32:14,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-11-24 01:32:14,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:32:14,640 INFO L225 Difference]: With dead ends: 11058 [2019-11-24 01:32:14,640 INFO L226 Difference]: Without dead ends: 6648 [2019-11-24 01:32:14,649 INFO L630 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-11-24 01:32:14,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6648 states. [2019-11-24 01:32:14,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6648 to 6626. [2019-11-24 01:32:14,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6626 states. [2019-11-24 01:32:14,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6626 states to 6626 states and 10160 transitions. [2019-11-24 01:32:14,959 INFO L78 Accepts]: Start accepts. Automaton has 6626 states and 10160 transitions. Word has length 108 [2019-11-24 01:32:14,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:32:14,960 INFO L462 AbstractCegarLoop]: Abstraction has 6626 states and 10160 transitions. [2019-11-24 01:32:14,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:32:14,962 INFO L276 IsEmpty]: Start isEmpty. Operand 6626 states and 10160 transitions. [2019-11-24 01:32:14,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-24 01:32:14,967 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:32:14,967 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-24 01:32:14,968 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:32:14,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:32:14,970 INFO L82 PathProgramCache]: Analyzing trace with hash 671183817, now seen corresponding path program 1 times [2019-11-24 01:32:14,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:32:14,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130521316] [2019-11-24 01:32:14,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:32:15,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:32:15,222 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-24 01:32:15,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130521316] [2019-11-24 01:32:15,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:32:15,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 01:32:15,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144319107] [2019-11-24 01:32:15,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:32:15,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:32:15,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:32:15,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:32:15,225 INFO L87 Difference]: Start difference. First operand 6626 states and 10160 transitions. Second operand 3 states. [2019-11-24 01:32:15,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:32:15,774 INFO L93 Difference]: Finished difference Result 16004 states and 24688 transitions. [2019-11-24 01:32:15,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:32:15,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-11-24 01:32:15,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:32:15,800 INFO L225 Difference]: With dead ends: 16004 [2019-11-24 01:32:15,800 INFO L226 Difference]: Without dead ends: 9594 [2019-11-24 01:32:15,812 INFO L630 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-11-24 01:32:15,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9594 states. [2019-11-24 01:32:16,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9594 to 9572. [2019-11-24 01:32:16,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9572 states. [2019-11-24 01:32:16,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9572 states to 9572 states and 14702 transitions. [2019-11-24 01:32:16,184 INFO L78 Accepts]: Start accepts. Automaton has 9572 states and 14702 transitions. Word has length 110 [2019-11-24 01:32:16,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:32:16,185 INFO L462 AbstractCegarLoop]: Abstraction has 9572 states and 14702 transitions. [2019-11-24 01:32:16,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:32:16,185 INFO L276 IsEmpty]: Start isEmpty. Operand 9572 states and 14702 transitions. [2019-11-24 01:32:16,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-24 01:32:16,188 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:32:16,188 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-24 01:32:16,189 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:32:16,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:32:16,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1476934791, now seen corresponding path program 1 times [2019-11-24 01:32:16,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:32:16,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488678986] [2019-11-24 01:32:16,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:32:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:32:16,326 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-24 01:32:16,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488678986] [2019-11-24 01:32:16,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:32:16,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 01:32:16,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845190138] [2019-11-24 01:32:16,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:32:16,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:32:16,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:32:16,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:32:16,330 INFO L87 Difference]: Start difference. First operand 9572 states and 14702 transitions. Second operand 3 states. [2019-11-24 01:32:17,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:32:17,153 INFO L93 Difference]: Finished difference Result 21650 states and 33316 transitions. [2019-11-24 01:32:17,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 01:32:17,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-11-24 01:32:17,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:32:17,188 INFO L225 Difference]: With dead ends: 21650 [2019-11-24 01:32:17,189 INFO L226 Difference]: Without dead ends: 12294 [2019-11-24 01:32:17,206 INFO L630 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-11-24 01:32:17,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12294 states. [2019-11-24 01:32:17,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12294 to 12284. [2019-11-24 01:32:17,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12284 states. [2019-11-24 01:32:17,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12284 states to 12284 states and 18740 transitions. [2019-11-24 01:32:17,735 INFO L78 Accepts]: Start accepts. Automaton has 12284 states and 18740 transitions. Word has length 110 [2019-11-24 01:32:17,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:32:17,735 INFO L462 AbstractCegarLoop]: Abstraction has 12284 states and 18740 transitions. [2019-11-24 01:32:17,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 01:32:17,736 INFO L276 IsEmpty]: Start isEmpty. Operand 12284 states and 18740 transitions. [2019-11-24 01:32:17,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-24 01:32:17,742 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:32:17,742 INFO L410 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-24 01:32:17,743 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:32:17,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:32:17,743 INFO L82 PathProgramCache]: Analyzing trace with hash -495503474, now seen corresponding path program 1 times [2019-11-24 01:32:17,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:32:17,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450794246] [2019-11-24 01:32:17,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:32:17,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:32:17,941 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-24 01:32:17,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450794246] [2019-11-24 01:32:17,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:32:17,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 01:32:17,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190165087] [2019-11-24 01:32:17,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 01:32:17,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:32:17,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 01:32:17,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:32:17,944 INFO L87 Difference]: Start difference. First operand 12284 states and 18740 transitions. Second operand 4 states. [2019-11-24 01:32:18,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:32:18,902 INFO L93 Difference]: Finished difference Result 28082 states and 43018 transitions. [2019-11-24 01:32:18,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 01:32:18,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-11-24 01:32:18,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:32:18,944 INFO L225 Difference]: With dead ends: 28082 [2019-11-24 01:32:18,944 INFO L226 Difference]: Without dead ends: 16014 [2019-11-24 01:32:18,966 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:32:18,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16014 states. [2019-11-24 01:32:19,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16014 to 15992. [2019-11-24 01:32:19,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15992 states. [2019-11-24 01:32:19,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15992 states to 15992 states and 24434 transitions. [2019-11-24 01:32:19,707 INFO L78 Accepts]: Start accepts. Automaton has 15992 states and 24434 transitions. Word has length 124 [2019-11-24 01:32:19,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:32:19,707 INFO L462 AbstractCegarLoop]: Abstraction has 15992 states and 24434 transitions. [2019-11-24 01:32:19,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 01:32:19,707 INFO L276 IsEmpty]: Start isEmpty. Operand 15992 states and 24434 transitions. [2019-11-24 01:32:19,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-24 01:32:19,713 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:32:19,713 INFO L410 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-24 01:32:19,714 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:32:19,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:32:19,714 INFO L82 PathProgramCache]: Analyzing trace with hash -441563998, now seen corresponding path program 1 times [2019-11-24 01:32:19,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:32:19,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727054846] [2019-11-24 01:32:19,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:32:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:32:19,872 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-24 01:32:19,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727054846] [2019-11-24 01:32:19,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:32:19,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 01:32:19,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649350302] [2019-11-24 01:32:19,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 01:32:19,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:32:19,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 01:32:19,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:32:19,875 INFO L87 Difference]: Start difference. First operand 15992 states and 24434 transitions. Second operand 4 states. [2019-11-24 01:32:20,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:32:20,838 INFO L93 Difference]: Finished difference Result 35268 states and 53982 transitions. [2019-11-24 01:32:20,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 01:32:20,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-11-24 01:32:20,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:32:20,878 INFO L225 Difference]: With dead ends: 35268 [2019-11-24 01:32:20,878 INFO L226 Difference]: Without dead ends: 19492 [2019-11-24 01:32:20,906 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:32:20,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19492 states. [2019-11-24 01:32:22,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19492 to 19482. [2019-11-24 01:32:22,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19482 states. [2019-11-24 01:32:22,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19482 states to 19482 states and 29668 transitions. [2019-11-24 01:32:22,739 INFO L78 Accepts]: Start accepts. Automaton has 19482 states and 29668 transitions. Word has length 127 [2019-11-24 01:32:22,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:32:22,739 INFO L462 AbstractCegarLoop]: Abstraction has 19482 states and 29668 transitions. [2019-11-24 01:32:22,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 01:32:22,739 INFO L276 IsEmpty]: Start isEmpty. Operand 19482 states and 29668 transitions. [2019-11-24 01:32:22,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-11-24 01:32:22,745 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:32:22,745 INFO L410 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-24 01:32:22,746 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:32:22,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:32:22,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1649381642, now seen corresponding path program 1 times [2019-11-24 01:32:22,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:32:22,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523632328] [2019-11-24 01:32:22,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:32:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:32:22,899 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-24 01:32:22,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523632328] [2019-11-24 01:32:22,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:32:22,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 01:32:22,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387296534] [2019-11-24 01:32:22,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 01:32:22,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:32:22,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 01:32:22,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:32:22,902 INFO L87 Difference]: Start difference. First operand 19482 states and 29668 transitions. Second operand 4 states. [2019-11-24 01:32:23,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:32:23,972 INFO L93 Difference]: Finished difference Result 44714 states and 68382 transitions. [2019-11-24 01:32:23,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 01:32:23,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-11-24 01:32:23,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:32:24,024 INFO L225 Difference]: With dead ends: 44714 [2019-11-24 01:32:24,025 INFO L226 Difference]: Without dead ends: 25448 [2019-11-24 01:32:24,053 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:32:24,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25448 states. [2019-11-24 01:32:25,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25448 to 25426. [2019-11-24 01:32:25,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25426 states. [2019-11-24 01:32:25,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25426 states to 25426 states and 38772 transitions. [2019-11-24 01:32:25,414 INFO L78 Accepts]: Start accepts. Automaton has 25426 states and 38772 transitions. Word has length 128 [2019-11-24 01:32:25,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:32:25,414 INFO L462 AbstractCegarLoop]: Abstraction has 25426 states and 38772 transitions. [2019-11-24 01:32:25,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 01:32:25,415 INFO L276 IsEmpty]: Start isEmpty. Operand 25426 states and 38772 transitions. [2019-11-24 01:32:25,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-24 01:32:25,423 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:32:25,423 INFO L410 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-24 01:32:25,425 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:32:25,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:32:25,426 INFO L82 PathProgramCache]: Analyzing trace with hash 369610494, now seen corresponding path program 1 times [2019-11-24 01:32:25,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:32:25,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135519019] [2019-11-24 01:32:25,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:32:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:32:25,588 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-11-24 01:32:25,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135519019] [2019-11-24 01:32:25,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:32:25,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 01:32:25,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602741066] [2019-11-24 01:32:25,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 01:32:25,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:32:25,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 01:32:25,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:32:25,590 INFO L87 Difference]: Start difference. First operand 25426 states and 38772 transitions. Second operand 4 states. [2019-11-24 01:32:26,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:32:26,567 INFO L93 Difference]: Finished difference Result 56514 states and 86438 transitions. [2019-11-24 01:32:26,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 01:32:26,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-11-24 01:32:26,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:32:26,613 INFO L225 Difference]: With dead ends: 56514 [2019-11-24 01:32:26,614 INFO L226 Difference]: Without dead ends: 31304 [2019-11-24 01:32:26,647 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:32:26,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31304 states. [2019-11-24 01:32:28,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31304 to 31282. [2019-11-24 01:32:28,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31282 states. [2019-11-24 01:32:28,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31282 states to 31282 states and 47756 transitions. [2019-11-24 01:32:28,699 INFO L78 Accepts]: Start accepts. Automaton has 31282 states and 47756 transitions. Word has length 136 [2019-11-24 01:32:28,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:32:28,699 INFO L462 AbstractCegarLoop]: Abstraction has 31282 states and 47756 transitions. [2019-11-24 01:32:28,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 01:32:28,699 INFO L276 IsEmpty]: Start isEmpty. Operand 31282 states and 47756 transitions. [2019-11-24 01:32:28,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-24 01:32:28,708 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:32:28,708 INFO L410 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-24 01:32:28,709 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:32:28,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:32:28,709 INFO L82 PathProgramCache]: Analyzing trace with hash -670988191, now seen corresponding path program 1 times [2019-11-24 01:32:28,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:32:28,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184850150] [2019-11-24 01:32:28,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:32:28,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:32:28,861 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-24 01:32:28,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184850150] [2019-11-24 01:32:28,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:32:28,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 01:32:28,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858547459] [2019-11-24 01:32:28,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 01:32:28,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:32:28,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 01:32:28,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:32:28,865 INFO L87 Difference]: Start difference. First operand 31282 states and 47756 transitions. Second operand 4 states. [2019-11-24 01:32:30,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:32:30,490 INFO L93 Difference]: Finished difference Result 67878 states and 103776 transitions. [2019-11-24 01:32:30,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 01:32:30,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-11-24 01:32:30,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:32:30,537 INFO L225 Difference]: With dead ends: 67878 [2019-11-24 01:32:30,537 INFO L226 Difference]: Without dead ends: 36812 [2019-11-24 01:32:30,573 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:32:30,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36812 states. [2019-11-24 01:32:31,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36812 to 36802. [2019-11-24 01:32:31,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36802 states. [2019-11-24 01:32:31,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36802 states to 36802 states and 56068 transitions. [2019-11-24 01:32:31,925 INFO L78 Accepts]: Start accepts. Automaton has 36802 states and 56068 transitions. Word has length 140 [2019-11-24 01:32:31,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:32:31,925 INFO L462 AbstractCegarLoop]: Abstraction has 36802 states and 56068 transitions. [2019-11-24 01:32:31,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 01:32:31,926 INFO L276 IsEmpty]: Start isEmpty. Operand 36802 states and 56068 transitions. [2019-11-24 01:32:31,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-24 01:32:31,934 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:32:31,935 INFO L410 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-24 01:32:31,935 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:32:31,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:32:31,935 INFO L82 PathProgramCache]: Analyzing trace with hash 818838644, now seen corresponding path program 1 times [2019-11-24 01:32:31,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:32:31,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914782585] [2019-11-24 01:32:31,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:32:32,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:32:32,125 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-11-24 01:32:32,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914782585] [2019-11-24 01:32:32,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:32:32,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 01:32:32,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306707782] [2019-11-24 01:32:32,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 01:32:32,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:32:32,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 01:32:32,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:32:32,128 INFO L87 Difference]: Start difference. First operand 36802 states and 56068 transitions. Second operand 4 states. [2019-11-24 01:32:35,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:32:35,546 INFO L93 Difference]: Finished difference Result 81950 states and 125244 transitions. [2019-11-24 01:32:35,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 01:32:35,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-11-24 01:32:35,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:32:35,600 INFO L225 Difference]: With dead ends: 81950 [2019-11-24 01:32:35,600 INFO L226 Difference]: Without dead ends: 45364 [2019-11-24 01:32:35,632 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:32:35,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45364 states. [2019-11-24 01:32:37,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45364 to 45342. [2019-11-24 01:32:37,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45342 states. [2019-11-24 01:32:37,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45342 states to 45342 states and 69158 transitions. [2019-11-24 01:32:37,098 INFO L78 Accepts]: Start accepts. Automaton has 45342 states and 69158 transitions. Word has length 142 [2019-11-24 01:32:37,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:32:37,098 INFO L462 AbstractCegarLoop]: Abstraction has 45342 states and 69158 transitions. [2019-11-24 01:32:37,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 01:32:37,098 INFO L276 IsEmpty]: Start isEmpty. Operand 45342 states and 69158 transitions. [2019-11-24 01:32:37,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-24 01:32:37,108 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:32:37,108 INFO L410 BasicCegarLoop]: trace histogram [7, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-24 01:32:37,108 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:32:37,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:32:37,109 INFO L82 PathProgramCache]: Analyzing trace with hash -99639944, now seen corresponding path program 1 times [2019-11-24 01:32:37,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:32:37,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168696572] [2019-11-24 01:32:37,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:32:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:32:37,294 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-11-24 01:32:37,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168696572] [2019-11-24 01:32:37,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:32:37,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 01:32:37,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219727088] [2019-11-24 01:32:37,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 01:32:37,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:32:37,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 01:32:37,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:32:37,300 INFO L87 Difference]: Start difference. First operand 45342 states and 69158 transitions. Second operand 4 states. [2019-11-24 01:32:42,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:32:42,362 INFO L93 Difference]: Finished difference Result 150830 states and 230424 transitions. [2019-11-24 01:32:42,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 01:32:42,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-11-24 01:32:42,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:32:42,510 INFO L225 Difference]: With dead ends: 150830 [2019-11-24 01:32:42,510 INFO L226 Difference]: Without dead ends: 105704 [2019-11-24 01:32:42,550 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 01:32:42,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105704 states. [2019-11-24 01:32:44,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105704 to 53662. [2019-11-24 01:32:44,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53662 states. [2019-11-24 01:32:44,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53662 states to 53662 states and 81938 transitions. [2019-11-24 01:32:44,844 INFO L78 Accepts]: Start accepts. Automaton has 53662 states and 81938 transitions. Word has length 149 [2019-11-24 01:32:44,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:32:44,844 INFO L462 AbstractCegarLoop]: Abstraction has 53662 states and 81938 transitions. [2019-11-24 01:32:44,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 01:32:44,844 INFO L276 IsEmpty]: Start isEmpty. Operand 53662 states and 81938 transitions. [2019-11-24 01:32:44,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-24 01:32:44,856 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:32:44,856 INFO L410 BasicCegarLoop]: trace histogram [7, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-24 01:32:44,856 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:32:44,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:32:44,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1544763808, now seen corresponding path program 1 times [2019-11-24 01:32:44,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:32:44,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739297866] [2019-11-24 01:32:44,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:32:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:32:45,215 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-11-24 01:32:45,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739297866] [2019-11-24 01:32:45,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:32:45,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 01:32:45,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434494983] [2019-11-24 01:32:45,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 01:32:45,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:32:45,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 01:32:45,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 01:32:45,219 INFO L87 Difference]: Start difference. First operand 53662 states and 81938 transitions. Second operand 4 states. [2019-11-24 01:32:49,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 01:32:49,328 INFO L93 Difference]: Finished difference Result 103524 states and 158590 transitions. [2019-11-24 01:32:49,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 01:32:49,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-24 01:32:49,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 01:32:49,468 INFO L225 Difference]: With dead ends: 103524 [2019-11-24 01:32:49,468 INFO L226 Difference]: Without dead ends: 103512 [2019-11-24 01:32:49,496 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 01:32:49,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103512 states. [2019-11-24 01:32:53,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103512 to 53650. [2019-11-24 01:32:53,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53650 states. [2019-11-24 01:32:53,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53650 states to 53650 states and 81582 transitions. [2019-11-24 01:32:53,962 INFO L78 Accepts]: Start accepts. Automaton has 53650 states and 81582 transitions. Word has length 150 [2019-11-24 01:32:53,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 01:32:53,962 INFO L462 AbstractCegarLoop]: Abstraction has 53650 states and 81582 transitions. [2019-11-24 01:32:53,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 01:32:53,963 INFO L276 IsEmpty]: Start isEmpty. Operand 53650 states and 81582 transitions. [2019-11-24 01:32:53,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-24 01:32:53,972 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 01:32:53,972 INFO L410 BasicCegarLoop]: trace histogram [7, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-24 01:32:53,973 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 01:32:53,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 01:32:53,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1536219617, now seen corresponding path program 1 times [2019-11-24 01:32:53,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 01:32:53,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214925266] [2019-11-24 01:32:53,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 01:32:54,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 01:32:54,163 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-11-24 01:32:54,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214925266] [2019-11-24 01:32:54,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 01:32:54,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 01:32:54,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666487072] [2019-11-24 01:32:54,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 01:32:54,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 01:32:54,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 01:32:54,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 01:32:54,165 INFO L87 Difference]: Start difference. First operand 53650 states and 81582 transitions. Second operand 3 states.