/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/forester-heap/sll-simple-white-blue-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 00:35:56,624 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 00:35:56,629 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 00:35:56,646 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 00:35:56,646 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 00:35:56,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 00:35:56,650 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 00:35:56,659 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 00:35:56,661 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 00:35:56,662 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 00:35:56,664 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 00:35:56,665 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 00:35:56,666 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 00:35:56,667 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 00:35:56,670 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 00:35:56,672 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 00:35:56,674 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 00:35:56,678 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 00:35:56,679 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 00:35:56,684 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 00:35:56,689 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 00:35:56,691 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 00:35:56,693 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 00:35:56,694 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 00:35:56,697 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 00:35:56,697 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 00:35:56,697 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 00:35:56,699 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 00:35:56,700 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 00:35:56,701 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 00:35:56,701 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 00:35:56,702 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 00:35:56,703 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 00:35:56,704 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 00:35:56,705 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 00:35:56,705 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 00:35:56,706 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 00:35:56,706 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 00:35:56,706 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 00:35:56,707 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 00:35:56,708 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 00:35:56,710 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 00:35:56,745 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 00:35:56,749 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 00:35:56,750 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 00:35:56,750 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 00:35:56,750 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 00:35:56,750 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 00:35:56,751 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 00:35:56,751 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 00:35:56,751 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 00:35:56,751 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 00:35:56,751 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 00:35:56,754 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 00:35:56,754 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 00:35:56,754 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 00:35:56,754 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 00:35:56,755 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 00:35:56,755 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 00:35:56,758 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 00:35:56,759 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 00:35:56,759 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 00:35:56,759 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 00:35:56,759 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 00:35:56,759 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 00:35:56,760 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 00:35:56,760 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 00:35:56,760 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 00:35:56,760 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 00:35:56,761 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 00:35:56,762 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 00:35:56,762 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 00:35:56,763 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 00:35:56,763 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 00:35:56,763 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 00:35:56,763 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 00:35:56,764 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 00:35:56,764 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 00:35:56,764 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 00:35:56,764 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 00:35:57,063 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 00:35:57,079 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 00:35:57,084 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 00:35:57,086 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 00:35:57,086 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 00:35:57,087 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-simple-white-blue-1.i [2019-11-24 00:35:57,165 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f8a0b986/6c0109f6638241e58c17c6b754732cbd/FLAG6caf7880e [2019-11-24 00:35:57,692 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 00:35:57,693 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-simple-white-blue-1.i [2019-11-24 00:35:57,704 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f8a0b986/6c0109f6638241e58c17c6b754732cbd/FLAG6caf7880e [2019-11-24 00:35:58,114 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f8a0b986/6c0109f6638241e58c17c6b754732cbd [2019-11-24 00:35:58,123 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 00:35:58,124 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 00:35:58,125 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 00:35:58,126 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 00:35:58,129 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 00:35:58,130 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:35:58" (1/1) ... [2019-11-24 00:35:58,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@96edca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:58, skipping insertion in model container [2019-11-24 00:35:58,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:35:58" (1/1) ... [2019-11-24 00:35:58,142 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 00:35:58,195 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 00:35:58,609 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 00:35:58,620 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 00:35:58,682 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 00:35:58,745 INFO L208 MainTranslator]: Completed translation [2019-11-24 00:35:58,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:58 WrapperNode [2019-11-24 00:35:58,746 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 00:35:58,747 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 00:35:58,747 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 00:35:58,747 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 00:35:58,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:58" (1/1) ... [2019-11-24 00:35:58,771 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:58" (1/1) ... [2019-11-24 00:35:58,793 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 00:35:58,794 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 00:35:58,794 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 00:35:58,794 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 00:35:58,803 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:58" (1/1) ... [2019-11-24 00:35:58,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:58" (1/1) ... [2019-11-24 00:35:58,807 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:58" (1/1) ... [2019-11-24 00:35:58,808 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:58" (1/1) ... [2019-11-24 00:35:58,816 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:58" (1/1) ... [2019-11-24 00:35:58,822 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:58" (1/1) ... [2019-11-24 00:35:58,824 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:58" (1/1) ... [2019-11-24 00:35:58,828 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 00:35:58,828 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 00:35:58,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 00:35:58,829 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 00:35:58,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:58" (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 00:35:58,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-24 00:35:58,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-24 00:35:58,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-24 00:35:58,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-24 00:35:58,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-24 00:35:58,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-24 00:35:58,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 00:35:58,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 00:35:59,365 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 00:35:59,366 INFO L284 CfgBuilder]: Removed 12 assume(true) statements. [2019-11-24 00:35:59,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:35:59 BoogieIcfgContainer [2019-11-24 00:35:59,368 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 00:35:59,369 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 00:35:59,369 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 00:35:59,375 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 00:35:59,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:35:58" (1/3) ... [2019-11-24 00:35:59,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cfc21e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:35:59, skipping insertion in model container [2019-11-24 00:35:59,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:35:58" (2/3) ... [2019-11-24 00:35:59,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cfc21e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:35:59, skipping insertion in model container [2019-11-24 00:35:59,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:35:59" (3/3) ... [2019-11-24 00:35:59,382 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue-1.i [2019-11-24 00:35:59,393 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 00:35:59,403 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-24 00:35:59,412 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-24 00:35:59,434 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 00:35:59,434 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 00:35:59,434 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 00:35:59,435 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 00:35:59,435 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 00:35:59,435 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 00:35:59,435 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 00:35:59,436 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 00:35:59,449 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-11-24 00:35:59,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-24 00:35:59,457 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:35:59,458 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:35:59,458 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:35:59,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:35:59,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1578730623, now seen corresponding path program 1 times [2019-11-24 00:35:59,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:35:59,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050909938] [2019-11-24 00:35:59,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:35:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:35:59,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:35:59,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050909938] [2019-11-24 00:35:59,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:35:59,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 00:35:59,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194291936] [2019-11-24 00:35:59,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-24 00:35:59,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:35:59,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-24 00:35:59,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 00:35:59,620 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-11-24 00:35:59,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:35:59,637 INFO L93 Difference]: Finished difference Result 38 states and 59 transitions. [2019-11-24 00:35:59,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-24 00:35:59,639 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-24 00:35:59,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:35:59,646 INFO L225 Difference]: With dead ends: 38 [2019-11-24 00:35:59,647 INFO L226 Difference]: Without dead ends: 18 [2019-11-24 00:35:59,650 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-24 00:35:59,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-11-24 00:35:59,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-24 00:35:59,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-24 00:35:59,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2019-11-24 00:35:59,682 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 10 [2019-11-24 00:35:59,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:35:59,683 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-11-24 00:35:59,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-24 00:35:59,683 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2019-11-24 00:35:59,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-24 00:35:59,684 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:35:59,684 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:35:59,685 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:35:59,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:35:59,685 INFO L82 PathProgramCache]: Analyzing trace with hash -725012791, now seen corresponding path program 1 times [2019-11-24 00:35:59,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:35:59,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186051936] [2019-11-24 00:35:59,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:35:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:35:59,948 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 00:35:59,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186051936] [2019-11-24 00:35:59,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:35:59,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 00:35:59,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643116847] [2019-11-24 00:35:59,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 00:35:59,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:35:59,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 00:35:59,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-24 00:35:59,953 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand 7 states. [2019-11-24 00:36:00,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:36:00,297 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2019-11-24 00:36:00,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-24 00:36:00,297 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-11-24 00:36:00,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:36:00,300 INFO L225 Difference]: With dead ends: 42 [2019-11-24 00:36:00,300 INFO L226 Difference]: Without dead ends: 40 [2019-11-24 00:36:00,301 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-24 00:36:00,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-24 00:36:00,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 24. [2019-11-24 00:36:00,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-24 00:36:00,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2019-11-24 00:36:00,309 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 12 [2019-11-24 00:36:00,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:36:00,310 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-11-24 00:36:00,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 00:36:00,310 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2019-11-24 00:36:00,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-24 00:36:00,311 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:36:00,311 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:36:00,311 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:36:00,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:36:00,312 INFO L82 PathProgramCache]: Analyzing trace with hash 550538030, now seen corresponding path program 1 times [2019-11-24 00:36:00,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:36:00,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483675890] [2019-11-24 00:36:00,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:36:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:36:00,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:36:00,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483675890] [2019-11-24 00:36:00,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987322418] [2019-11-24 00:36:00,472 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 00:36:00,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:36:00,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-24 00:36:00,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 00:36:00,635 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:36:00,636 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-24 00:36:00,637 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:36:00,677 INFO L567 ElimStorePlain]: treesize reduction 10, result has 85.5 percent of original size [2019-11-24 00:36:00,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:36:00,686 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2019-11-24 00:36:00,687 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 00:36:00,702 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:36:00,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:36:00,709 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2019-11-24 00:36:00,710 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-24 00:36:00,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:36:00,723 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-24 00:36:00,723 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:54, output treesize:29 [2019-11-24 00:36:00,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:36:00,843 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:36:00,844 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 89 [2019-11-24 00:36:00,846 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:36:00,881 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:36:00,882 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 108 [2019-11-24 00:36:00,884 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 00:36:01,074 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-11-24 00:36:01,075 INFO L567 ElimStorePlain]: treesize reduction 4, result has 97.5 percent of original size [2019-11-24 00:36:01,078 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_28|, |v_#memory_$Pointer$.offset_28|], 6=[|v_#memory_$Pointer$.base_30|, |v_#memory_$Pointer$.offset_30|]} [2019-11-24 00:36:01,087 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 00:36:01,094 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 00:36:01,157 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:36:01,166 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 00:36:01,173 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 00:36:01,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:36:01,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:36:01,266 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2019-11-24 00:36:01,268 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-24 00:36:01,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:36:01,286 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2019-11-24 00:36:01,287 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-24 00:36:01,345 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:36:01,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:36:01,367 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2019-11-24 00:36:01,368 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-24 00:36:01,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-24 00:36:01,384 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2019-11-24 00:36:01,385 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-24 00:36:01,429 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:36:01,431 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-24 00:36:01,432 INFO L221 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:176, output treesize:74 [2019-11-24 00:36:01,581 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:36:01,582 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 52 [2019-11-24 00:36:01,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:36:01,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-24 00:36:01,591 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 00:36:01,613 INFO L567 ElimStorePlain]: treesize reduction 16, result has 65.2 percent of original size [2019-11-24 00:36:01,618 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2019-11-24 00:36:01,619 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-24 00:36:01,633 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:36:01,634 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-24 00:36:01,635 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:7 [2019-11-24 00:36:01,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:36:01,639 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 00:36:01,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-24 00:36:01,673 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-24 00:36:01,677 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 00:36:01,720 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:36:01,725 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-24 00:36:01,728 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-24 00:36:01,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-24 00:36:01,749 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-11-24 00:36:01,749 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:125, output treesize:55 [2019-11-24 00:36:01,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:36:01,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [37697583] [2019-11-24 00:36:01,840 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2019-11-24 00:36:01,841 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 00:36:01,847 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 00:36:01,854 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 00:36:01,855 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 00:36:02,197 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-24 00:36:02,752 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-11-24 00:36:02,990 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-11-24 00:36:03,331 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-11-24 00:36:03,518 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2019-11-24 00:36:03,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-24 00:36:03,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [6, 6, 6] total 18 [2019-11-24 00:36:03,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716126633] [2019-11-24 00:36:03,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-24 00:36:03,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:36:03,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-24 00:36:03,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2019-11-24 00:36:03,523 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 9 states. [2019-11-24 00:36:03,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:36:03,715 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2019-11-24 00:36:03,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-24 00:36:03,716 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2019-11-24 00:36:03,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:36:03,717 INFO L225 Difference]: With dead ends: 47 [2019-11-24 00:36:03,717 INFO L226 Difference]: Without dead ends: 39 [2019-11-24 00:36:03,718 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2019-11-24 00:36:03,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-24 00:36:03,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2019-11-24 00:36:03,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-24 00:36:03,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2019-11-24 00:36:03,724 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 14 [2019-11-24 00:36:03,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:36:03,725 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2019-11-24 00:36:03,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-24 00:36:03,725 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2019-11-24 00:36:03,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 00:36:03,726 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:36:03,726 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:36:03,933 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 00:36:03,934 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:36:03,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:36:03,935 INFO L82 PathProgramCache]: Analyzing trace with hash 552533314, now seen corresponding path program 1 times [2019-11-24 00:36:03,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:36:03,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115383075] [2019-11-24 00:36:03,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:36:03,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:36:04,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:36:04,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115383075] [2019-11-24 00:36:04,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402935009] [2019-11-24 00:36:04,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 00:36:04,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:36:04,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-24 00:36:04,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 00:36:04,421 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-11-24 00:36:04,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:36:04,871 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 00:36:04,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:36:04,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1934158279] [2019-11-24 00:36:04,984 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-11-24 00:36:04,985 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 00:36:04,985 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 00:36:04,986 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 00:36:04,986 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 00:36:05,363 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-24 00:36:05,942 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-11-24 00:36:06,183 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-11-24 00:36:06,691 WARN L192 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 70 [2019-11-24 00:36:06,884 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2019-11-24 00:36:07,119 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2019-11-24 00:36:07,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-24 00:36:07,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6, 6, 6] total 19 [2019-11-24 00:36:07,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782795633] [2019-11-24 00:36:07,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-24 00:36:07,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:36:07,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-24 00:36:07,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2019-11-24 00:36:07,123 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand 10 states. [2019-11-24 00:36:07,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:36:07,338 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2019-11-24 00:36:07,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-24 00:36:07,338 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-11-24 00:36:07,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:36:07,339 INFO L225 Difference]: With dead ends: 43 [2019-11-24 00:36:07,339 INFO L226 Difference]: Without dead ends: 32 [2019-11-24 00:36:07,340 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2019-11-24 00:36:07,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-24 00:36:07,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2019-11-24 00:36:07,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-24 00:36:07,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-11-24 00:36:07,345 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 15 [2019-11-24 00:36:07,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:36:07,346 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-24 00:36:07,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-24 00:36:07,346 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-11-24 00:36:07,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 00:36:07,347 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:36:07,347 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:36:07,556 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 00:36:07,557 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:36:07,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:36:07,557 INFO L82 PathProgramCache]: Analyzing trace with hash -2061573268, now seen corresponding path program 1 times [2019-11-24 00:36:07,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:36:07,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958813694] [2019-11-24 00:36:07,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:36:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:36:07,651 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 00:36:07,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958813694] [2019-11-24 00:36:07,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:36:07,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-24 00:36:07,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253762815] [2019-11-24 00:36:07,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-24 00:36:07,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:36:07,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-24 00:36:07,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-24 00:36:07,653 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 6 states. [2019-11-24 00:36:07,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:36:07,825 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2019-11-24 00:36:07,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 00:36:07,826 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-24 00:36:07,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:36:07,827 INFO L225 Difference]: With dead ends: 62 [2019-11-24 00:36:07,827 INFO L226 Difference]: Without dead ends: 55 [2019-11-24 00:36:07,828 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-24 00:36:07,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-24 00:36:07,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 35. [2019-11-24 00:36:07,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-24 00:36:07,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2019-11-24 00:36:07,835 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 15 [2019-11-24 00:36:07,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:36:07,836 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2019-11-24 00:36:07,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-24 00:36:07,836 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2019-11-24 00:36:07,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 00:36:07,836 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:36:07,837 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:36:07,837 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:36:07,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:36:07,837 INFO L82 PathProgramCache]: Analyzing trace with hash 40177065, now seen corresponding path program 1 times [2019-11-24 00:36:07,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:36:07,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166198820] [2019-11-24 00:36:07,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:36:07,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:36:08,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:36:08,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166198820] [2019-11-24 00:36:08,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137912492] [2019-11-24 00:36:08,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 00:36:08,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:36:08,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-24 00:36:08,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 00:36:08,213 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 00:36:08,213 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 00:36:08,225 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 00:36:08,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-24 00:36:08,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [8] total 12 [2019-11-24 00:36:08,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398979377] [2019-11-24 00:36:08,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-24 00:36:08,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:36:08,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-24 00:36:08,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-24 00:36:08,228 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand 5 states. [2019-11-24 00:36:08,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:36:08,325 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2019-11-24 00:36:08,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-24 00:36:08,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-24 00:36:08,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:36:08,327 INFO L225 Difference]: With dead ends: 48 [2019-11-24 00:36:08,327 INFO L226 Difference]: Without dead ends: 40 [2019-11-24 00:36:08,328 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-24 00:36:08,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-24 00:36:08,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2019-11-24 00:36:08,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-24 00:36:08,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2019-11-24 00:36:08,333 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 16 [2019-11-24 00:36:08,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:36:08,334 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2019-11-24 00:36:08,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-24 00:36:08,338 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2019-11-24 00:36:08,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 00:36:08,339 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:36:08,339 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:36:08,539 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 00:36:08,540 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:36:08,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:36:08,541 INFO L82 PathProgramCache]: Analyzing trace with hash 311141137, now seen corresponding path program 1 times [2019-11-24 00:36:08,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:36:08,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014906173] [2019-11-24 00:36:08,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:36:08,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:36:08,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:36:08,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014906173] [2019-11-24 00:36:08,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 00:36:08,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-24 00:36:08,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611390824] [2019-11-24 00:36:08,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-24 00:36:08,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 00:36:08,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-24 00:36:08,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-24 00:36:08,673 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand 7 states. [2019-11-24 00:36:08,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 00:36:08,865 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2019-11-24 00:36:08,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-24 00:36:08,867 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-11-24 00:36:08,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 00:36:08,868 INFO L225 Difference]: With dead ends: 59 [2019-11-24 00:36:08,868 INFO L226 Difference]: Without dead ends: 47 [2019-11-24 00:36:08,871 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-24 00:36:08,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-24 00:36:08,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2019-11-24 00:36:08,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-24 00:36:08,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2019-11-24 00:36:08,891 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 17 [2019-11-24 00:36:08,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 00:36:08,891 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2019-11-24 00:36:08,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-24 00:36:08,891 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2019-11-24 00:36:08,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 00:36:08,893 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 00:36:08,895 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 00:36:08,895 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 00:36:08,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 00:36:08,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1911212583, now seen corresponding path program 1 times [2019-11-24 00:36:08,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 00:36:08,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878348127] [2019-11-24 00:36:08,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 00:36:08,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:36:09,192 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:36:09,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878348127] [2019-11-24 00:36:09,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395388477] [2019-11-24 00:36:09,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 00:36:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 00:36:09,283 WARN L253 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 61 conjunts are in the unsatisfiable core [2019-11-24 00:36:09,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 00:36:10,078 WARN L192 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-11-24 00:36:10,435 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-24 00:36:10,612 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-24 00:36:10,731 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-24 00:36:12,071 WARN L192 SmtUtils]: Spent 949.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 118 [2019-11-24 00:36:13,230 WARN L192 SmtUtils]: Spent 938.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 111 [2019-11-24 00:36:13,513 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2019-11-24 00:36:13,805 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-11-24 00:36:13,990 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-24 00:36:14,174 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-11-24 00:36:14,564 WARN L192 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 90 [2019-11-24 00:36:14,863 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-11-24 00:36:15,120 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2019-11-24 00:36:15,851 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-11-24 00:36:18,017 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 40 [2019-11-24 00:36:18,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 00:36:18,170 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 00:36:19,371 WARN L192 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 114 [2019-11-24 00:36:20,427 WARN L192 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 328 DAG size of output: 106 [2019-11-24 00:36:20,708 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 142