/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_label07.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:29:50,898 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:29:50,901 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:29:50,913 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:29:50,913 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:29:50,914 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:29:50,915 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:29:50,917 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:29:50,919 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:29:50,919 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:29:50,920 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:29:50,922 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:29:50,922 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:29:50,923 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:29:50,924 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:29:50,925 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:29:50,926 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:29:50,927 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:29:50,928 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:29:50,930 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:29:50,932 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:29:50,933 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:29:50,934 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:29:50,935 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:29:50,937 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:29:50,937 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:29:50,937 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:29:50,938 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:29:50,939 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:29:50,939 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:29:50,940 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:29:50,940 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:29:50,941 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:29:50,942 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:29:50,943 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:29:50,943 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:29:50,944 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:29:50,944 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:29:50,944 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:29:50,945 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:29:50,946 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:29:50,946 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:29:50,968 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:29:50,969 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:29:50,970 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:29:50,970 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:29:50,970 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:29:50,970 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:29:50,970 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:29:50,971 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:29:50,971 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:29:50,971 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:29:50,972 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:29:50,972 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:29:50,972 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:29:50,973 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:29:50,973 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:29:50,974 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:29:50,975 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:29:50,975 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:29:50,975 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:29:50,975 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:29:50,976 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:29:50,976 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:29:50,976 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:29:50,976 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:29:50,976 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:29:50,977 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:29:50,977 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:29:50,977 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:29:50,978 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:29:50,978 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:29:50,978 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:29:50,979 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:29:50,979 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:29:50,979 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:29:50,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:29:50,980 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:29:50,980 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:29:50,980 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:29:51,268 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:29:51,290 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:29:51,293 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:29:51,295 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:29:51,295 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:29:51,296 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label07.c [2019-11-23 23:29:51,375 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c32dcd513/32e372a1df094fd78d72710143f1a1e7/FLAGb3fc155d8 [2019-11-23 23:29:51,894 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:29:51,894 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label07.c [2019-11-23 23:29:51,909 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c32dcd513/32e372a1df094fd78d72710143f1a1e7/FLAGb3fc155d8 [2019-11-23 23:29:52,215 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c32dcd513/32e372a1df094fd78d72710143f1a1e7 [2019-11-23 23:29:52,225 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:29:52,227 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:29:52,228 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:29:52,228 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:29:52,232 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:29:52,233 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:29:52" (1/1) ... [2019-11-23 23:29:52,235 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c9ac29d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:52, skipping insertion in model container [2019-11-23 23:29:52,236 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:29:52" (1/1) ... [2019-11-23 23:29:52,243 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:29:52,313 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:29:52,964 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:29:52,971 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:29:53,092 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:29:53,109 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:29:53,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:53 WrapperNode [2019-11-23 23:29:53,110 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:29:53,111 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:29:53,111 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:29:53,111 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:29:53,120 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:29:53" (1/1) ... [2019-11-23 23:29:53,151 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:29:53" (1/1) ... [2019-11-23 23:29:53,235 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:29:53,235 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:29:53,235 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:29:53,235 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:29:53,246 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:53" (1/1) ... [2019-11-23 23:29:53,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:53" (1/1) ... [2019-11-23 23:29:53,252 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:53" (1/1) ... [2019-11-23 23:29:53,252 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:53" (1/1) ... [2019-11-23 23:29:53,283 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:53" (1/1) ... [2019-11-23 23:29:53,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:53" (1/1) ... [2019-11-23 23:29:53,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:53" (1/1) ... [2019-11-23 23:29:53,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:29:53,325 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:29:53,325 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:29:53,325 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:29:53,326 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:53" (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:29:53,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:29:53,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:29:55,238 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:29:55,239 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:29:55,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:29:55 BoogieIcfgContainer [2019-11-23 23:29:55,241 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:29:55,242 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:29:55,242 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:29:55,245 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:29:55,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:29:52" (1/3) ... [2019-11-23 23:29:55,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6468780e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:29:55, skipping insertion in model container [2019-11-23 23:29:55,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:29:53" (2/3) ... [2019-11-23 23:29:55,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6468780e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:29:55, skipping insertion in model container [2019-11-23 23:29:55,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:29:55" (3/3) ... [2019-11-23 23:29:55,249 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label07.c [2019-11-23 23:29:55,259 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:29:55,268 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:29:55,281 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:29:55,311 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:29:55,312 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:29:55,312 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:29:55,312 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:29:55,312 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:29:55,312 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:29:55,313 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:29:55,313 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:29:55,332 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-23 23:29:55,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-23 23:29:55,342 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:55,343 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:29:55,344 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:55,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:55,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1323241503, now seen corresponding path program 1 times [2019-11-23 23:29:55,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:55,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792749094] [2019-11-23 23:29:55,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:55,786 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:29:55,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792749094] [2019-11-23 23:29:55,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:55,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:29:55,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858492807] [2019-11-23 23:29:55,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:29:55,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:55,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:29:55,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:29:55,812 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-11-23 23:29:56,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:56,598 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-11-23 23:29:56,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:29:56,600 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-23 23:29:56,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:56,618 INFO L225 Difference]: With dead ends: 297 [2019-11-23 23:29:56,619 INFO L226 Difference]: Without dead ends: 216 [2019-11-23 23:29:56,623 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:29:56,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-23 23:29:56,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-11-23 23:29:56,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-23 23:29:56,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 378 transitions. [2019-11-23 23:29:56,698 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 378 transitions. Word has length 71 [2019-11-23 23:29:56,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:56,700 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 378 transitions. [2019-11-23 23:29:56,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:29:56,700 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 378 transitions. [2019-11-23 23:29:56,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-23 23:29:56,710 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:56,711 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:29:56,711 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:56,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:56,712 INFO L82 PathProgramCache]: Analyzing trace with hash 585776217, now seen corresponding path program 1 times [2019-11-23 23:29:56,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:56,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974080398] [2019-11-23 23:29:56,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:56,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:56,799 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:29:56,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974080398] [2019-11-23 23:29:56,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:56,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:29:56,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183030358] [2019-11-23 23:29:56,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:29:56,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:56,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:29:56,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:29:56,804 INFO L87 Difference]: Start difference. First operand 216 states and 378 transitions. Second operand 4 states. [2019-11-23 23:29:57,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:57,207 INFO L93 Difference]: Finished difference Result 644 states and 1131 transitions. [2019-11-23 23:29:57,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:29:57,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-23 23:29:57,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:57,216 INFO L225 Difference]: With dead ends: 644 [2019-11-23 23:29:57,216 INFO L226 Difference]: Without dead ends: 429 [2019-11-23 23:29:57,219 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:29:57,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-23 23:29:57,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-11-23 23:29:57,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-23 23:29:57,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 705 transitions. [2019-11-23 23:29:57,262 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 705 transitions. Word has length 76 [2019-11-23 23:29:57,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:57,262 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 705 transitions. [2019-11-23 23:29:57,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:29:57,263 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 705 transitions. [2019-11-23 23:29:57,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-23 23:29:57,265 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:57,266 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:29:57,266 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:57,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:57,266 INFO L82 PathProgramCache]: Analyzing trace with hash 928583523, now seen corresponding path program 1 times [2019-11-23 23:29:57,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:57,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438349703] [2019-11-23 23:29:57,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:57,365 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:29:57,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438349703] [2019-11-23 23:29:57,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:57,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:29:57,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590467662] [2019-11-23 23:29:57,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:29:57,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:57,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:29:57,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:29:57,368 INFO L87 Difference]: Start difference. First operand 429 states and 705 transitions. Second operand 3 states. [2019-11-23 23:29:57,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:57,761 INFO L93 Difference]: Finished difference Result 1070 states and 1785 transitions. [2019-11-23 23:29:57,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:29:57,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-23 23:29:57,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:57,769 INFO L225 Difference]: With dead ends: 1070 [2019-11-23 23:29:57,770 INFO L226 Difference]: Without dead ends: 642 [2019-11-23 23:29:57,772 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:29:57,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-11-23 23:29:57,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 500. [2019-11-23 23:29:57,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-11-23 23:29:57,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 825 transitions. [2019-11-23 23:29:57,798 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 825 transitions. Word has length 97 [2019-11-23 23:29:57,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:57,799 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 825 transitions. [2019-11-23 23:29:57,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:29:57,799 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 825 transitions. [2019-11-23 23:29:57,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-23 23:29:57,801 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:57,801 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:29:57,801 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:57,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:57,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1330800762, now seen corresponding path program 1 times [2019-11-23 23:29:57,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:57,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786533003] [2019-11-23 23:29:57,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:57,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:57,885 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:29:57,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786533003] [2019-11-23 23:29:57,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:57,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:29:57,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456992476] [2019-11-23 23:29:57,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:29:57,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:57,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:29:57,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:29:57,887 INFO L87 Difference]: Start difference. First operand 500 states and 825 transitions. Second operand 3 states. [2019-11-23 23:29:58,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:58,259 INFO L93 Difference]: Finished difference Result 1212 states and 1976 transitions. [2019-11-23 23:29:58,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:29:58,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-11-23 23:29:58,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:58,263 INFO L225 Difference]: With dead ends: 1212 [2019-11-23 23:29:58,263 INFO L226 Difference]: Without dead ends: 713 [2019-11-23 23:29:58,264 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:29:58,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-11-23 23:29:58,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 642. [2019-11-23 23:29:58,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-11-23 23:29:58,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 985 transitions. [2019-11-23 23:29:58,283 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 985 transitions. Word has length 133 [2019-11-23 23:29:58,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:58,284 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 985 transitions. [2019-11-23 23:29:58,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:29:58,284 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 985 transitions. [2019-11-23 23:29:58,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-23 23:29:58,286 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:58,286 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:29:58,287 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:58,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:58,287 INFO L82 PathProgramCache]: Analyzing trace with hash -573618406, now seen corresponding path program 1 times [2019-11-23 23:29:58,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:58,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388573734] [2019-11-23 23:29:58,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:58,414 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:29:58,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388573734] [2019-11-23 23:29:58,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:58,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:29:58,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67153658] [2019-11-23 23:29:58,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:29:58,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:58,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:29:58,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:29:58,417 INFO L87 Difference]: Start difference. First operand 642 states and 985 transitions. Second operand 4 states. [2019-11-23 23:29:58,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:58,950 INFO L93 Difference]: Finished difference Result 1371 states and 2075 transitions. [2019-11-23 23:29:58,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:29:58,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-11-23 23:29:58,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:58,955 INFO L225 Difference]: With dead ends: 1371 [2019-11-23 23:29:58,956 INFO L226 Difference]: Without dead ends: 730 [2019-11-23 23:29:58,957 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:29:58,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-11-23 23:29:58,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 713. [2019-11-23 23:29:58,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-11-23 23:29:58,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1062 transitions. [2019-11-23 23:29:58,977 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1062 transitions. Word has length 141 [2019-11-23 23:29:58,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:58,977 INFO L462 AbstractCegarLoop]: Abstraction has 713 states and 1062 transitions. [2019-11-23 23:29:58,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:29:58,977 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1062 transitions. [2019-11-23 23:29:58,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-23 23:29:58,979 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:58,980 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:29:58,980 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:58,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:58,980 INFO L82 PathProgramCache]: Analyzing trace with hash 925205330, now seen corresponding path program 1 times [2019-11-23 23:29:58,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:58,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454730790] [2019-11-23 23:29:58,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:58,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:59,048 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:29:59,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454730790] [2019-11-23 23:29:59,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:59,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:29:59,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497060139] [2019-11-23 23:29:59,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:29:59,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:59,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:29:59,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:29:59,050 INFO L87 Difference]: Start difference. First operand 713 states and 1062 transitions. Second operand 4 states. [2019-11-23 23:29:59,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:29:59,638 INFO L93 Difference]: Finished difference Result 1638 states and 2462 transitions. [2019-11-23 23:29:59,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:29:59,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-11-23 23:29:59,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:29:59,645 INFO L225 Difference]: With dead ends: 1638 [2019-11-23 23:29:59,645 INFO L226 Difference]: Without dead ends: 997 [2019-11-23 23:29:59,646 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:29:59,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-11-23 23:29:59,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 784. [2019-11-23 23:29:59,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-11-23 23:29:59,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1138 transitions. [2019-11-23 23:29:59,664 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1138 transitions. Word has length 145 [2019-11-23 23:29:59,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:29:59,665 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1138 transitions. [2019-11-23 23:29:59,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:29:59,665 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1138 transitions. [2019-11-23 23:29:59,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-23 23:29:59,668 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:29:59,668 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:29:59,668 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:29:59,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:29:59,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1683950955, now seen corresponding path program 1 times [2019-11-23 23:29:59,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:29:59,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251886694] [2019-11-23 23:29:59,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:29:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:29:59,839 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:29:59,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251886694] [2019-11-23 23:29:59,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:29:59,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 23:29:59,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561872525] [2019-11-23 23:29:59,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 23:29:59,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:29:59,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 23:29:59,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:29:59,841 INFO L87 Difference]: Start difference. First operand 784 states and 1138 transitions. Second operand 8 states. [2019-11-23 23:30:00,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:00,565 INFO L93 Difference]: Finished difference Result 1742 states and 2534 transitions. [2019-11-23 23:30:00,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 23:30:00,566 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 159 [2019-11-23 23:30:00,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:00,573 INFO L225 Difference]: With dead ends: 1742 [2019-11-23 23:30:00,573 INFO L226 Difference]: Without dead ends: 1030 [2019-11-23 23:30:00,575 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:00,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2019-11-23 23:30:00,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 926. [2019-11-23 23:30:00,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-23 23:30:00,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1316 transitions. [2019-11-23 23:30:00,637 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1316 transitions. Word has length 159 [2019-11-23 23:30:00,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:00,639 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1316 transitions. [2019-11-23 23:30:00,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 23:30:00,639 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1316 transitions. [2019-11-23 23:30:00,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-23 23:30:00,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:00,643 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:00,644 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:00,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:00,644 INFO L82 PathProgramCache]: Analyzing trace with hash 311582992, now seen corresponding path program 1 times [2019-11-23 23:30:00,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:00,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588178352] [2019-11-23 23:30:00,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:00,765 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:00,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588178352] [2019-11-23 23:30:00,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:00,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:30:00,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107935678] [2019-11-23 23:30:00,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:00,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:00,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:00,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:00,767 INFO L87 Difference]: Start difference. First operand 926 states and 1316 transitions. Second operand 4 states. [2019-11-23 23:30:01,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:01,280 INFO L93 Difference]: Finished difference Result 2277 states and 3219 transitions. [2019-11-23 23:30:01,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:01,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-11-23 23:30:01,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:01,286 INFO L225 Difference]: With dead ends: 2277 [2019-11-23 23:30:01,286 INFO L226 Difference]: Without dead ends: 1068 [2019-11-23 23:30:01,289 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:01,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-11-23 23:30:01,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 926. [2019-11-23 23:30:01,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-23 23:30:01,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1072 transitions. [2019-11-23 23:30:01,314 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1072 transitions. Word has length 162 [2019-11-23 23:30:01,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:01,315 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1072 transitions. [2019-11-23 23:30:01,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:01,316 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1072 transitions. [2019-11-23 23:30:01,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-23 23:30:01,319 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:01,320 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-11-23 23:30:01,320 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:01,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:01,320 INFO L82 PathProgramCache]: Analyzing trace with hash -114230139, now seen corresponding path program 1 times [2019-11-23 23:30:01,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:01,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732634481] [2019-11-23 23:30:01,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:01,513 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 205 proven. 27 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-23 23:30:01,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732634481] [2019-11-23 23:30:01,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644524370] [2019-11-23 23:30:01,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:30:01,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:01,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 23:30:01,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 23:30:01,755 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-23 23:30:01,756 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-23 23:30:01,815 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-23 23:30:01,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-23 23:30:01,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-11-23 23:30:01,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633269318] [2019-11-23 23:30:01,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:01,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:01,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:01,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:30:01,817 INFO L87 Difference]: Start difference. First operand 926 states and 1072 transitions. Second operand 3 states. [2019-11-23 23:30:02,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:02,062 INFO L93 Difference]: Finished difference Result 926 states and 1072 transitions. [2019-11-23 23:30:02,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:02,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-11-23 23:30:02,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:02,064 INFO L225 Difference]: With dead ends: 926 [2019-11-23 23:30:02,064 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:30:02,065 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 382 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 23:30:02,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:30:02,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:30:02,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:30:02,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:30:02,067 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 192 [2019-11-23 23:30:02,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:02,068 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:30:02,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:02,068 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:30:02,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:30:02,274 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 23:30:02,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:30:02,634 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2019-11-23 23:30:02,638 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 23:30:02,638 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 23:30:02,638 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 23:30:02,639 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 23:30:02,639 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 23:30:02,639 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 23:30:02,639 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 23:30:02,639 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 23:30:02,639 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 23:30:02,639 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 23:30:02,640 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 23:30:02,640 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 23:30:02,640 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 23:30:02,640 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 23:30:02,640 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 23:30:02,640 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 23:30:02,640 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 23:30:02,641 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= ~a21~0 1))) (or (and (<= ~a21~0 0) (= 13 ~a8~0)) (and (not (= ~a16~0 6)) .cse0) (and .cse0 (= 15 ~a8~0)) (and (= ~a17~0 1) .cse0 (= ~a20~0 1)))) [2019-11-23 23:30:02,641 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 23:30:02,641 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 23:30:02,641 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 23:30:02,641 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 23:30:02,642 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 23:30:02,643 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 23:30:02,643 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 23:30:02,643 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 23:30:02,643 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 23:30:02,643 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 23:30:02,643 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 23:30:02,643 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 23:30:02,644 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 23:30:02,644 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 23:30:02,644 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 23:30:02,644 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 23:30:02,644 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:30:02,644 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 23:30:02,644 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 23:30:02,645 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 23:30:02,645 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 23:30:02,645 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 23:30:02,645 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 23:30:02,645 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (= ~a21~0 1))) (or (and (<= ~a21~0 0) (= 13 ~a8~0)) (and (not (= ~a16~0 6)) .cse0) (and .cse0 (= 15 ~a8~0)) (and (= ~a17~0 1) .cse0 (= ~a20~0 1)))) [2019-11-23 23:30:02,645 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:30:02,646 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 23:30:02,646 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 23:30:02,646 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 23:30:02,646 INFO L444 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:30:02,646 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 23:30:02,646 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:30:02,646 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 23:30:02,647 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 23:30:02,647 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 23:30:02,647 INFO L444 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-23 23:30:02,647 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 23:30:02,647 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 23:30:02,647 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 23:30:02,647 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 23:30:02,648 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 23:30:02,648 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 23:30:02,648 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 23:30:02,648 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 23:30:02,648 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 23:30:02,648 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 23:30:02,648 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 23:30:02,648 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 23:30:02,649 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 23:30:02,649 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 23:30:02,649 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 23:30:02,649 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 488) no Hoare annotation was computed. [2019-11-23 23:30:02,649 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 23:30:02,649 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 23:30:02,649 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 23:30:02,649 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 23:30:02,652 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 23:30:02,652 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 23:30:02,652 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 23:30:02,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:30:02 BoogieIcfgContainer [2019-11-23 23:30:02,672 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:30:02,674 INFO L168 Benchmark]: Toolchain (without parser) took 10447.13 ms. Allocated memory was 135.8 MB in the beginning and 375.9 MB in the end (delta: 240.1 MB). Free memory was 98.9 MB in the beginning and 328.7 MB in the end (delta: -229.8 MB). Peak memory consumption was 261.4 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:02,675 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 135.8 MB. Free memory was 119.0 MB in the beginning and 118.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-11-23 23:30:02,676 INFO L168 Benchmark]: CACSL2BoogieTranslator took 882.29 ms. Allocated memory was 135.8 MB in the beginning and 203.9 MB in the end (delta: 68.2 MB). Free memory was 98.7 MB in the beginning and 166.0 MB in the end (delta: -67.3 MB). Peak memory consumption was 30.1 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:02,677 INFO L168 Benchmark]: Boogie Procedure Inliner took 123.90 ms. Allocated memory is still 203.9 MB. Free memory was 166.0 MB in the beginning and 160.1 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:02,678 INFO L168 Benchmark]: Boogie Preprocessor took 89.84 ms. Allocated memory is still 203.9 MB. Free memory was 160.1 MB in the beginning and 155.7 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:02,679 INFO L168 Benchmark]: RCFGBuilder took 1915.57 ms. Allocated memory was 203.9 MB in the beginning and 253.2 MB in the end (delta: 49.3 MB). Free memory was 155.7 MB in the beginning and 207.7 MB in the end (delta: -52.0 MB). Peak memory consumption was 111.2 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:02,680 INFO L168 Benchmark]: TraceAbstraction took 7430.65 ms. Allocated memory was 253.2 MB in the beginning and 375.9 MB in the end (delta: 122.7 MB). Free memory was 207.7 MB in the beginning and 328.7 MB in the end (delta: -121.1 MB). Peak memory consumption was 252.7 MB. Max. memory is 7.1 GB. [2019-11-23 23:30:02,685 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.20 ms. Allocated memory is still 135.8 MB. Free memory was 119.0 MB in the beginning and 118.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 882.29 ms. Allocated memory was 135.8 MB in the beginning and 203.9 MB in the end (delta: 68.2 MB). Free memory was 98.7 MB in the beginning and 166.0 MB in the end (delta: -67.3 MB). Peak memory consumption was 30.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 123.90 ms. Allocated memory is still 203.9 MB. Free memory was 166.0 MB in the beginning and 160.1 MB in the end (delta: 5.9 MB). Peak memory consumption was 5.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 89.84 ms. Allocated memory is still 203.9 MB. Free memory was 160.1 MB in the beginning and 155.7 MB in the end (delta: 4.4 MB). Peak memory consumption was 4.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1915.57 ms. Allocated memory was 203.9 MB in the beginning and 253.2 MB in the end (delta: 49.3 MB). Free memory was 155.7 MB in the beginning and 207.7 MB in the end (delta: -52.0 MB). Peak memory consumption was 111.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7430.65 ms. Allocated memory was 253.2 MB in the beginning and 375.9 MB in the end (delta: 122.7 MB). Free memory was 207.7 MB in the beginning and 328.7 MB in the end (delta: -121.1 MB). Peak memory consumption was 252.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 488]: 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: (((a21 <= 0 && 13 == a8) || (!(a16 == 6) && a21 == 1)) || (a21 == 1 && 15 == a8)) || ((a17 == 1 && a21 == 1) && a20 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((a21 <= 0 && 13 == a8) || (!(a16 == 6) && a21 == 1)) || (a21 == 1 && 15 == a8)) || ((a17 == 1 && a21 == 1) && a20 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 7.3s, OverallIterations: 9, TraceHistogramMax: 6, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 519 SDtfs, 1137 SDslu, 80 SDs, 0 SdLazy, 2986 SolverSat, 744 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 419 GetRequests, 391 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s 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, 9 MinimizatonAttempts, 689 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 42 NumberOfFragments, 67 HoareAnnotationTreeSize, 3 FomulaSimplifications, 8683 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 582 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1368 NumberOfCodeBlocks, 1368 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1549 ConstructedInterpolants, 0 QuantifiedInterpolants, 536643 SizeOfPredicates, 1 NumberOfNonLiveVariables, 425 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 1736/1763 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...