/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/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 05:48:05,882 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 05:48:05,884 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 05:48:05,896 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 05:48:05,896 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 05:48:05,897 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 05:48:05,899 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 05:48:05,900 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 05:48:05,902 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 05:48:05,903 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 05:48:05,904 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 05:48:05,905 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 05:48:05,905 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 05:48:05,906 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 05:48:05,907 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 05:48:05,908 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 05:48:05,909 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 05:48:05,910 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 05:48:05,911 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 05:48:05,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 05:48:05,915 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 05:48:05,916 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 05:48:05,917 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 05:48:05,918 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 05:48:05,920 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 05:48:05,920 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 05:48:05,920 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 05:48:05,921 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 05:48:05,922 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 05:48:05,923 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 05:48:05,923 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 05:48:05,923 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 05:48:05,924 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 05:48:05,925 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 05:48:05,926 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 05:48:05,926 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 05:48:05,927 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 05:48:05,927 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 05:48:05,927 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 05:48:05,928 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 05:48:05,928 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 05:48:05,929 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 05:48:05,944 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 05:48:05,944 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 05:48:05,945 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 05:48:05,945 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 05:48:05,945 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 05:48:05,946 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 05:48:05,946 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 05:48:05,946 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 05:48:05,946 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 05:48:05,946 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 05:48:05,947 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 05:48:05,947 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 05:48:05,947 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 05:48:05,947 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 05:48:05,947 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 05:48:05,948 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 05:48:05,948 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 05:48:05,948 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 05:48:05,949 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 05:48:05,949 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 05:48:05,949 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 05:48:05,949 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 05:48:05,949 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 05:48:05,950 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 05:48:05,950 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 05:48:05,950 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 05:48:05,950 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 05:48:05,950 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 05:48:05,951 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 05:48:05,951 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 05:48:05,951 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 05:48:05,951 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 05:48:05,951 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 05:48:05,952 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 05:48:05,952 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 05:48:05,953 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 05:48:05,953 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 05:48:05,953 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 05:48:06,219 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 05:48:06,232 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 05:48:06,235 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 05:48:06,237 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 05:48:06,237 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 05:48:06,238 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-11-24 05:48:06,306 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/803f43f1e/375b40e1279b4f8b92d2aa7a5f4d4d30/FLAGa18323ce0 [2019-11-24 05:48:06,821 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 05:48:06,822 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-11-24 05:48:06,837 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/803f43f1e/375b40e1279b4f8b92d2aa7a5f4d4d30/FLAGa18323ce0 [2019-11-24 05:48:07,128 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/803f43f1e/375b40e1279b4f8b92d2aa7a5f4d4d30 [2019-11-24 05:48:07,136 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 05:48:07,138 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 05:48:07,139 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 05:48:07,139 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 05:48:07,142 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 05:48:07,143 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:48:07" (1/1) ... [2019-11-24 05:48:07,146 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e3fce48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:07, skipping insertion in model container [2019-11-24 05:48:07,147 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 05:48:07" (1/1) ... [2019-11-24 05:48:07,155 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 05:48:07,216 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 05:48:07,610 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:48:07,626 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 05:48:07,703 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 05:48:07,725 INFO L208 MainTranslator]: Completed translation [2019-11-24 05:48:07,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:07 WrapperNode [2019-11-24 05:48:07,726 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 05:48:07,726 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 05:48:07,726 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 05:48:07,727 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 05:48:07,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:07" (1/1) ... [2019-11-24 05:48:07,749 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:07" (1/1) ... [2019-11-24 05:48:07,801 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 05:48:07,808 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 05:48:07,808 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 05:48:07,808 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 05:48:07,816 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:07" (1/1) ... [2019-11-24 05:48:07,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:07" (1/1) ... [2019-11-24 05:48:07,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:07" (1/1) ... [2019-11-24 05:48:07,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:07" (1/1) ... [2019-11-24 05:48:07,829 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:07" (1/1) ... [2019-11-24 05:48:07,837 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:07" (1/1) ... [2019-11-24 05:48:07,840 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:07" (1/1) ... [2019-11-24 05:48:07,845 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 05:48:07,845 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 05:48:07,846 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 05:48:07,846 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 05:48:07,847 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:07" (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 05:48:07,917 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 05:48:07,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 05:48:09,440 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 05:48:09,440 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-24 05:48:09,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:48:09 BoogieIcfgContainer [2019-11-24 05:48:09,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 05:48:09,444 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 05:48:09,444 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 05:48:09,448 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 05:48:09,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 05:48:07" (1/3) ... [2019-11-24 05:48:09,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76b82b08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:48:09, skipping insertion in model container [2019-11-24 05:48:09,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 05:48:07" (2/3) ... [2019-11-24 05:48:09,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76b82b08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 05:48:09, skipping insertion in model container [2019-11-24 05:48:09,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 05:48:09" (3/3) ... [2019-11-24 05:48:09,452 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-11-24 05:48:09,461 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 05:48:09,469 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-24 05:48:09,480 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-24 05:48:09,509 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 05:48:09,509 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 05:48:09,510 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 05:48:09,510 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 05:48:09,510 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 05:48:09,510 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 05:48:09,511 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 05:48:09,511 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 05:48:09,529 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2019-11-24 05:48:09,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-24 05:48:09,538 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:09,539 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] [2019-11-24 05:48:09,540 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:09,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:09,546 INFO L82 PathProgramCache]: Analyzing trace with hash 92277278, now seen corresponding path program 1 times [2019-11-24 05:48:09,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:09,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58293071] [2019-11-24 05:48:09,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:09,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:09,872 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 05:48:09,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58293071] [2019-11-24 05:48:09,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:09,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:48:09,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882994108] [2019-11-24 05:48:09,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:48:09,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:09,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:48:09,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:09,902 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 3 states. [2019-11-24 05:48:10,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:10,000 INFO L93 Difference]: Finished difference Result 210 states and 346 transitions. [2019-11-24 05:48:10,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:48:10,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-24 05:48:10,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:10,021 INFO L225 Difference]: With dead ends: 210 [2019-11-24 05:48:10,021 INFO L226 Difference]: Without dead ends: 140 [2019-11-24 05:48:10,027 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 05:48:10,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-24 05:48:10,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2019-11-24 05:48:10,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-11-24 05:48:10,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 209 transitions. [2019-11-24 05:48:10,079 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 209 transitions. Word has length 37 [2019-11-24 05:48:10,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:10,081 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 209 transitions. [2019-11-24 05:48:10,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:48:10,081 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 209 transitions. [2019-11-24 05:48:10,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-24 05:48:10,085 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:10,085 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 05:48:10,086 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:10,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:10,087 INFO L82 PathProgramCache]: Analyzing trace with hash 305885745, now seen corresponding path program 1 times [2019-11-24 05:48:10,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:10,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440629737] [2019-11-24 05:48:10,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:10,242 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 05:48:10,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440629737] [2019-11-24 05:48:10,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:10,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:48:10,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738462274] [2019-11-24 05:48:10,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:48:10,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:10,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:48:10,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:10,250 INFO L87 Difference]: Start difference. First operand 138 states and 209 transitions. Second operand 3 states. [2019-11-24 05:48:10,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:10,336 INFO L93 Difference]: Finished difference Result 315 states and 496 transitions. [2019-11-24 05:48:10,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:48:10,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-24 05:48:10,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:10,339 INFO L225 Difference]: With dead ends: 315 [2019-11-24 05:48:10,340 INFO L226 Difference]: Without dead ends: 203 [2019-11-24 05:48:10,341 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 05:48:10,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-11-24 05:48:10,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2019-11-24 05:48:10,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-11-24 05:48:10,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 308 transitions. [2019-11-24 05:48:10,365 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 308 transitions. Word has length 39 [2019-11-24 05:48:10,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:10,366 INFO L462 AbstractCegarLoop]: Abstraction has 201 states and 308 transitions. [2019-11-24 05:48:10,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:48:10,366 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 308 transitions. [2019-11-24 05:48:10,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-24 05:48:10,368 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:10,368 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] [2019-11-24 05:48:10,369 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:10,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:10,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1400214030, now seen corresponding path program 1 times [2019-11-24 05:48:10,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:10,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46832123] [2019-11-24 05:48:10,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:10,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:10,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:10,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46832123] [2019-11-24 05:48:10,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:10,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:48:10,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466615819] [2019-11-24 05:48:10,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:48:10,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:10,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:48:10,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:10,517 INFO L87 Difference]: Start difference. First operand 201 states and 308 transitions. Second operand 3 states. [2019-11-24 05:48:10,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:10,552 INFO L93 Difference]: Finished difference Result 505 states and 799 transitions. [2019-11-24 05:48:10,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:48:10,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-24 05:48:10,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:10,556 INFO L225 Difference]: With dead ends: 505 [2019-11-24 05:48:10,556 INFO L226 Difference]: Without dead ends: 332 [2019-11-24 05:48:10,557 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 05:48:10,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-11-24 05:48:10,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 330. [2019-11-24 05:48:10,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-11-24 05:48:10,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 515 transitions. [2019-11-24 05:48:10,586 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 515 transitions. Word has length 41 [2019-11-24 05:48:10,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:10,586 INFO L462 AbstractCegarLoop]: Abstraction has 330 states and 515 transitions. [2019-11-24 05:48:10,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:48:10,586 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 515 transitions. [2019-11-24 05:48:10,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-24 05:48:10,588 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:10,588 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] [2019-11-24 05:48:10,588 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:10,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:10,589 INFO L82 PathProgramCache]: Analyzing trace with hash 665409221, now seen corresponding path program 1 times [2019-11-24 05:48:10,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:10,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777197764] [2019-11-24 05:48:10,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:10,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:10,661 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 05:48:10,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777197764] [2019-11-24 05:48:10,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:10,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:48:10,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809885395] [2019-11-24 05:48:10,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:48:10,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:10,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:48:10,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:10,664 INFO L87 Difference]: Start difference. First operand 330 states and 515 transitions. Second operand 3 states. [2019-11-24 05:48:10,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:10,720 INFO L93 Difference]: Finished difference Result 821 states and 1306 transitions. [2019-11-24 05:48:10,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:48:10,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-24 05:48:10,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:10,725 INFO L225 Difference]: With dead ends: 821 [2019-11-24 05:48:10,725 INFO L226 Difference]: Without dead ends: 519 [2019-11-24 05:48:10,729 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 05:48:10,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2019-11-24 05:48:10,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 517. [2019-11-24 05:48:10,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2019-11-24 05:48:10,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 815 transitions. [2019-11-24 05:48:10,775 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 815 transitions. Word has length 43 [2019-11-24 05:48:10,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:10,777 INFO L462 AbstractCegarLoop]: Abstraction has 517 states and 815 transitions. [2019-11-24 05:48:10,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:48:10,777 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 815 transitions. [2019-11-24 05:48:10,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-24 05:48:10,785 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:10,785 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] [2019-11-24 05:48:10,785 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:10,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:10,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1375785338, now seen corresponding path program 1 times [2019-11-24 05:48:10,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:10,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913241312] [2019-11-24 05:48:10,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:10,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:10,868 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 05:48:10,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913241312] [2019-11-24 05:48:10,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:10,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:48:10,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913514932] [2019-11-24 05:48:10,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:48:10,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:10,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:48:10,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:10,871 INFO L87 Difference]: Start difference. First operand 517 states and 815 transitions. Second operand 3 states. [2019-11-24 05:48:10,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:10,928 INFO L93 Difference]: Finished difference Result 1337 states and 2134 transitions. [2019-11-24 05:48:10,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:48:10,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-11-24 05:48:10,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:10,934 INFO L225 Difference]: With dead ends: 1337 [2019-11-24 05:48:10,935 INFO L226 Difference]: Without dead ends: 864 [2019-11-24 05:48:10,936 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 05:48:10,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2019-11-24 05:48:10,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 862. [2019-11-24 05:48:10,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 862 states. [2019-11-24 05:48:10,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1361 transitions. [2019-11-24 05:48:10,984 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1361 transitions. Word has length 45 [2019-11-24 05:48:10,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:10,984 INFO L462 AbstractCegarLoop]: Abstraction has 862 states and 1361 transitions. [2019-11-24 05:48:10,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:48:10,984 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1361 transitions. [2019-11-24 05:48:10,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-24 05:48:10,985 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:10,986 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] [2019-11-24 05:48:10,986 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:10,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:10,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1669738950, now seen corresponding path program 1 times [2019-11-24 05:48:10,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:10,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132443828] [2019-11-24 05:48:10,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:11,044 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 05:48:11,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132443828] [2019-11-24 05:48:11,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:11,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 05:48:11,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465668808] [2019-11-24 05:48:11,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 05:48:11,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:11,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 05:48:11,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 05:48:11,047 INFO L87 Difference]: Start difference. First operand 862 states and 1361 transitions. Second operand 3 states. [2019-11-24 05:48:11,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:11,130 INFO L93 Difference]: Finished difference Result 2169 states and 3457 transitions. [2019-11-24 05:48:11,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 05:48:11,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-11-24 05:48:11,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:11,139 INFO L225 Difference]: With dead ends: 2169 [2019-11-24 05:48:11,139 INFO L226 Difference]: Without dead ends: 1351 [2019-11-24 05:48:11,141 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 05:48:11,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2019-11-24 05:48:11,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1349. [2019-11-24 05:48:11,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1349 states. [2019-11-24 05:48:11,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 2138 transitions. [2019-11-24 05:48:11,239 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 2138 transitions. Word has length 47 [2019-11-24 05:48:11,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:11,239 INFO L462 AbstractCegarLoop]: Abstraction has 1349 states and 2138 transitions. [2019-11-24 05:48:11,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 05:48:11,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 2138 transitions. [2019-11-24 05:48:11,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-24 05:48:11,242 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:11,242 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] [2019-11-24 05:48:11,242 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:11,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:11,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1599090873, now seen corresponding path program 1 times [2019-11-24 05:48:11,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:11,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739964734] [2019-11-24 05:48:11,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:11,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:11,349 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 05:48:11,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739964734] [2019-11-24 05:48:11,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:11,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 05:48:11,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41503003] [2019-11-24 05:48:11,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:48:11,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:11,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:48:11,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:48:11,351 INFO L87 Difference]: Start difference. First operand 1349 states and 2138 transitions. Second operand 5 states. [2019-11-24 05:48:11,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:11,672 INFO L93 Difference]: Finished difference Result 3437 states and 5465 transitions. [2019-11-24 05:48:11,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 05:48:11,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-11-24 05:48:11,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:11,684 INFO L225 Difference]: With dead ends: 3437 [2019-11-24 05:48:11,685 INFO L226 Difference]: Without dead ends: 2148 [2019-11-24 05:48:11,687 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-24 05:48:11,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2019-11-24 05:48:11,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 2138. [2019-11-24 05:48:11,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2138 states. [2019-11-24 05:48:11,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 2138 states and 3372 transitions. [2019-11-24 05:48:11,803 INFO L78 Accepts]: Start accepts. Automaton has 2138 states and 3372 transitions. Word has length 49 [2019-11-24 05:48:11,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:11,804 INFO L462 AbstractCegarLoop]: Abstraction has 2138 states and 3372 transitions. [2019-11-24 05:48:11,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:48:11,804 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 3372 transitions. [2019-11-24 05:48:11,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-24 05:48:11,806 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:11,806 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] [2019-11-24 05:48:11,807 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:11,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:11,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1905286298, now seen corresponding path program 1 times [2019-11-24 05:48:11,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:11,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592337486] [2019-11-24 05:48:11,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:11,922 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 05:48:11,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592337486] [2019-11-24 05:48:11,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:11,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:48:11,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406856500] [2019-11-24 05:48:11,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 05:48:11,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:11,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 05:48:11,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 05:48:11,925 INFO L87 Difference]: Start difference. First operand 2138 states and 3372 transitions. Second operand 4 states. [2019-11-24 05:48:12,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:12,078 INFO L93 Difference]: Finished difference Result 4218 states and 6669 transitions. [2019-11-24 05:48:12,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 05:48:12,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-11-24 05:48:12,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:12,089 INFO L225 Difference]: With dead ends: 4218 [2019-11-24 05:48:12,090 INFO L226 Difference]: Without dead ends: 2140 [2019-11-24 05:48:12,095 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:48:12,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2019-11-24 05:48:12,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 2138. [2019-11-24 05:48:12,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2138 states. [2019-11-24 05:48:12,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 2138 states and 3360 transitions. [2019-11-24 05:48:12,203 INFO L78 Accepts]: Start accepts. Automaton has 2138 states and 3360 transitions. Word has length 50 [2019-11-24 05:48:12,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:12,205 INFO L462 AbstractCegarLoop]: Abstraction has 2138 states and 3360 transitions. [2019-11-24 05:48:12,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 05:48:12,205 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 3360 transitions. [2019-11-24 05:48:12,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-24 05:48:12,207 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:12,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] [2019-11-24 05:48:12,207 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:12,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:12,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1123613074, now seen corresponding path program 1 times [2019-11-24 05:48:12,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:12,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774059308] [2019-11-24 05:48:12,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:12,287 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 05:48:12,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774059308] [2019-11-24 05:48:12,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:12,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:48:12,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702300423] [2019-11-24 05:48:12,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 05:48:12,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:12,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 05:48:12,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 05:48:12,298 INFO L87 Difference]: Start difference. First operand 2138 states and 3360 transitions. Second operand 4 states. [2019-11-24 05:48:12,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:12,530 INFO L93 Difference]: Finished difference Result 4218 states and 6645 transitions. [2019-11-24 05:48:12,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 05:48:12,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-24 05:48:12,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:12,546 INFO L225 Difference]: With dead ends: 4218 [2019-11-24 05:48:12,546 INFO L226 Difference]: Without dead ends: 2140 [2019-11-24 05:48:12,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:48:12,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2019-11-24 05:48:12,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 2138. [2019-11-24 05:48:12,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2138 states. [2019-11-24 05:48:12,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 2138 states and 3348 transitions. [2019-11-24 05:48:12,766 INFO L78 Accepts]: Start accepts. Automaton has 2138 states and 3348 transitions. Word has length 51 [2019-11-24 05:48:12,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:12,766 INFO L462 AbstractCegarLoop]: Abstraction has 2138 states and 3348 transitions. [2019-11-24 05:48:12,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 05:48:12,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 3348 transitions. [2019-11-24 05:48:12,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-24 05:48:12,768 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:12,768 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] [2019-11-24 05:48:12,768 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:12,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:12,769 INFO L82 PathProgramCache]: Analyzing trace with hash -525655071, now seen corresponding path program 1 times [2019-11-24 05:48:12,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:12,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224069692] [2019-11-24 05:48:12,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:12,851 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 05:48:12,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224069692] [2019-11-24 05:48:12,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:12,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 05:48:12,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537985479] [2019-11-24 05:48:12,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 05:48:12,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:12,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 05:48:12,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 05:48:12,854 INFO L87 Difference]: Start difference. First operand 2138 states and 3348 transitions. Second operand 4 states. [2019-11-24 05:48:13,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:13,044 INFO L93 Difference]: Finished difference Result 4218 states and 6621 transitions. [2019-11-24 05:48:13,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 05:48:13,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-24 05:48:13,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:13,056 INFO L225 Difference]: With dead ends: 4218 [2019-11-24 05:48:13,058 INFO L226 Difference]: Without dead ends: 2140 [2019-11-24 05:48:13,062 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:48:13,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2019-11-24 05:48:13,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 2138. [2019-11-24 05:48:13,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2138 states. [2019-11-24 05:48:13,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 2138 states and 3336 transitions. [2019-11-24 05:48:13,174 INFO L78 Accepts]: Start accepts. Automaton has 2138 states and 3336 transitions. Word has length 52 [2019-11-24 05:48:13,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:13,174 INFO L462 AbstractCegarLoop]: Abstraction has 2138 states and 3336 transitions. [2019-11-24 05:48:13,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 05:48:13,175 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 3336 transitions. [2019-11-24 05:48:13,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-24 05:48:13,175 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:13,175 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] [2019-11-24 05:48:13,176 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:13,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:13,176 INFO L82 PathProgramCache]: Analyzing trace with hash 134306322, now seen corresponding path program 1 times [2019-11-24 05:48:13,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:13,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968843059] [2019-11-24 05:48:13,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:13,412 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 05:48:13,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968843059] [2019-11-24 05:48:13,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:13,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 05:48:13,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552040343] [2019-11-24 05:48:13,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:48:13,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:13,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:48:13,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:48:13,417 INFO L87 Difference]: Start difference. First operand 2138 states and 3336 transitions. Second operand 5 states. [2019-11-24 05:48:13,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:13,763 INFO L93 Difference]: Finished difference Result 4218 states and 6597 transitions. [2019-11-24 05:48:13,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:48:13,764 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-11-24 05:48:13,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:13,775 INFO L225 Difference]: With dead ends: 4218 [2019-11-24 05:48:13,775 INFO L226 Difference]: Without dead ends: 2140 [2019-11-24 05:48:13,780 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-24 05:48:13,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2019-11-24 05:48:13,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 2138. [2019-11-24 05:48:13,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2138 states. [2019-11-24 05:48:13,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 2138 states and 3328 transitions. [2019-11-24 05:48:13,916 INFO L78 Accepts]: Start accepts. Automaton has 2138 states and 3328 transitions. Word has length 54 [2019-11-24 05:48:13,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:13,917 INFO L462 AbstractCegarLoop]: Abstraction has 2138 states and 3328 transitions. [2019-11-24 05:48:13,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:48:13,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 3328 transitions. [2019-11-24 05:48:13,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-24 05:48:13,918 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:13,918 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] [2019-11-24 05:48:13,918 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:13,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:13,919 INFO L82 PathProgramCache]: Analyzing trace with hash 456534912, now seen corresponding path program 1 times [2019-11-24 05:48:13,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:13,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821789291] [2019-11-24 05:48:13,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:14,055 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 05:48:14,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821789291] [2019-11-24 05:48:14,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:14,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 05:48:14,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252232697] [2019-11-24 05:48:14,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 05:48:14,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:14,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 05:48:14,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-24 05:48:14,058 INFO L87 Difference]: Start difference. First operand 2138 states and 3328 transitions. Second operand 5 states. [2019-11-24 05:48:14,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:14,339 INFO L93 Difference]: Finished difference Result 5390 states and 8383 transitions. [2019-11-24 05:48:14,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-24 05:48:14,340 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-11-24 05:48:14,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:14,356 INFO L225 Difference]: With dead ends: 5390 [2019-11-24 05:48:14,356 INFO L226 Difference]: Without dead ends: 3312 [2019-11-24 05:48:14,360 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-24 05:48:14,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3312 states. [2019-11-24 05:48:14,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3312 to 3310. [2019-11-24 05:48:14,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3310 states. [2019-11-24 05:48:14,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3310 states to 3310 states and 5118 transitions. [2019-11-24 05:48:14,702 INFO L78 Accepts]: Start accepts. Automaton has 3310 states and 5118 transitions. Word has length 57 [2019-11-24 05:48:14,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:14,702 INFO L462 AbstractCegarLoop]: Abstraction has 3310 states and 5118 transitions. [2019-11-24 05:48:14,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 05:48:14,703 INFO L276 IsEmpty]: Start isEmpty. Operand 3310 states and 5118 transitions. [2019-11-24 05:48:14,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-24 05:48:14,703 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:14,704 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] [2019-11-24 05:48:14,704 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:14,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:14,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1279266410, now seen corresponding path program 1 times [2019-11-24 05:48:14,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:14,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906059454] [2019-11-24 05:48:14,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:14,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:14,927 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 05:48:14,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906059454] [2019-11-24 05:48:14,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 05:48:14,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-24 05:48:14,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86123565] [2019-11-24 05:48:14,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 05:48:14,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 05:48:14,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 05:48:14,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-24 05:48:14,929 INFO L87 Difference]: Start difference. First operand 3310 states and 5118 transitions. Second operand 7 states. [2019-11-24 05:48:15,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 05:48:15,662 INFO L93 Difference]: Finished difference Result 7590 states and 11824 transitions. [2019-11-24 05:48:15,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-24 05:48:15,663 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-11-24 05:48:15,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 05:48:15,699 INFO L225 Difference]: With dead ends: 7590 [2019-11-24 05:48:15,699 INFO L226 Difference]: Without dead ends: 5420 [2019-11-24 05:48:15,705 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-11-24 05:48:15,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5420 states. [2019-11-24 05:48:16,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5420 to 3900. [2019-11-24 05:48:16,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3900 states. [2019-11-24 05:48:16,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3900 states to 3900 states and 5894 transitions. [2019-11-24 05:48:16,061 INFO L78 Accepts]: Start accepts. Automaton has 3900 states and 5894 transitions. Word has length 58 [2019-11-24 05:48:16,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 05:48:16,061 INFO L462 AbstractCegarLoop]: Abstraction has 3900 states and 5894 transitions. [2019-11-24 05:48:16,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 05:48:16,061 INFO L276 IsEmpty]: Start isEmpty. Operand 3900 states and 5894 transitions. [2019-11-24 05:48:16,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-24 05:48:16,062 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 05:48:16,063 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 05:48:16,063 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 05:48:16,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 05:48:16,064 INFO L82 PathProgramCache]: Analyzing trace with hash -2037120495, now seen corresponding path program 1 times [2019-11-24 05:48:16,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 05:48:16,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120342843] [2019-11-24 05:48:16,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 05:48:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:16,424 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 05:48:16,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120342843] [2019-11-24 05:48:16,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845880220] [2019-11-24 05:48:16,425 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 05:48:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 05:48:16,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-24 05:48:16,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 05:48:16,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:16,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:16,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,199 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:17,242 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 05:48:17,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,587 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 28 [2019-11-24 05:48:17,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-24 05:48:17,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,764 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-11-24 05:48:17,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:17,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:18,044 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2019-11-24 05:48:18,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-24 05:48:18,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-24 05:48:18,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-24 05:48:18,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-24 05:48:18,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-24 05:48:18,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 05:48:18,768 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-11-24 05:48:18,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-24 05:48:18,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:18,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 05:48:18,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-24 05:48:18,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:18,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 05:48:19,088 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 05:48:19,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1272451211] [2019-11-24 05:48:19,116 INFO L159 IcfgInterpreter]: Started Sifa with 59 locations of interest [2019-11-24 05:48:19,116 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 05:48:19,123 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 05:48:19,130 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 05:48:19,130 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 05:48:27,752 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-11-24 05:48:42,832 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 262144 conjuctions. This might take some time...