/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-validator-v0.8/linux-stable-4ee267b-1-130_7a-drivers--hwmon--ibmaem.ko-entry_point_ldv-val-v0.8.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:01:25,642 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:01:25,645 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:01:25,656 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:01:25,657 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:01:25,658 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:01:25,659 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:01:25,661 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:01:25,663 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:01:25,663 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:01:25,664 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:01:25,666 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:01:25,666 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:01:25,667 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:01:25,668 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:01:25,669 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:01:25,670 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:01:25,671 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:01:25,672 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:01:25,674 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:01:25,676 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:01:25,677 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:01:25,678 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:01:25,679 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:01:25,681 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:01:25,681 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:01:25,681 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:01:25,682 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:01:25,682 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:01:25,683 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:01:25,683 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:01:25,684 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:01:25,685 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:01:25,686 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:01:25,687 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:01:25,687 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:01:25,687 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:01:25,688 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:01:25,688 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:01:25,689 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:01:25,689 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:01:25,690 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 04:01:25,705 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:01:25,705 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:01:25,706 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:01:25,706 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:01:25,706 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:01:25,707 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:01:25,707 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:01:25,707 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:01:25,707 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:01:25,707 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:01:25,708 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:01:25,708 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:01:25,708 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:01:25,708 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:01:25,708 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:01:25,709 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:01:25,709 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:01:25,709 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:01:25,710 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:01:25,710 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:01:25,710 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:01:25,710 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:01:25,710 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:01:25,711 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:01:25,711 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:01:25,711 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:01:25,711 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:01:25,711 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:01:25,712 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:01:25,712 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:01:25,712 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:01:25,712 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:01:25,712 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:01:25,713 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:01:25,713 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:01:25,713 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:01:25,713 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:01:25,713 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:01:26,007 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:01:26,026 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:01:26,030 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:01:26,031 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:01:26,032 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:01:26,032 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-validator-v0.8/linux-stable-4ee267b-1-130_7a-drivers--hwmon--ibmaem.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-11-24 04:01:26,103 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c58a28038/113ce878a330491f98f262e7999ec3d5/FLAG974f6cd68 [2019-11-24 04:01:26,841 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:01:26,843 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-validator-v0.8/linux-stable-4ee267b-1-130_7a-drivers--hwmon--ibmaem.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-11-24 04:01:26,871 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c58a28038/113ce878a330491f98f262e7999ec3d5/FLAG974f6cd68 [2019-11-24 04:01:26,893 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c58a28038/113ce878a330491f98f262e7999ec3d5 [2019-11-24 04:01:26,902 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:01:26,903 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:01:26,904 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:01:26,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:01:26,908 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:01:26,909 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:01:26" (1/1) ... [2019-11-24 04:01:26,911 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68c49f35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:01:26, skipping insertion in model container [2019-11-24 04:01:26,912 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:01:26" (1/1) ... [2019-11-24 04:01:26,919 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:01:27,022 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:01:28,337 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:01:28,382 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:01:28,604 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:01:28,821 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:01:28,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:01:28 WrapperNode [2019-11-24 04:01:28,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:01:28,822 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:01:28,823 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:01:28,823 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:01:28,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:01:28" (1/1) ... [2019-11-24 04:01:28,918 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:01:28" (1/1) ... [2019-11-24 04:01:29,077 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:01:29,078 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:01:29,078 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:01:29,078 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:01:29,089 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:01:28" (1/1) ... [2019-11-24 04:01:29,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:01:28" (1/1) ... [2019-11-24 04:01:29,120 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:01:28" (1/1) ... [2019-11-24 04:01:29,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:01:28" (1/1) ... [2019-11-24 04:01:29,231 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:01:28" (1/1) ... [2019-11-24 04:01:29,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:01:28" (1/1) ... [2019-11-24 04:01:29,282 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:01:28" (1/1) ... [2019-11-24 04:01:29,307 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:01:29,308 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:01:29,308 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:01:29,308 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:01:29,309 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:01:28" (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 04:01:29,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-11-24 04:01:29,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-24 04:01:29,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-24 04:01:29,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-24 04:01:29,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-24 04:01:29,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-24 04:01:29,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-24 04:01:29,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-24 04:01:29,425 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2019-11-24 04:01:29,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-24 04:01:29,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-24 04:01:29,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-24 04:01:29,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-24 04:01:29,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-11-24 04:01:29,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:01:29,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:01:44,204 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:01:44,204 INFO L284 CfgBuilder]: Removed 500 assume(true) statements. [2019-11-24 04:01:44,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:01:44 BoogieIcfgContainer [2019-11-24 04:01:44,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:01:44,207 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:01:44,207 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:01:44,209 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:01:44,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:01:26" (1/3) ... [2019-11-24 04:01:44,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d1115c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:01:44, skipping insertion in model container [2019-11-24 04:01:44,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:01:28" (2/3) ... [2019-11-24 04:01:44,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d1115c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:01:44, skipping insertion in model container [2019-11-24 04:01:44,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:01:44" (3/3) ... [2019-11-24 04:01:44,214 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-stable-4ee267b-1-130_7a-drivers--hwmon--ibmaem.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-11-24 04:01:44,222 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:01:44,230 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-11-24 04:01:44,238 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-11-24 04:01:44,266 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:01:44,266 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:01:44,266 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:01:44,266 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:01:44,267 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:01:44,267 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:01:44,267 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:01:44,267 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:01:44,289 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states. [2019-11-24 04:01:44,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-24 04:01:44,298 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:01:44,300 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] [2019-11-24 04:01:44,300 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:01:44,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:01:44,307 INFO L82 PathProgramCache]: Analyzing trace with hash 145472981, now seen corresponding path program 1 times [2019-11-24 04:01:44,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:01:44,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789203925] [2019-11-24 04:01:44,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:01:44,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:01:44,980 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 04:01:44,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789203925] [2019-11-24 04:01:44,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:01:44,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:01:44,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452845287] [2019-11-24 04:01:44,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:01:44,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:01:45,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:01:45,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:01:45,007 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 3 states. [2019-11-24 04:01:45,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:01:45,266 INFO L93 Difference]: Finished difference Result 399 states and 629 transitions. [2019-11-24 04:01:45,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:01:45,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-24 04:01:45,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:01:45,295 INFO L225 Difference]: With dead ends: 399 [2019-11-24 04:01:45,295 INFO L226 Difference]: Without dead ends: 194 [2019-11-24 04:01:45,303 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 04:01:45,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-11-24 04:01:45,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2019-11-24 04:01:45,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-24 04:01:45,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 293 transitions. [2019-11-24 04:01:45,387 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 293 transitions. Word has length 39 [2019-11-24 04:01:45,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:01:45,388 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 293 transitions. [2019-11-24 04:01:45,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:01:45,388 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 293 transitions. [2019-11-24 04:01:45,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-24 04:01:45,396 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:01:45,396 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] [2019-11-24 04:01:45,397 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:01:45,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:01:45,397 INFO L82 PathProgramCache]: Analyzing trace with hash 437906644, now seen corresponding path program 1 times [2019-11-24 04:01:45,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:01:45,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637069356] [2019-11-24 04:01:45,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:01:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:01:45,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-24 04:01:45,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637069356] [2019-11-24 04:01:45,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:01:45,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:01:45,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879774743] [2019-11-24 04:01:45,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:01:45,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:01:45,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:01:45,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:01:45,725 INFO L87 Difference]: Start difference. First operand 194 states and 293 transitions. Second operand 3 states. [2019-11-24 04:01:45,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:01:45,747 INFO L93 Difference]: Finished difference Result 377 states and 565 transitions. [2019-11-24 04:01:45,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:01:45,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-11-24 04:01:45,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:01:45,750 INFO L225 Difference]: With dead ends: 377 [2019-11-24 04:01:45,750 INFO L226 Difference]: Without dead ends: 195 [2019-11-24 04:01:45,753 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 04:01:45,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-11-24 04:01:45,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2019-11-24 04:01:45,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-11-24 04:01:45,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 294 transitions. [2019-11-24 04:01:45,780 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 294 transitions. Word has length 47 [2019-11-24 04:01:45,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:01:45,780 INFO L462 AbstractCegarLoop]: Abstraction has 195 states and 294 transitions. [2019-11-24 04:01:45,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:01:45,780 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 294 transitions. [2019-11-24 04:01:45,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-24 04:01:45,784 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:01:45,784 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] [2019-11-24 04:01:45,786 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:01:45,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:01:45,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1923490951, now seen corresponding path program 1 times [2019-11-24 04:01:45,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:01:45,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971750226] [2019-11-24 04:01:45,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:01:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:01:46,115 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 04:01:46,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971750226] [2019-11-24 04:01:46,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:01:46,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:01:46,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5391498] [2019-11-24 04:01:46,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:01:46,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:01:46,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:01:46,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:01:46,119 INFO L87 Difference]: Start difference. First operand 195 states and 294 transitions. Second operand 4 states. [2019-11-24 04:01:46,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:01:46,199 INFO L93 Difference]: Finished difference Result 754 states and 1139 transitions. [2019-11-24 04:01:46,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:01:46,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-11-24 04:01:46,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:01:46,204 INFO L225 Difference]: With dead ends: 754 [2019-11-24 04:01:46,204 INFO L226 Difference]: Without dead ends: 571 [2019-11-24 04:01:46,206 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 04:01:46,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-11-24 04:01:46,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 197. [2019-11-24 04:01:46,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-11-24 04:01:46,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 296 transitions. [2019-11-24 04:01:46,227 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 296 transitions. Word has length 48 [2019-11-24 04:01:46,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:01:46,227 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 296 transitions. [2019-11-24 04:01:46,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:01:46,228 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 296 transitions. [2019-11-24 04:01:46,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-24 04:01:46,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:01:46,229 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] [2019-11-24 04:01:46,229 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:01:46,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:01:46,230 INFO L82 PathProgramCache]: Analyzing trace with hash 2061518797, now seen corresponding path program 1 times [2019-11-24 04:01:46,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:01:46,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442743617] [2019-11-24 04:01:46,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:01:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:01:46,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 04:01:46,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442743617] [2019-11-24 04:01:46,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:01:46,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:01:46,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550889820] [2019-11-24 04:01:46,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:01:46,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:01:46,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:01:46,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:01:46,666 INFO L87 Difference]: Start difference. First operand 197 states and 296 transitions. Second operand 4 states. [2019-11-24 04:01:46,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:01:46,916 INFO L93 Difference]: Finished difference Result 751 states and 1131 transitions. [2019-11-24 04:01:46,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:01:46,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-24 04:01:46,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:01:46,925 INFO L225 Difference]: With dead ends: 751 [2019-11-24 04:01:46,925 INFO L226 Difference]: Without dead ends: 566 [2019-11-24 04:01:46,926 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:01:46,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-11-24 04:01:46,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 199. [2019-11-24 04:01:46,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-11-24 04:01:46,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 298 transitions. [2019-11-24 04:01:46,949 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 298 transitions. Word has length 49 [2019-11-24 04:01:46,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:01:46,950 INFO L462 AbstractCegarLoop]: Abstraction has 199 states and 298 transitions. [2019-11-24 04:01:46,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:01:46,951 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 298 transitions. [2019-11-24 04:01:46,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 04:01:46,952 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:01:46,952 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] [2019-11-24 04:01:46,952 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:01:46,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:01:46,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1982553609, now seen corresponding path program 1 times [2019-11-24 04:01:46,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:01:46,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68354549] [2019-11-24 04:01:46,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:01:48,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:01:48,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 04:01:48,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68354549] [2019-11-24 04:01:48,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:01:48,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:01:48,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844970065] [2019-11-24 04:01:48,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 04:01:48,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:01:48,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 04:01:48,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:01:48,500 INFO L87 Difference]: Start difference. First operand 199 states and 298 transitions. Second operand 5 states. [2019-11-24 04:01:50,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:01:50,257 INFO L93 Difference]: Finished difference Result 541 states and 816 transitions. [2019-11-24 04:01:50,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 04:01:50,258 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-11-24 04:01:50,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:01:50,261 INFO L225 Difference]: With dead ends: 541 [2019-11-24 04:01:50,261 INFO L226 Difference]: Without dead ends: 525 [2019-11-24 04:01:50,261 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-24 04:01:50,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2019-11-24 04:01:50,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 362. [2019-11-24 04:01:50,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-11-24 04:01:50,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 549 transitions. [2019-11-24 04:01:50,277 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 549 transitions. Word has length 50 [2019-11-24 04:01:50,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:01:50,277 INFO L462 AbstractCegarLoop]: Abstraction has 362 states and 549 transitions. [2019-11-24 04:01:50,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 04:01:50,278 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 549 transitions. [2019-11-24 04:01:50,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-24 04:01:50,279 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:01:50,279 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] [2019-11-24 04:01:50,279 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:01:50,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:01:50,280 INFO L82 PathProgramCache]: Analyzing trace with hash 183669857, now seen corresponding path program 1 times [2019-11-24 04:01:50,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:01:50,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6457063] [2019-11-24 04:01:50,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:01:50,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:01:51,220 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 04:01:51,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6457063] [2019-11-24 04:01:51,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:01:51,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 04:01:51,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073319040] [2019-11-24 04:01:51,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 04:01:51,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:01:51,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 04:01:51,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:01:51,228 INFO L87 Difference]: Start difference. First operand 362 states and 549 transitions. Second operand 6 states. [2019-11-24 04:01:52,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:01:52,891 INFO L93 Difference]: Finished difference Result 549 states and 824 transitions. [2019-11-24 04:01:52,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 04:01:52,892 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-11-24 04:01:52,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:01:52,895 INFO L225 Difference]: With dead ends: 549 [2019-11-24 04:01:52,895 INFO L226 Difference]: Without dead ends: 533 [2019-11-24 04:01:52,896 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-24 04:01:52,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-11-24 04:01:52,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533. [2019-11-24 04:01:52,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-11-24 04:01:52,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 808 transitions. [2019-11-24 04:01:52,917 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 808 transitions. Word has length 57 [2019-11-24 04:01:52,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:01:52,917 INFO L462 AbstractCegarLoop]: Abstraction has 533 states and 808 transitions. [2019-11-24 04:01:52,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 04:01:52,917 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 808 transitions. [2019-11-24 04:01:52,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-24 04:01:52,918 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:01:52,919 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 04:01:52,919 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:01:52,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:01:52,919 INFO L82 PathProgramCache]: Analyzing trace with hash 485780898, now seen corresponding path program 1 times [2019-11-24 04:01:52,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:01:52,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326655801] [2019-11-24 04:01:52,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:01:57,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:01:57,618 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-24 04:01:57,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326655801] [2019-11-24 04:01:57,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:01:57,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:01:57,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840038015] [2019-11-24 04:01:57,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:01:57,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:01:57,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:01:57,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:01:57,623 INFO L87 Difference]: Start difference. First operand 533 states and 808 transitions. Second operand 3 states. [2019-11-24 04:01:58,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:01:58,176 INFO L93 Difference]: Finished difference Result 1066 states and 1617 transitions. [2019-11-24 04:01:58,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:01:58,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-11-24 04:01:58,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:01:58,179 INFO L225 Difference]: With dead ends: 1066 [2019-11-24 04:01:58,180 INFO L226 Difference]: Without dead ends: 536 [2019-11-24 04:01:58,181 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 04:01:58,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-11-24 04:01:58,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2019-11-24 04:01:58,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-11-24 04:01:58,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 811 transitions. [2019-11-24 04:01:58,205 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 811 transitions. Word has length 64 [2019-11-24 04:01:58,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:01:58,205 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 811 transitions. [2019-11-24 04:01:58,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:01:58,205 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 811 transitions. [2019-11-24 04:01:58,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-24 04:01:58,207 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:01:58,208 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 04:01:58,208 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:01:58,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:01:58,208 INFO L82 PathProgramCache]: Analyzing trace with hash 659516950, now seen corresponding path program 1 times [2019-11-24 04:01:58,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:01:58,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107753071] [2019-11-24 04:01:58,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:02:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:02:01,195 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-24 04:02:01,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107753071] [2019-11-24 04:02:01,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:02:01,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:02:01,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277083966] [2019-11-24 04:02:01,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:02:01,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:02:01,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:02:01,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:02:01,198 INFO L87 Difference]: Start difference. First operand 536 states and 811 transitions. Second operand 3 states. [2019-11-24 04:02:01,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:02:01,813 INFO L93 Difference]: Finished difference Result 1070 states and 1620 transitions. [2019-11-24 04:02:01,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:02:01,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-24 04:02:01,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:02:01,817 INFO L225 Difference]: With dead ends: 1070 [2019-11-24 04:02:01,817 INFO L226 Difference]: Without dead ends: 539 [2019-11-24 04:02:01,818 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 04:02:01,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2019-11-24 04:02:01,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 539. [2019-11-24 04:02:01,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2019-11-24 04:02:01,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 814 transitions. [2019-11-24 04:02:01,846 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 814 transitions. Word has length 67 [2019-11-24 04:02:01,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:02:01,846 INFO L462 AbstractCegarLoop]: Abstraction has 539 states and 814 transitions. [2019-11-24 04:02:01,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:02:01,846 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 814 transitions. [2019-11-24 04:02:01,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-24 04:02:01,848 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:02:01,848 INFO L410 BasicCegarLoop]: trace histogram [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 04:02:01,848 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:02:01,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:02:01,849 INFO L82 PathProgramCache]: Analyzing trace with hash -990302704, now seen corresponding path program 1 times [2019-11-24 04:02:01,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:02:01,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219362638] [2019-11-24 04:02:01,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:02:09,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:02:09,740 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-24 04:02:09,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219362638] [2019-11-24 04:02:09,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:02:09,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:02:09,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383293054] [2019-11-24 04:02:09,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:02:09,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:02:09,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:02:09,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:02:09,743 INFO L87 Difference]: Start difference. First operand 539 states and 814 transitions. Second operand 3 states. [2019-11-24 04:02:09,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:02:09,893 INFO L93 Difference]: Finished difference Result 1079 states and 1631 transitions. [2019-11-24 04:02:09,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:02:09,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-11-24 04:02:09,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:02:09,896 INFO L225 Difference]: With dead ends: 1079 [2019-11-24 04:02:09,896 INFO L226 Difference]: Without dead ends: 542 [2019-11-24 04:02:09,898 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 04:02:09,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-11-24 04:02:09,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 542. [2019-11-24 04:02:09,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-11-24 04:02:09,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 817 transitions. [2019-11-24 04:02:09,918 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 817 transitions. Word has length 70 [2019-11-24 04:02:09,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:02:09,918 INFO L462 AbstractCegarLoop]: Abstraction has 542 states and 817 transitions. [2019-11-24 04:02:09,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:02:09,919 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 817 transitions. [2019-11-24 04:02:09,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-24 04:02:09,920 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:02:09,920 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 04:02:09,920 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:02:09,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:02:09,921 INFO L82 PathProgramCache]: Analyzing trace with hash 253202246, now seen corresponding path program 1 times [2019-11-24 04:02:09,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:02:09,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298634623] [2019-11-24 04:02:09,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:02:12,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:02:12,724 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-24 04:02:12,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298634623] [2019-11-24 04:02:12,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:02:12,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 04:02:12,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771821632] [2019-11-24 04:02:12,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 04:02:12,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:02:12,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 04:02:12,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 04:02:12,731 INFO L87 Difference]: Start difference. First operand 542 states and 817 transitions. Second operand 3 states. [2019-11-24 04:02:12,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:02:12,804 INFO L93 Difference]: Finished difference Result 1066 states and 1608 transitions. [2019-11-24 04:02:12,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 04:02:12,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-24 04:02:12,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:02:12,810 INFO L225 Difference]: With dead ends: 1066 [2019-11-24 04:02:12,811 INFO L226 Difference]: Without dead ends: 544 [2019-11-24 04:02:12,813 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 04:02:12,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-11-24 04:02:12,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2019-11-24 04:02:12,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-11-24 04:02:12,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 819 transitions. [2019-11-24 04:02:12,835 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 819 transitions. Word has length 73 [2019-11-24 04:02:12,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:02:12,838 INFO L462 AbstractCegarLoop]: Abstraction has 544 states and 819 transitions. [2019-11-24 04:02:12,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 04:02:12,838 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 819 transitions. [2019-11-24 04:02:12,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-24 04:02:12,839 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:02:12,840 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 04:02:12,840 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:02:12,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:02:12,840 INFO L82 PathProgramCache]: Analyzing trace with hash 795171370, now seen corresponding path program 1 times [2019-11-24 04:02:12,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:02:12,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060293237] [2019-11-24 04:02:12,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:02:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:02:16,854 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-24 04:02:16,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060293237] [2019-11-24 04:02:16,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135524036] [2019-11-24 04:02:16,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 04:02:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:02:23,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 2414 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-24 04:02:23,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 04:02:23,336 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-24 04:02:23,336 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 04:02:23,384 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-24 04:02:23,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [930047557] [2019-11-24 04:02:23,415 INFO L159 IcfgInterpreter]: Started Sifa with 59 locations of interest [2019-11-24 04:02:23,417 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 04:02:23,424 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 04:02:23,434 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 04:02:23,434 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs