/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/eca-rers2012/Problem01_label22.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:30:37,675 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:30:37,678 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:30:37,696 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:30:37,696 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:30:37,698 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:30:37,700 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:30:37,705 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:30:37,707 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:30:37,708 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:30:37,709 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:30:37,710 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:30:37,710 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:30:37,711 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:30:37,712 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:30:37,713 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:30:37,714 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:30:37,715 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:30:37,716 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:30:37,718 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:30:37,719 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:30:37,720 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:30:37,722 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:30:37,722 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:30:37,725 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:30:37,725 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:30:37,725 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:30:37,726 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:30:37,727 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:30:37,727 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:30:37,728 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:30:37,728 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:30:37,729 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:30:37,730 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:30:37,731 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:30:37,731 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:30:37,732 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:30:37,732 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:30:37,732 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:30:37,733 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:30:37,734 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:30:37,735 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-23 23:30:37,760 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:30:37,761 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:30:37,762 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:30:37,763 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:30:37,763 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:30:37,763 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:30:37,763 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:30:37,763 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:30:37,764 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:30:37,764 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:30:37,765 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:30:37,765 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:30:37,765 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:30:37,766 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:30:37,766 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:30:37,767 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:30:37,767 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:30:37,767 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:30:37,768 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:30:37,768 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:30:37,768 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:30:37,768 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:30:37,769 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:30:37,769 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:30:37,769 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:30:37,769 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:30:37,769 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:30:37,770 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:30:37,771 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:30:37,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:30:37,771 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:30:37,772 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:30:37,772 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:30:37,772 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:30:37,773 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:30:37,773 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:30:37,773 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:30:37,773 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:30:38,078 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:30:38,090 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:30:38,093 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:30:38,094 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:30:38,095 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:30:38,096 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label22.c [2019-11-23 23:30:38,158 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2efe48794/36978077cd5b4227be118de5dfaf81e7/FLAG2de458acd [2019-11-23 23:30:38,708 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:30:38,709 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label22.c [2019-11-23 23:30:38,719 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2efe48794/36978077cd5b4227be118de5dfaf81e7/FLAG2de458acd [2019-11-23 23:30:39,006 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2efe48794/36978077cd5b4227be118de5dfaf81e7 [2019-11-23 23:30:39,016 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:30:39,018 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:30:39,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:30:39,020 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:30:39,023 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:30:39,024 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:30:39" (1/1) ... [2019-11-23 23:30:39,029 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a725cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:39, skipping insertion in model container [2019-11-23 23:30:39,029 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:30:39" (1/1) ... [2019-11-23 23:30:39,038 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:30:39,100 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:30:39,626 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:30:39,631 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:30:39,765 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:30:39,784 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:30:39,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:39 WrapperNode [2019-11-23 23:30:39,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:30:39,786 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:30:39,786 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:30:39,787 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:30:39,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:39" (1/1) ... [2019-11-23 23:30:39,831 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:39" (1/1) ... [2019-11-23 23:30:39,934 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:30:39,934 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:30:39,935 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:30:39,935 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:30:39,948 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:39" (1/1) ... [2019-11-23 23:30:39,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:39" (1/1) ... [2019-11-23 23:30:39,953 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:39" (1/1) ... [2019-11-23 23:30:39,953 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:39" (1/1) ... [2019-11-23 23:30:39,978 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:39" (1/1) ... [2019-11-23 23:30:39,990 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:39" (1/1) ... [2019-11-23 23:30:39,996 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:39" (1/1) ... [2019-11-23 23:30:40,004 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:30:40,004 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:30:40,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:30:40,004 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:30:40,007 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:39" (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-23 23:30:40,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:30:40,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:30:42,144 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:30:42,144 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:30:42,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:42 BoogieIcfgContainer [2019-11-23 23:30:42,146 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:30:42,148 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:30:42,148 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:30:42,151 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:30:42,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:30:39" (1/3) ... [2019-11-23 23:30:42,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@599624f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:42, skipping insertion in model container [2019-11-23 23:30:42,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:39" (2/3) ... [2019-11-23 23:30:42,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@599624f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:42, skipping insertion in model container [2019-11-23 23:30:42,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:42" (3/3) ... [2019-11-23 23:30:42,156 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label22.c [2019-11-23 23:30:42,166 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:30:42,174 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:30:42,186 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:30:42,222 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:30:42,222 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:30:42,223 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:30:42,223 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:30:42,223 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:30:42,223 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:30:42,223 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:30:42,224 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:30:42,245 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-23 23:30:42,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-23 23:30:42,256 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:42,257 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:42,258 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:42,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:42,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1323229849, now seen corresponding path program 1 times [2019-11-23 23:30:42,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:42,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791306327] [2019-11-23 23:30:42,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:42,712 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-23 23:30:42,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791306327] [2019-11-23 23:30:42,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:42,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:42,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762734743] [2019-11-23 23:30:42,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:42,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:42,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:42,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:42,741 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-11-23 23:30:43,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:43,645 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-11-23 23:30:43,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:43,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-23 23:30:43,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:43,664 INFO L225 Difference]: With dead ends: 297 [2019-11-23 23:30:43,665 INFO L226 Difference]: Without dead ends: 216 [2019-11-23 23:30:43,671 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:43,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-23 23:30:43,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-11-23 23:30:43,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-23 23:30:43,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 378 transitions. [2019-11-23 23:30:43,736 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 378 transitions. Word has length 71 [2019-11-23 23:30:43,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:43,737 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 378 transitions. [2019-11-23 23:30:43,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:43,737 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 378 transitions. [2019-11-23 23:30:43,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-23 23:30:43,741 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:43,742 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:43,742 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:43,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:43,743 INFO L82 PathProgramCache]: Analyzing trace with hash 585787871, now seen corresponding path program 1 times [2019-11-23 23:30:43,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:43,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692467155] [2019-11-23 23:30:43,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:43,791 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:30:43,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692467155] [2019-11-23 23:30:43,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:43,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:43,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77529008] [2019-11-23 23:30:43,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:43,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:43,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:43,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:43,796 INFO L87 Difference]: Start difference. First operand 216 states and 378 transitions. Second operand 4 states. [2019-11-23 23:30:44,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:44,305 INFO L93 Difference]: Finished difference Result 644 states and 1131 transitions. [2019-11-23 23:30:44,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:44,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-23 23:30:44,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:44,312 INFO L225 Difference]: With dead ends: 644 [2019-11-23 23:30:44,312 INFO L226 Difference]: Without dead ends: 429 [2019-11-23 23:30:44,319 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-23 23:30:44,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-23 23:30:44,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-11-23 23:30:44,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-23 23:30:44,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 705 transitions. [2019-11-23 23:30:44,378 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 705 transitions. Word has length 76 [2019-11-23 23:30:44,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:44,382 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 705 transitions. [2019-11-23 23:30:44,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:44,382 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 705 transitions. [2019-11-23 23:30:44,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-23 23:30:44,395 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:44,396 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:44,396 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:44,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:44,397 INFO L82 PathProgramCache]: Analyzing trace with hash 928595177, now seen corresponding path program 1 times [2019-11-23 23:30:44,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:44,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606245833] [2019-11-23 23:30:44,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:44,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:44,464 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:30:44,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606245833] [2019-11-23 23:30:44,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:44,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:30:44,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561332073] [2019-11-23 23:30:44,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:44,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:44,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:44,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:44,467 INFO L87 Difference]: Start difference. First operand 429 states and 705 transitions. Second operand 3 states. [2019-11-23 23:30:44,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:44,900 INFO L93 Difference]: Finished difference Result 1070 states and 1785 transitions. [2019-11-23 23:30:44,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:44,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-23 23:30:44,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:44,907 INFO L225 Difference]: With dead ends: 1070 [2019-11-23 23:30:44,908 INFO L226 Difference]: Without dead ends: 642 [2019-11-23 23:30:44,909 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:44,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-11-23 23:30:44,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 500. [2019-11-23 23:30:44,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-11-23 23:30:44,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 825 transitions. [2019-11-23 23:30:44,933 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 825 transitions. Word has length 97 [2019-11-23 23:30:44,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:44,934 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 825 transitions. [2019-11-23 23:30:44,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:44,934 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 825 transitions. [2019-11-23 23:30:44,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-23 23:30:44,937 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:44,937 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:44,937 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:44,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:44,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1330789108, now seen corresponding path program 1 times [2019-11-23 23:30:44,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:44,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61268333] [2019-11-23 23:30:44,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:45,008 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-23 23:30:45,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61268333] [2019-11-23 23:30:45,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:45,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:30:45,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225507845] [2019-11-23 23:30:45,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:45,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:45,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:45,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:45,010 INFO L87 Difference]: Start difference. First operand 500 states and 825 transitions. Second operand 3 states. [2019-11-23 23:30:45,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:45,440 INFO L93 Difference]: Finished difference Result 1212 states and 1976 transitions. [2019-11-23 23:30:45,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:45,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-11-23 23:30:45,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:45,444 INFO L225 Difference]: With dead ends: 1212 [2019-11-23 23:30:45,445 INFO L226 Difference]: Without dead ends: 713 [2019-11-23 23:30:45,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:45,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-11-23 23:30:45,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 571. [2019-11-23 23:30:45,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-11-23 23:30:45,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 889 transitions. [2019-11-23 23:30:45,465 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 889 transitions. Word has length 133 [2019-11-23 23:30:45,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:45,466 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 889 transitions. [2019-11-23 23:30:45,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:45,466 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 889 transitions. [2019-11-23 23:30:45,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-23 23:30:45,468 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:45,469 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:45,469 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:45,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:45,469 INFO L82 PathProgramCache]: Analyzing trace with hash -573606752, now seen corresponding path program 1 times [2019-11-23 23:30:45,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:45,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333067599] [2019-11-23 23:30:45,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:45,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:45,572 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-23 23:30:45,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333067599] [2019-11-23 23:30:45,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:45,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:45,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377779269] [2019-11-23 23:30:45,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:45,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:45,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:45,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:45,575 INFO L87 Difference]: Start difference. First operand 571 states and 889 transitions. Second operand 4 states. [2019-11-23 23:30:46,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:46,125 INFO L93 Difference]: Finished difference Result 1229 states and 1883 transitions. [2019-11-23 23:30:46,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:30:46,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-11-23 23:30:46,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:46,129 INFO L225 Difference]: With dead ends: 1229 [2019-11-23 23:30:46,130 INFO L226 Difference]: Without dead ends: 659 [2019-11-23 23:30:46,132 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:30:46,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-11-23 23:30:46,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 642. [2019-11-23 23:30:46,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-11-23 23:30:46,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 966 transitions. [2019-11-23 23:30:46,156 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 966 transitions. Word has length 141 [2019-11-23 23:30:46,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:46,157 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 966 transitions. [2019-11-23 23:30:46,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:46,157 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 966 transitions. [2019-11-23 23:30:46,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-23 23:30:46,162 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:46,162 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:46,163 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:46,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:46,163 INFO L82 PathProgramCache]: Analyzing trace with hash 925216984, now seen corresponding path program 1 times [2019-11-23 23:30:46,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:46,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360319475] [2019-11-23 23:30:46,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:46,357 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-23 23:30:46,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360319475] [2019-11-23 23:30:46,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:46,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:46,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003359155] [2019-11-23 23:30:46,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:46,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:46,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:46,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:46,363 INFO L87 Difference]: Start difference. First operand 642 states and 966 transitions. Second operand 4 states. [2019-11-23 23:30:46,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:46,956 INFO L93 Difference]: Finished difference Result 1567 states and 2365 transitions. [2019-11-23 23:30:46,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:46,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-11-23 23:30:46,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:46,963 INFO L225 Difference]: With dead ends: 1567 [2019-11-23 23:30:46,963 INFO L226 Difference]: Without dead ends: 997 [2019-11-23 23:30:46,965 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-23 23:30:46,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-11-23 23:30:46,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 784. [2019-11-23 23:30:46,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-11-23 23:30:46,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1138 transitions. [2019-11-23 23:30:46,988 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1138 transitions. Word has length 145 [2019-11-23 23:30:46,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:46,989 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1138 transitions. [2019-11-23 23:30:46,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:46,989 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1138 transitions. [2019-11-23 23:30:46,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-23 23:30:46,991 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:46,992 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:46,992 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:46,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:46,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1683939301, now seen corresponding path program 1 times [2019-11-23 23:30:46,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:46,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894827010] [2019-11-23 23:30:47,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:47,195 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-23 23:30:47,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894827010] [2019-11-23 23:30:47,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:47,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 23:30:47,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820415784] [2019-11-23 23:30:47,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 23:30:47,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:47,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 23:30:47,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:30:47,198 INFO L87 Difference]: Start difference. First operand 784 states and 1138 transitions. Second operand 8 states. [2019-11-23 23:30:47,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:47,972 INFO L93 Difference]: Finished difference Result 1742 states and 2534 transitions. [2019-11-23 23:30:47,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 23:30:47,973 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 159 [2019-11-23 23:30:47,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:47,978 INFO L225 Difference]: With dead ends: 1742 [2019-11-23 23:30:47,978 INFO L226 Difference]: Without dead ends: 1030 [2019-11-23 23:30:47,980 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:30:47,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2019-11-23 23:30:48,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 926. [2019-11-23 23:30:48,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-23 23:30:48,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1316 transitions. [2019-11-23 23:30:48,004 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1316 transitions. Word has length 159 [2019-11-23 23:30:48,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:48,005 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1316 transitions. [2019-11-23 23:30:48,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 23:30:48,005 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1316 transitions. [2019-11-23 23:30:48,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-23 23:30:48,008 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:48,009 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:48,009 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:48,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:48,009 INFO L82 PathProgramCache]: Analyzing trace with hash 311594646, now seen corresponding path program 1 times [2019-11-23 23:30:48,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:48,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129013254] [2019-11-23 23:30:48,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:48,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:48,094 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-23 23:30:48,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129013254] [2019-11-23 23:30:48,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:48,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:30:48,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109053907] [2019-11-23 23:30:48,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:48,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:48,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:48,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:48,097 INFO L87 Difference]: Start difference. First operand 926 states and 1316 transitions. Second operand 4 states. [2019-11-23 23:30:48,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:48,652 INFO L93 Difference]: Finished difference Result 2275 states and 3218 transitions. [2019-11-23 23:30:48,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:48,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-11-23 23:30:48,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:48,653 INFO L225 Difference]: With dead ends: 2275 [2019-11-23 23:30:48,653 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:30:48,656 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:48,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:30:48,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:30:48,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:30:48,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:30:48,657 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 162 [2019-11-23 23:30:48,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:48,657 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:30:48,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:48,657 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:30:48,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:30:48,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:30:48,770 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 42 [2019-11-23 23:30:49,043 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 23:30:49,043 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 23:30:49,043 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 23:30:49,043 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 23:30:49,043 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 23:30:49,043 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 23:30:49,043 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 23:30:49,043 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 23:30:49,044 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 23:30:49,044 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 23:30:49,044 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 23:30:49,044 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 23:30:49,044 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 23:30:49,044 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 23:30:49,044 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 23:30:49,044 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 23:30:49,044 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 23:30:49,044 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= ~a21~0 1))) (or (and (not (= ~a16~0 6)) .cse0) (and .cse0 (= 15 ~a8~0)) (= 13 ~a8~0) (and (= ~a17~0 1) .cse0))) [2019-11-23 23:30:49,045 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 23:30:49,045 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 23:30:49,045 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 23:30:49,045 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 23:30:49,045 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 23:30:49,045 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 23:30:49,045 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 23:30:49,046 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 23:30:49,046 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 23:30:49,046 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 23:30:49,046 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 23:30:49,046 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 23:30:49,047 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 23:30:49,047 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 23:30:49,047 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 23:30:49,047 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 23:30:49,047 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:30:49,047 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 23:30:49,047 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 23:30:49,047 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 23:30:49,048 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 23:30:49,048 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 23:30:49,048 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 23:30:49,048 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (= ~a21~0 1))) (or (and (not (= ~a16~0 6)) .cse0) (and .cse0 (= 15 ~a8~0)) (= 13 ~a8~0) (and (= ~a17~0 1) .cse0))) [2019-11-23 23:30:49,048 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 23:30:49,048 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 23:30:49,048 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 23:30:49,048 INFO L444 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:30:49,048 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 23:30:49,049 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:30:49,049 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 23:30:49,049 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 23:30:49,049 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 23:30:49,049 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 23:30:49,049 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 23:30:49,049 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 23:30:49,049 INFO L444 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:30:49,049 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 23:30:49,050 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 23:30:49,050 INFO L444 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-23 23:30:49,050 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 23:30:49,050 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 23:30:49,050 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 23:30:49,050 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 23:30:49,050 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 23:30:49,050 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 23:30:49,051 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 23:30:49,051 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 23:30:49,051 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 23:30:49,051 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 23:30:49,051 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 557) no Hoare annotation was computed. [2019-11-23 23:30:49,051 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 23:30:49,051 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 23:30:49,051 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 23:30:49,052 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 23:30:49,052 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 23:30:49,052 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 23:30:49,052 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 23:30:49,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:30:49 BoogieIcfgContainer [2019-11-23 23:30:49,072 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:30:49,074 INFO L168 Benchmark]: Toolchain (without parser) took 10055.53 ms. Allocated memory was 141.0 MB in the beginning and 362.8 MB in the end (delta: 221.8 MB). Free memory was 104.3 MB in the beginning and 186.2 MB in the end (delta: -81.9 MB). Peak memory consumption was 139.9 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:49,075 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 141.0 MB. Free memory was 124.2 MB in the beginning and 124.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 23:30:49,076 INFO L168 Benchmark]: CACSL2BoogieTranslator took 766.34 ms. Allocated memory was 141.0 MB in the beginning and 204.5 MB in the end (delta: 63.4 MB). Free memory was 104.1 MB in the beginning and 165.1 MB in the end (delta: -61.0 MB). Peak memory consumption was 30.3 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:49,077 INFO L168 Benchmark]: Boogie Procedure Inliner took 147.98 ms. Allocated memory is still 204.5 MB. Free memory was 165.1 MB in the beginning and 159.2 MB in the end (delta: 5.9 MB). Peak memory consumption was 5.9 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:49,077 INFO L168 Benchmark]: Boogie Preprocessor took 69.40 ms. Allocated memory is still 204.5 MB. Free memory was 159.2 MB in the beginning and 154.5 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:49,078 INFO L168 Benchmark]: RCFGBuilder took 2141.96 ms. Allocated memory was 204.5 MB in the beginning and 245.4 MB in the end (delta: 40.9 MB). Free memory was 154.5 MB in the beginning and 182.8 MB in the end (delta: -28.3 MB). Peak memory consumption was 102.3 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:49,079 INFO L168 Benchmark]: TraceAbstraction took 6923.78 ms. Allocated memory was 245.4 MB in the beginning and 362.8 MB in the end (delta: 117.4 MB). Free memory was 182.8 MB in the beginning and 186.2 MB in the end (delta: -3.4 MB). Peak memory consumption was 114.0 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:49,084 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.24 ms. Allocated memory is still 141.0 MB. Free memory was 124.2 MB in the beginning and 124.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 766.34 ms. Allocated memory was 141.0 MB in the beginning and 204.5 MB in the end (delta: 63.4 MB). Free memory was 104.1 MB in the beginning and 165.1 MB in the end (delta: -61.0 MB). Peak memory consumption was 30.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 147.98 ms. Allocated memory is still 204.5 MB. Free memory was 165.1 MB in the beginning and 159.2 MB in the end (delta: 5.9 MB). Peak memory consumption was 5.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 69.40 ms. Allocated memory is still 204.5 MB. Free memory was 159.2 MB in the beginning and 154.5 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2141.96 ms. Allocated memory was 204.5 MB in the beginning and 245.4 MB in the end (delta: 40.9 MB). Free memory was 154.5 MB in the beginning and 182.8 MB in the end (delta: -28.3 MB). Peak memory consumption was 102.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6923.78 ms. Allocated memory was 245.4 MB in the beginning and 362.8 MB in the end (delta: 117.4 MB). Free memory was 182.8 MB in the beginning and 186.2 MB in the end (delta: -3.4 MB). Peak memory consumption was 114.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 557]: 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: 30]: Loop Invariant Derived loop invariant: (((!(a16 == 6) && a21 == 1) || (a21 == 1 && 15 == a8)) || 13 == a8) || (a17 == 1 && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((!(a16 == 6) && a21 == 1) || (a21 == 1 && 15 == a8)) || 13 == a8) || (a17 == 1 && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 6.8s, OverallIterations: 8, TraceHistogramMax: 6, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 420 SDtfs, 1063 SDslu, 77 SDs, 0 SdLazy, 2803 SolverSat, 773 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=926occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 618 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 46 NumberOfFragments, 53 HoareAnnotationTreeSize, 3 FomulaSimplifications, 10357 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 254 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 984 NumberOfCodeBlocks, 984 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 976 ConstructedInterpolants, 0 QuantifiedInterpolants, 276883 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 875/875 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...