/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/locks/test_locks_13.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 04:13:23,078 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 04:13:23,080 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 04:13:23,099 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 04:13:23,099 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 04:13:23,101 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 04:13:23,102 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 04:13:23,114 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 04:13:23,116 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 04:13:23,117 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 04:13:23,118 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 04:13:23,119 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 04:13:23,119 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 04:13:23,120 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 04:13:23,121 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 04:13:23,122 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 04:13:23,123 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 04:13:23,124 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 04:13:23,125 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 04:13:23,127 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 04:13:23,128 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 04:13:23,129 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 04:13:23,130 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 04:13:23,131 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 04:13:23,133 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 04:13:23,133 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 04:13:23,134 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 04:13:23,134 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 04:13:23,135 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 04:13:23,136 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 04:13:23,136 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 04:13:23,137 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 04:13:23,138 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 04:13:23,138 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 04:13:23,139 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 04:13:23,139 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 04:13:23,140 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 04:13:23,140 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 04:13:23,141 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 04:13:23,141 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 04:13:23,142 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 04:13:23,143 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-24 04:13:23,157 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 04:13:23,157 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 04:13:23,158 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 04:13:23,158 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 04:13:23,158 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 04:13:23,159 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 04:13:23,159 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 04:13:23,159 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 04:13:23,159 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 04:13:23,159 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 04:13:23,160 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 04:13:23,160 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 04:13:23,160 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 04:13:23,160 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 04:13:23,160 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 04:13:23,161 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 04:13:23,161 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 04:13:23,161 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 04:13:23,162 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 04:13:23,162 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 04:13:23,162 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 04:13:23,162 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 04:13:23,162 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 04:13:23,163 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 04:13:23,163 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 04:13:23,163 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 04:13:23,163 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 04:13:23,164 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 04:13:23,164 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 04:13:23,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:13:23,164 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 04:13:23,164 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 04:13:23,165 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 04:13:23,165 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 04:13:23,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 04:13:23,165 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 04:13:23,165 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 04:13:23,166 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 04:13:23,424 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 04:13:23,441 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 04:13:23,445 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 04:13:23,447 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 04:13:23,447 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 04:13:23,448 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_13.c [2019-11-24 04:13:23,519 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/443800ec7/5cd7d80b37f2419a888c176c1b8d38d2/FLAG49556191c [2019-11-24 04:13:23,972 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 04:13:23,974 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_13.c [2019-11-24 04:13:23,982 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/443800ec7/5cd7d80b37f2419a888c176c1b8d38d2/FLAG49556191c [2019-11-24 04:13:24,380 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/443800ec7/5cd7d80b37f2419a888c176c1b8d38d2 [2019-11-24 04:13:24,390 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 04:13:24,395 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 04:13:24,396 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 04:13:24,396 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 04:13:24,401 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 04:13:24,401 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:13:24" (1/1) ... [2019-11-24 04:13:24,405 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67c49f5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:13:24, skipping insertion in model container [2019-11-24 04:13:24,405 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 04:13:24" (1/1) ... [2019-11-24 04:13:24,412 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 04:13:24,435 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 04:13:24,653 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:13:24,657 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 04:13:24,684 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 04:13:24,784 INFO L208 MainTranslator]: Completed translation [2019-11-24 04:13:24,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:13:24 WrapperNode [2019-11-24 04:13:24,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 04:13:24,786 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 04:13:24,786 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 04:13:24,786 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 04:13:24,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:13:24" (1/1) ... [2019-11-24 04:13:24,801 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:13:24" (1/1) ... [2019-11-24 04:13:24,831 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 04:13:24,831 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 04:13:24,832 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 04:13:24,832 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 04:13:24,846 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:13:24" (1/1) ... [2019-11-24 04:13:24,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:13:24" (1/1) ... [2019-11-24 04:13:24,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:13:24" (1/1) ... [2019-11-24 04:13:24,849 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:13:24" (1/1) ... [2019-11-24 04:13:24,853 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:13:24" (1/1) ... [2019-11-24 04:13:24,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:13:24" (1/1) ... [2019-11-24 04:13:24,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:13:24" (1/1) ... [2019-11-24 04:13:24,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 04:13:24,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 04:13:24,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 04:13:24,864 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 04:13:24,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:13:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 04:13:24,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 04:13:24,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 04:13:25,537 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 04:13:25,537 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-24 04:13:25,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:13:25 BoogieIcfgContainer [2019-11-24 04:13:25,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 04:13:25,540 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 04:13:25,540 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 04:13:25,543 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 04:13:25,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 04:13:24" (1/3) ... [2019-11-24 04:13:25,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e0418d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:13:25, skipping insertion in model container [2019-11-24 04:13:25,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 04:13:24" (2/3) ... [2019-11-24 04:13:25,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e0418d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 04:13:25, skipping insertion in model container [2019-11-24 04:13:25,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 04:13:25" (3/3) ... [2019-11-24 04:13:25,547 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_13.c [2019-11-24 04:13:25,557 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 04:13:25,564 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-24 04:13:25,574 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-24 04:13:25,597 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 04:13:25,597 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 04:13:25,598 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 04:13:25,598 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 04:13:25,598 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 04:13:25,599 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 04:13:25,599 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 04:13:25,599 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 04:13:25,614 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2019-11-24 04:13:25,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-24 04:13:25,620 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:13:25,621 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-24 04:13:25,622 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:13:25,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:13:25,627 INFO L82 PathProgramCache]: Analyzing trace with hash 933626343, now seen corresponding path program 1 times [2019-11-24 04:13:25,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:13:25,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933353231] [2019-11-24 04:13:25,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:13:25,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:13:25,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:13:25,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933353231] [2019-11-24 04:13:25,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:13:25,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:13:25,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676441480] [2019-11-24 04:13:25,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:13:25,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:13:25,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:13:25,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:13:25,850 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 4 states. [2019-11-24 04:13:25,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:13:25,909 INFO L93 Difference]: Finished difference Result 70 states and 121 transitions. [2019-11-24 04:13:25,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:13:25,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-11-24 04:13:25,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:13:25,922 INFO L225 Difference]: With dead ends: 70 [2019-11-24 04:13:25,923 INFO L226 Difference]: Without dead ends: 59 [2019-11-24 04:13:25,926 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:13:25,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-24 04:13:25,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 31. [2019-11-24 04:13:25,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-24 04:13:25,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 55 transitions. [2019-11-24 04:13:25,966 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 55 transitions. Word has length 6 [2019-11-24 04:13:25,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:13:25,966 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 55 transitions. [2019-11-24 04:13:25,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:13:25,967 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 55 transitions. [2019-11-24 04:13:25,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-24 04:13:25,967 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:13:25,967 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:13:25,968 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:13:25,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:13:25,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1122142064, now seen corresponding path program 1 times [2019-11-24 04:13:25,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:13:25,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083057233] [2019-11-24 04:13:25,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:13:25,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:13:26,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:13:26,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083057233] [2019-11-24 04:13:26,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:13:26,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:13:26,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408386515] [2019-11-24 04:13:26,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:13:26,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:13:26,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:13:26,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:13:26,062 INFO L87 Difference]: Start difference. First operand 31 states and 55 transitions. Second operand 4 states. [2019-11-24 04:13:26,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:13:26,098 INFO L93 Difference]: Finished difference Result 59 states and 103 transitions. [2019-11-24 04:13:26,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:13:26,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-24 04:13:26,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:13:26,102 INFO L225 Difference]: With dead ends: 59 [2019-11-24 04:13:26,102 INFO L226 Difference]: Without dead ends: 57 [2019-11-24 04:13:26,104 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:13:26,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-24 04:13:26,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 31. [2019-11-24 04:13:26,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-24 04:13:26,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 54 transitions. [2019-11-24 04:13:26,116 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 54 transitions. Word has length 7 [2019-11-24 04:13:26,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:13:26,117 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 54 transitions. [2019-11-24 04:13:26,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:13:26,117 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 54 transitions. [2019-11-24 04:13:26,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-24 04:13:26,119 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:13:26,119 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:13:26,120 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:13:26,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:13:26,121 INFO L82 PathProgramCache]: Analyzing trace with hash -426452900, now seen corresponding path program 1 times [2019-11-24 04:13:26,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:13:26,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553499549] [2019-11-24 04:13:26,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:13:26,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:13:26,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:13:26,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553499549] [2019-11-24 04:13:26,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:13:26,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:13:26,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278083687] [2019-11-24 04:13:26,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:13:26,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:13:26,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:13:26,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:13:26,236 INFO L87 Difference]: Start difference. First operand 31 states and 54 transitions. Second operand 4 states. [2019-11-24 04:13:26,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:13:26,274 INFO L93 Difference]: Finished difference Result 57 states and 98 transitions. [2019-11-24 04:13:26,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:13:26,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-24 04:13:26,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:13:26,278 INFO L225 Difference]: With dead ends: 57 [2019-11-24 04:13:26,278 INFO L226 Difference]: Without dead ends: 55 [2019-11-24 04:13:26,279 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:13:26,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-24 04:13:26,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 31. [2019-11-24 04:13:26,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-24 04:13:26,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 53 transitions. [2019-11-24 04:13:26,291 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 53 transitions. Word has length 8 [2019-11-24 04:13:26,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:13:26,292 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 53 transitions. [2019-11-24 04:13:26,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:13:26,292 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 53 transitions. [2019-11-24 04:13:26,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-24 04:13:26,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:13:26,293 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:13:26,293 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:13:26,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:13:26,294 INFO L82 PathProgramCache]: Analyzing trace with hash -334924955, now seen corresponding path program 1 times [2019-11-24 04:13:26,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:13:26,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333703561] [2019-11-24 04:13:26,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:13:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:13:26,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:13:26,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333703561] [2019-11-24 04:13:26,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:13:26,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:13:26,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079656376] [2019-11-24 04:13:26,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:13:26,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:13:26,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:13:26,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:13:26,375 INFO L87 Difference]: Start difference. First operand 31 states and 53 transitions. Second operand 4 states. [2019-11-24 04:13:26,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:13:26,400 INFO L93 Difference]: Finished difference Result 55 states and 93 transitions. [2019-11-24 04:13:26,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:13:26,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-24 04:13:26,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:13:26,401 INFO L225 Difference]: With dead ends: 55 [2019-11-24 04:13:26,402 INFO L226 Difference]: Without dead ends: 53 [2019-11-24 04:13:26,402 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:13:26,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-24 04:13:26,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 31. [2019-11-24 04:13:26,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-24 04:13:26,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 52 transitions. [2019-11-24 04:13:26,407 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 52 transitions. Word has length 9 [2019-11-24 04:13:26,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:13:26,408 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 52 transitions. [2019-11-24 04:13:26,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:13:26,408 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 52 transitions. [2019-11-24 04:13:26,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-24 04:13:26,409 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:13:26,409 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:13:26,409 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:13:26,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:13:26,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1792525615, now seen corresponding path program 1 times [2019-11-24 04:13:26,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:13:26,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028975810] [2019-11-24 04:13:26,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:13:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:13:26,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:13:26,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028975810] [2019-11-24 04:13:26,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:13:26,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:13:26,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798031503] [2019-11-24 04:13:26,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:13:26,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:13:26,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:13:26,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:13:26,466 INFO L87 Difference]: Start difference. First operand 31 states and 52 transitions. Second operand 4 states. [2019-11-24 04:13:26,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:13:26,500 INFO L93 Difference]: Finished difference Result 53 states and 88 transitions. [2019-11-24 04:13:26,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:13:26,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-24 04:13:26,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:13:26,502 INFO L225 Difference]: With dead ends: 53 [2019-11-24 04:13:26,502 INFO L226 Difference]: Without dead ends: 51 [2019-11-24 04:13:26,502 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:13:26,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-24 04:13:26,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 31. [2019-11-24 04:13:26,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-24 04:13:26,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2019-11-24 04:13:26,511 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 10 [2019-11-24 04:13:26,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:13:26,512 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2019-11-24 04:13:26,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:13:26,512 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2019-11-24 04:13:26,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-24 04:13:26,512 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:13:26,513 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:13:26,513 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:13:26,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:13:26,514 INFO L82 PathProgramCache]: Analyzing trace with hash 266494522, now seen corresponding path program 1 times [2019-11-24 04:13:26,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:13:26,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145938185] [2019-11-24 04:13:26,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:13:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:13:26,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:13:26,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145938185] [2019-11-24 04:13:26,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:13:26,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:13:26,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178238263] [2019-11-24 04:13:26,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:13:26,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:13:26,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:13:26,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:13:26,590 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 4 states. [2019-11-24 04:13:26,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:13:26,617 INFO L93 Difference]: Finished difference Result 51 states and 83 transitions. [2019-11-24 04:13:26,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:13:26,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-24 04:13:26,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:13:26,619 INFO L225 Difference]: With dead ends: 51 [2019-11-24 04:13:26,619 INFO L226 Difference]: Without dead ends: 49 [2019-11-24 04:13:26,619 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:13:26,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-24 04:13:26,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 31. [2019-11-24 04:13:26,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-24 04:13:26,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 50 transitions. [2019-11-24 04:13:26,626 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 50 transitions. Word has length 11 [2019-11-24 04:13:26,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:13:26,626 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 50 transitions. [2019-11-24 04:13:26,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:13:26,627 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 50 transitions. [2019-11-24 04:13:26,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-24 04:13:26,627 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:13:26,627 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:13:26,628 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:13:26,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:13:26,631 INFO L82 PathProgramCache]: Analyzing trace with hash -328390330, now seen corresponding path program 1 times [2019-11-24 04:13:26,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:13:26,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569355546] [2019-11-24 04:13:26,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:13:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:13:26,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:13:26,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569355546] [2019-11-24 04:13:26,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:13:26,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:13:26,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328287515] [2019-11-24 04:13:26,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:13:26,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:13:26,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:13:26,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:13:26,696 INFO L87 Difference]: Start difference. First operand 31 states and 50 transitions. Second operand 4 states. [2019-11-24 04:13:26,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:13:26,724 INFO L93 Difference]: Finished difference Result 49 states and 78 transitions. [2019-11-24 04:13:26,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:13:26,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-24 04:13:26,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:13:26,725 INFO L225 Difference]: With dead ends: 49 [2019-11-24 04:13:26,725 INFO L226 Difference]: Without dead ends: 47 [2019-11-24 04:13:26,726 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:13:26,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-24 04:13:26,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2019-11-24 04:13:26,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-24 04:13:26,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 49 transitions. [2019-11-24 04:13:26,732 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 49 transitions. Word has length 12 [2019-11-24 04:13:26,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:13:26,732 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 49 transitions. [2019-11-24 04:13:26,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:13:26,732 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 49 transitions. [2019-11-24 04:13:26,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-24 04:13:26,733 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:13:26,733 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:13:26,733 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:13:26,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:13:26,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1589951217, now seen corresponding path program 1 times [2019-11-24 04:13:26,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:13:26,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399448845] [2019-11-24 04:13:26,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:13:26,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:13:26,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:13:26,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399448845] [2019-11-24 04:13:26,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:13:26,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:13:26,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265679881] [2019-11-24 04:13:26,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:13:26,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:13:26,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:13:26,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:13:26,783 INFO L87 Difference]: Start difference. First operand 31 states and 49 transitions. Second operand 4 states. [2019-11-24 04:13:26,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:13:26,803 INFO L93 Difference]: Finished difference Result 47 states and 73 transitions. [2019-11-24 04:13:26,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:13:26,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-24 04:13:26,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:13:26,804 INFO L225 Difference]: With dead ends: 47 [2019-11-24 04:13:26,804 INFO L226 Difference]: Without dead ends: 45 [2019-11-24 04:13:26,805 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:13:26,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-24 04:13:26,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2019-11-24 04:13:26,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-24 04:13:26,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 48 transitions. [2019-11-24 04:13:26,808 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 48 transitions. Word has length 13 [2019-11-24 04:13:26,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:13:26,809 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 48 transitions. [2019-11-24 04:13:26,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:13:26,809 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 48 transitions. [2019-11-24 04:13:26,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-24 04:13:26,810 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:13:26,810 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:13:26,810 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:13:26,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:13:26,810 INFO L82 PathProgramCache]: Analyzing trace with hash -2043632709, now seen corresponding path program 1 times [2019-11-24 04:13:26,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:13:26,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942670376] [2019-11-24 04:13:26,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:13:26,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:13:26,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:13:26,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942670376] [2019-11-24 04:13:26,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:13:26,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:13:26,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309937388] [2019-11-24 04:13:26,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:13:26,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:13:26,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:13:26,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:13:26,847 INFO L87 Difference]: Start difference. First operand 31 states and 48 transitions. Second operand 4 states. [2019-11-24 04:13:26,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:13:26,868 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2019-11-24 04:13:26,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:13:26,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-24 04:13:26,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:13:26,870 INFO L225 Difference]: With dead ends: 45 [2019-11-24 04:13:26,870 INFO L226 Difference]: Without dead ends: 43 [2019-11-24 04:13:26,871 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:13:26,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-24 04:13:26,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2019-11-24 04:13:26,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-24 04:13:26,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 47 transitions. [2019-11-24 04:13:26,875 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 47 transitions. Word has length 14 [2019-11-24 04:13:26,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:13:26,875 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 47 transitions. [2019-11-24 04:13:26,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:13:26,875 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 47 transitions. [2019-11-24 04:13:26,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-24 04:13:26,876 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:13:26,876 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:13:26,876 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:13:26,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:13:26,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1072110564, now seen corresponding path program 1 times [2019-11-24 04:13:26,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:13:26,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831718444] [2019-11-24 04:13:26,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:13:26,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:13:26,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:13:26,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831718444] [2019-11-24 04:13:26,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:13:26,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:13:26,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727864468] [2019-11-24 04:13:26,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:13:26,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:13:26,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:13:26,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:13:26,916 INFO L87 Difference]: Start difference. First operand 31 states and 47 transitions. Second operand 4 states. [2019-11-24 04:13:26,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:13:26,936 INFO L93 Difference]: Finished difference Result 43 states and 63 transitions. [2019-11-24 04:13:26,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:13:26,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-24 04:13:26,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:13:26,942 INFO L225 Difference]: With dead ends: 43 [2019-11-24 04:13:26,942 INFO L226 Difference]: Without dead ends: 41 [2019-11-24 04:13:26,942 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:13:26,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-24 04:13:26,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. [2019-11-24 04:13:26,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-24 04:13:26,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. [2019-11-24 04:13:26,945 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 46 transitions. Word has length 15 [2019-11-24 04:13:26,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:13:26,946 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 46 transitions. [2019-11-24 04:13:26,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:13:26,946 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 46 transitions. [2019-11-24 04:13:26,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-24 04:13:26,947 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:13:26,947 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:13:26,947 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:13:26,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:13:26,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1124095440, now seen corresponding path program 1 times [2019-11-24 04:13:26,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:13:26,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790886322] [2019-11-24 04:13:26,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:13:26,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:13:26,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:13:26,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790886322] [2019-11-24 04:13:26,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:13:26,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:13:26,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443995286] [2019-11-24 04:13:26,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:13:26,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:13:26,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:13:26,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:13:26,986 INFO L87 Difference]: Start difference. First operand 31 states and 46 transitions. Second operand 4 states. [2019-11-24 04:13:27,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:13:27,005 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2019-11-24 04:13:27,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:13:27,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-24 04:13:27,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:13:27,006 INFO L225 Difference]: With dead ends: 41 [2019-11-24 04:13:27,006 INFO L226 Difference]: Without dead ends: 39 [2019-11-24 04:13:27,007 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:13:27,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-24 04:13:27,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2019-11-24 04:13:27,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-24 04:13:27,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2019-11-24 04:13:27,010 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 16 [2019-11-24 04:13:27,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:13:27,010 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2019-11-24 04:13:27,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:13:27,010 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2019-11-24 04:13:27,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-24 04:13:27,011 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:13:27,011 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:13:27,011 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:13:27,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:13:27,012 INFO L82 PathProgramCache]: Analyzing trace with hash -487004487, now seen corresponding path program 1 times [2019-11-24 04:13:27,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:13:27,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375587826] [2019-11-24 04:13:27,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:13:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:13:27,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:13:27,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375587826] [2019-11-24 04:13:27,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:13:27,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:13:27,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198321307] [2019-11-24 04:13:27,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:13:27,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:13:27,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:13:27,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:13:27,048 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 4 states. [2019-11-24 04:13:27,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:13:27,063 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2019-11-24 04:13:27,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:13:27,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-24 04:13:27,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:13:27,064 INFO L225 Difference]: With dead ends: 39 [2019-11-24 04:13:27,064 INFO L226 Difference]: Without dead ends: 37 [2019-11-24 04:13:27,065 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:13:27,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-24 04:13:27,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2019-11-24 04:13:27,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-24 04:13:27,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2019-11-24 04:13:27,068 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 44 transitions. Word has length 17 [2019-11-24 04:13:27,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:13:27,068 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 44 transitions. [2019-11-24 04:13:27,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:13:27,068 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 44 transitions. [2019-11-24 04:13:27,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 04:13:27,069 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 04:13:27,069 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 04:13:27,069 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 04:13:27,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 04:13:27,070 INFO L82 PathProgramCache]: Analyzing trace with hash 2082946213, now seen corresponding path program 1 times [2019-11-24 04:13:27,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 04:13:27,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509327199] [2019-11-24 04:13:27,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 04:13:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 04:13:27,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 04:13:27,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509327199] [2019-11-24 04:13:27,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 04:13:27,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 04:13:27,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299832603] [2019-11-24 04:13:27,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 04:13:27,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 04:13:27,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 04:13:27,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:13:27,105 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. Second operand 4 states. [2019-11-24 04:13:27,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 04:13:27,120 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2019-11-24 04:13:27,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 04:13:27,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-24 04:13:27,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 04:13:27,121 INFO L225 Difference]: With dead ends: 33 [2019-11-24 04:13:27,121 INFO L226 Difference]: Without dead ends: 0 [2019-11-24 04:13:27,122 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 04:13:27,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-24 04:13:27,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-24 04:13:27,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-24 04:13:27,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-24 04:13:27,122 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2019-11-24 04:13:27,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 04:13:27,123 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-24 04:13:27,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 04:13:27,123 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-24 04:13:27,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-24 04:13:27,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-24 04:13:27,153 INFO L444 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-24 04:13:27,154 INFO L447 ceAbstractionStarter]: At program point L201(lines 5 205) the Hoare annotation is: true [2019-11-24 04:13:27,154 INFO L444 ceAbstractionStarter]: For program point L135-1(lines 48 200) no Hoare annotation was computed. [2019-11-24 04:13:27,154 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-24 04:13:27,154 INFO L444 ceAbstractionStarter]: For program point L185-1(lines 48 200) no Hoare annotation was computed. [2019-11-24 04:13:27,154 INFO L444 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-24 04:13:27,154 INFO L444 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-11-24 04:13:27,154 INFO L444 ceAbstractionStarter]: For program point L170-1(lines 48 200) no Hoare annotation was computed. [2019-11-24 04:13:27,155 INFO L447 ceAbstractionStarter]: At program point L204(lines 4 205) the Hoare annotation is: true [2019-11-24 04:13:27,155 INFO L444 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-24 04:13:27,155 INFO L444 ceAbstractionStarter]: For program point L155-1(lines 48 200) no Hoare annotation was computed. [2019-11-24 04:13:27,155 INFO L444 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-11-24 04:13:27,155 INFO L444 ceAbstractionStarter]: For program point L140-1(lines 48 200) no Hoare annotation was computed. [2019-11-24 04:13:27,156 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-24 04:13:27,156 INFO L444 ceAbstractionStarter]: For program point L190-1(lines 48 200) no Hoare annotation was computed. [2019-11-24 04:13:27,156 INFO L444 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-11-24 04:13:27,156 INFO L444 ceAbstractionStarter]: For program point L191(line 191) no Hoare annotation was computed. [2019-11-24 04:13:27,156 INFO L444 ceAbstractionStarter]: For program point L175-1(lines 48 200) no Hoare annotation was computed. [2019-11-24 04:13:27,156 INFO L444 ceAbstractionStarter]: For program point L176(line 176) no Hoare annotation was computed. [2019-11-24 04:13:27,164 INFO L444 ceAbstractionStarter]: For program point L160-1(lines 48 200) no Hoare annotation was computed. [2019-11-24 04:13:27,164 INFO L444 ceAbstractionStarter]: For program point L161(line 161) no Hoare annotation was computed. [2019-11-24 04:13:27,164 INFO L444 ceAbstractionStarter]: For program point L145-1(lines 48 200) no Hoare annotation was computed. [2019-11-24 04:13:27,164 INFO L447 ceAbstractionStarter]: At program point L195-1(lines 48 200) the Hoare annotation is: true [2019-11-24 04:13:27,165 INFO L444 ceAbstractionStarter]: For program point L129-1(lines 48 200) no Hoare annotation was computed. [2019-11-24 04:13:27,165 INFO L444 ceAbstractionStarter]: For program point L146(line 146) no Hoare annotation was computed. [2019-11-24 04:13:27,165 INFO L444 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-24 04:13:27,165 INFO L440 ceAbstractionStarter]: At program point L196-1(lines 5 205) the Hoare annotation is: false [2019-11-24 04:13:27,165 INFO L444 ceAbstractionStarter]: For program point L180-1(lines 48 200) no Hoare annotation was computed. [2019-11-24 04:13:27,165 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 203) no Hoare annotation was computed. [2019-11-24 04:13:27,166 INFO L444 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-24 04:13:27,166 INFO L444 ceAbstractionStarter]: For program point L165-1(lines 48 200) no Hoare annotation was computed. [2019-11-24 04:13:27,166 INFO L444 ceAbstractionStarter]: For program point L50(lines 50 52) no Hoare annotation was computed. [2019-11-24 04:13:27,166 INFO L444 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-24 04:13:27,166 INFO L444 ceAbstractionStarter]: For program point L150-1(lines 48 200) no Hoare annotation was computed. [2019-11-24 04:13:27,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 04:13:27 BoogieIcfgContainer [2019-11-24 04:13:27,179 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-24 04:13:27,185 INFO L168 Benchmark]: Toolchain (without parser) took 2789.29 ms. Allocated memory was 146.3 MB in the beginning and 234.9 MB in the end (delta: 88.6 MB). Free memory was 103.8 MB in the beginning and 111.5 MB in the end (delta: -7.7 MB). Peak memory consumption was 80.9 MB. Max. memory is 7.1 GB. [2019-11-24 04:13:27,186 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-11-24 04:13:27,187 INFO L168 Benchmark]: CACSL2BoogieTranslator took 389.30 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 103.6 MB in the beginning and 182.3 MB in the end (delta: -78.7 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-11-24 04:13:27,188 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.61 ms. Allocated memory is still 203.4 MB. Free memory was 182.3 MB in the beginning and 179.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-11-24 04:13:27,189 INFO L168 Benchmark]: Boogie Preprocessor took 31.57 ms. Allocated memory is still 203.4 MB. Free memory was 179.9 MB in the beginning and 178.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-11-24 04:13:27,195 INFO L168 Benchmark]: RCFGBuilder took 675.58 ms. Allocated memory is still 203.4 MB. Free memory was 178.0 MB in the beginning and 136.3 MB in the end (delta: 41.7 MB). Peak memory consumption was 41.7 MB. Max. memory is 7.1 GB. [2019-11-24 04:13:27,196 INFO L168 Benchmark]: TraceAbstraction took 1639.15 ms. Allocated memory was 203.4 MB in the beginning and 234.9 MB in the end (delta: 31.5 MB). Free memory was 135.6 MB in the beginning and 111.5 MB in the end (delta: 24.1 MB). Peak memory consumption was 55.6 MB. Max. memory is 7.1 GB. [2019-11-24 04:13:27,202 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 389.30 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 103.6 MB in the beginning and 182.3 MB in the end (delta: -78.7 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.61 ms. Allocated memory is still 203.4 MB. Free memory was 182.3 MB in the beginning and 179.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.57 ms. Allocated memory is still 203.4 MB. Free memory was 179.9 MB in the beginning and 178.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 675.58 ms. Allocated memory is still 203.4 MB. Free memory was 178.0 MB in the beginning and 136.3 MB in the end (delta: 41.7 MB). Peak memory consumption was 41.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1639.15 ms. Allocated memory was 203.4 MB in the beginning and 234.9 MB in the end (delta: 31.5 MB). Free memory was 135.6 MB in the beginning and 111.5 MB in the end (delta: 24.1 MB). Peak memory consumption was 55.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 203]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 34 locations, 1 error locations. Result: SAFE, OverallTime: 1.5s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 616 SDtfs, 522 SDslu, 914 SDs, 0 SdLazy, 117 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 204 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 9 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 143 ConstructedInterpolants, 0 QuantifiedInterpolants, 9139 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...