java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label12_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-0fd1304 [2018-10-23 18:50:05,770 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 18:50:05,772 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 18:50:05,785 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 18:50:05,786 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 18:50:05,787 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 18:50:05,788 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 18:50:05,790 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 18:50:05,791 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 18:50:05,792 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 18:50:05,793 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 18:50:05,794 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 18:50:05,794 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 18:50:05,796 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 18:50:05,799 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 18:50:05,800 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 18:50:05,801 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 18:50:05,805 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 18:50:05,813 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 18:50:05,815 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 18:50:05,816 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 18:50:05,817 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 18:50:05,820 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 18:50:05,820 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 18:50:05,820 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 18:50:05,821 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 18:50:05,822 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 18:50:05,823 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 18:50:05,824 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 18:50:05,825 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 18:50:05,825 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 18:50:05,826 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 18:50:05,826 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 18:50:05,826 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 18:50:05,827 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 18:50:05,828 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 18:50:05,828 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-23 18:50:05,855 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 18:50:05,856 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 18:50:05,857 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 18:50:05,858 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-23 18:50:05,859 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-23 18:50:05,859 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-23 18:50:05,859 INFO L133 SettingsManager]: * Use SBE=true [2018-10-23 18:50:05,859 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 18:50:05,859 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 18:50:05,860 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 18:50:05,860 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 18:50:05,860 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 18:50:05,860 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 18:50:05,860 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 18:50:05,861 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 18:50:05,862 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 18:50:05,862 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 18:50:05,862 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 18:50:05,863 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 18:50:05,863 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 18:50:05,863 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 18:50:05,863 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 18:50:05,863 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 18:50:05,864 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-23 18:50:05,865 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 18:50:05,865 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 18:50:05,865 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 18:50:05,865 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 18:50:05,931 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 18:50:05,944 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 18:50:05,947 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 18:50:05,949 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 18:50:05,949 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 18:50:05,950 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label12_true-unreach-call.c [2018-10-23 18:50:06,010 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0016d8cfa/ce953d100cad4425887498794d785426/FLAG57aa1d70e [2018-10-23 18:50:06,696 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 18:50:06,698 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label12_true-unreach-call.c [2018-10-23 18:50:06,719 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0016d8cfa/ce953d100cad4425887498794d785426/FLAG57aa1d70e [2018-10-23 18:50:06,740 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0016d8cfa/ce953d100cad4425887498794d785426 [2018-10-23 18:50:06,752 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 18:50:06,754 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 18:50:06,756 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 18:50:06,756 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 18:50:06,760 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 18:50:06,761 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:50:06" (1/1) ... [2018-10-23 18:50:06,765 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@619cc6bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:50:06, skipping insertion in model container [2018-10-23 18:50:06,765 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:50:06" (1/1) ... [2018-10-23 18:50:06,776 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 18:50:06,866 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 18:50:07,632 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 18:50:07,637 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 18:50:07,878 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 18:50:07,931 INFO L193 MainTranslator]: Completed translation [2018-10-23 18:50:07,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:50:07 WrapperNode [2018-10-23 18:50:07,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 18:50:07,936 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 18:50:07,936 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 18:50:07,936 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 18:50:07,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:50:07" (1/1) ... [2018-10-23 18:50:08,001 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:50:07" (1/1) ... [2018-10-23 18:50:08,266 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 18:50:08,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 18:50:08,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 18:50:08,267 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 18:50:08,278 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:50:07" (1/1) ... [2018-10-23 18:50:08,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:50:07" (1/1) ... [2018-10-23 18:50:08,286 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:50:07" (1/1) ... [2018-10-23 18:50:08,286 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:50:07" (1/1) ... [2018-10-23 18:50:08,331 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:50:07" (1/1) ... [2018-10-23 18:50:08,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:50:07" (1/1) ... [2018-10-23 18:50:08,377 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:50:07" (1/1) ... [2018-10-23 18:50:08,391 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 18:50:08,392 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 18:50:08,392 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 18:50:08,392 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 18:50:08,393 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:50:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-23 18:50:08,471 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-23 18:50:08,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 18:50:08,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 18:50:14,305 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 18:50:14,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:50:14 BoogieIcfgContainer [2018-10-23 18:50:14,306 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 18:50:14,307 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 18:50:14,307 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 18:50:14,311 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 18:50:14,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 06:50:06" (1/3) ... [2018-10-23 18:50:14,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c9b7d52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:50:14, skipping insertion in model container [2018-10-23 18:50:14,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:50:07" (2/3) ... [2018-10-23 18:50:14,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c9b7d52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:50:14, skipping insertion in model container [2018-10-23 18:50:14,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:50:14" (3/3) ... [2018-10-23 18:50:14,315 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label12_true-unreach-call.c [2018-10-23 18:50:14,325 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 18:50:14,334 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-23 18:50:14,352 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-23 18:50:14,387 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-23 18:50:14,388 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 18:50:14,388 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 18:50:14,389 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 18:50:14,389 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 18:50:14,389 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 18:50:14,389 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 18:50:14,389 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 18:50:14,390 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 18:50:14,416 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-23 18:50:14,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-23 18:50:14,441 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:14,442 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:14,445 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:14,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:14,450 INFO L82 PathProgramCache]: Analyzing trace with hash -2121673340, now seen corresponding path program 1 times [2018-10-23 18:50:14,452 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:14,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:14,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:14,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:14,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:15,290 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-23 18:50:15,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:50:15,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:15,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:15,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:50:15,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:50:15,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:15,405 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-23 18:50:18,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:18,772 INFO L93 Difference]: Finished difference Result 1072 states and 1917 transitions. [2018-10-23 18:50:18,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:50:18,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2018-10-23 18:50:18,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:18,798 INFO L225 Difference]: With dead ends: 1072 [2018-10-23 18:50:18,799 INFO L226 Difference]: Without dead ends: 762 [2018-10-23 18:50:18,804 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:18,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2018-10-23 18:50:18,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 518. [2018-10-23 18:50:18,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-10-23 18:50:18,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 855 transitions. [2018-10-23 18:50:18,885 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 855 transitions. Word has length 164 [2018-10-23 18:50:18,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:18,886 INFO L481 AbstractCegarLoop]: Abstraction has 518 states and 855 transitions. [2018-10-23 18:50:18,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:50:18,887 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 855 transitions. [2018-10-23 18:50:18,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-23 18:50:18,892 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:18,893 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:18,893 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:18,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:18,895 INFO L82 PathProgramCache]: Analyzing trace with hash -252847883, now seen corresponding path program 1 times [2018-10-23 18:50:18,895 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:18,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:18,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:18,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:18,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:18,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:19,241 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:50:19,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:19,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:19,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:50:19,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:50:19,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:19,245 INFO L87 Difference]: Start difference. First operand 518 states and 855 transitions. Second operand 4 states. [2018-10-23 18:50:22,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:22,342 INFO L93 Difference]: Finished difference Result 1918 states and 3253 transitions. [2018-10-23 18:50:22,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:50:22,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2018-10-23 18:50:22,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:22,352 INFO L225 Difference]: With dead ends: 1918 [2018-10-23 18:50:22,352 INFO L226 Difference]: Without dead ends: 1402 [2018-10-23 18:50:22,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:22,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2018-10-23 18:50:22,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 933. [2018-10-23 18:50:22,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-10-23 18:50:22,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1472 transitions. [2018-10-23 18:50:22,404 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1472 transitions. Word has length 170 [2018-10-23 18:50:22,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:22,405 INFO L481 AbstractCegarLoop]: Abstraction has 933 states and 1472 transitions. [2018-10-23 18:50:22,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:50:22,405 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1472 transitions. [2018-10-23 18:50:22,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-23 18:50:22,411 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:22,411 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:22,412 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:22,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:22,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1895862531, now seen corresponding path program 1 times [2018-10-23 18:50:22,412 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:22,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:22,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:22,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:22,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:22,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:22,528 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:50:22,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:22,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:50:22,529 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:22,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:22,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:22,530 INFO L87 Difference]: Start difference. First operand 933 states and 1472 transitions. Second operand 3 states. [2018-10-23 18:50:24,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:24,927 INFO L93 Difference]: Finished difference Result 2699 states and 4315 transitions. [2018-10-23 18:50:24,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:24,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2018-10-23 18:50:24,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:24,937 INFO L225 Difference]: With dead ends: 2699 [2018-10-23 18:50:24,938 INFO L226 Difference]: Without dead ends: 1768 [2018-10-23 18:50:24,940 INFO L605 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 [2018-10-23 18:50:24,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2018-10-23 18:50:24,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1751. [2018-10-23 18:50:24,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1751 states. [2018-10-23 18:50:24,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1751 states and 2699 transitions. [2018-10-23 18:50:24,996 INFO L78 Accepts]: Start accepts. Automaton has 1751 states and 2699 transitions. Word has length 173 [2018-10-23 18:50:24,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:24,996 INFO L481 AbstractCegarLoop]: Abstraction has 1751 states and 2699 transitions. [2018-10-23 18:50:24,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:24,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2699 transitions. [2018-10-23 18:50:25,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-23 18:50:25,005 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:25,005 INFO L375 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:25,005 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:25,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:25,007 INFO L82 PathProgramCache]: Analyzing trace with hash 407532060, now seen corresponding path program 1 times [2018-10-23 18:50:25,008 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:25,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:25,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:25,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:25,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:25,254 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:50:25,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:25,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:25,255 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:50:25,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:50:25,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:25,256 INFO L87 Difference]: Start difference. First operand 1751 states and 2699 transitions. Second operand 4 states. [2018-10-23 18:50:28,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:28,506 INFO L93 Difference]: Finished difference Result 6814 states and 10581 transitions. [2018-10-23 18:50:28,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:50:28,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2018-10-23 18:50:28,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:28,533 INFO L225 Difference]: With dead ends: 6814 [2018-10-23 18:50:28,534 INFO L226 Difference]: Without dead ends: 5065 [2018-10-23 18:50:28,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:28,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5065 states. [2018-10-23 18:50:28,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5065 to 3388. [2018-10-23 18:50:28,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3388 states. [2018-10-23 18:50:28,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 3388 states and 4947 transitions. [2018-10-23 18:50:28,617 INFO L78 Accepts]: Start accepts. Automaton has 3388 states and 4947 transitions. Word has length 180 [2018-10-23 18:50:28,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:28,618 INFO L481 AbstractCegarLoop]: Abstraction has 3388 states and 4947 transitions. [2018-10-23 18:50:28,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:50:28,618 INFO L276 IsEmpty]: Start isEmpty. Operand 3388 states and 4947 transitions. [2018-10-23 18:50:28,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-23 18:50:28,625 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:28,626 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:28,626 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:28,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:28,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1147609385, now seen corresponding path program 1 times [2018-10-23 18:50:28,627 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:28,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:28,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:28,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:28,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:28,887 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:50:28,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:28,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:28,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:28,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:28,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:28,889 INFO L87 Difference]: Start difference. First operand 3388 states and 4947 transitions. Second operand 3 states. [2018-10-23 18:50:29,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:29,933 INFO L93 Difference]: Finished difference Result 6782 states and 9907 transitions. [2018-10-23 18:50:29,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:29,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2018-10-23 18:50:29,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:29,951 INFO L225 Difference]: With dead ends: 6782 [2018-10-23 18:50:29,951 INFO L226 Difference]: Without dead ends: 3396 [2018-10-23 18:50:29,956 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:29,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3396 states. [2018-10-23 18:50:30,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3396 to 3388. [2018-10-23 18:50:30,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3388 states. [2018-10-23 18:50:30,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 3388 states and 4647 transitions. [2018-10-23 18:50:30,017 INFO L78 Accepts]: Start accepts. Automaton has 3388 states and 4647 transitions. Word has length 181 [2018-10-23 18:50:30,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:30,018 INFO L481 AbstractCegarLoop]: Abstraction has 3388 states and 4647 transitions. [2018-10-23 18:50:30,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:30,018 INFO L276 IsEmpty]: Start isEmpty. Operand 3388 states and 4647 transitions. [2018-10-23 18:50:30,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-23 18:50:30,028 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:30,028 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:30,029 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:30,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:30,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1815897247, now seen corresponding path program 1 times [2018-10-23 18:50:30,029 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:30,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:30,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:30,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:30,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:30,203 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:50:30,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:30,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:30,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:30,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:30,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:30,205 INFO L87 Difference]: Start difference. First operand 3388 states and 4647 transitions. Second operand 3 states. [2018-10-23 18:50:31,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:31,689 INFO L93 Difference]: Finished difference Result 10041 states and 13801 transitions. [2018-10-23 18:50:31,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:31,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2018-10-23 18:50:31,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:31,717 INFO L225 Difference]: With dead ends: 10041 [2018-10-23 18:50:31,718 INFO L226 Difference]: Without dead ends: 6655 [2018-10-23 18:50:31,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:31,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6655 states. [2018-10-23 18:50:31,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6655 to 6652. [2018-10-23 18:50:31,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6652 states. [2018-10-23 18:50:31,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6652 states to 6652 states and 8357 transitions. [2018-10-23 18:50:31,845 INFO L78 Accepts]: Start accepts. Automaton has 6652 states and 8357 transitions. Word has length 188 [2018-10-23 18:50:31,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:31,845 INFO L481 AbstractCegarLoop]: Abstraction has 6652 states and 8357 transitions. [2018-10-23 18:50:31,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:31,845 INFO L276 IsEmpty]: Start isEmpty. Operand 6652 states and 8357 transitions. [2018-10-23 18:50:31,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-23 18:50:31,857 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:31,858 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:31,858 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:31,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:31,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1150111061, now seen corresponding path program 1 times [2018-10-23 18:50:31,859 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:31,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:31,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:31,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:31,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:31,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:32,008 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-23 18:50:32,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:32,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:50:32,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:32,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:32,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:32,010 INFO L87 Difference]: Start difference. First operand 6652 states and 8357 transitions. Second operand 3 states. [2018-10-23 18:50:33,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:33,053 INFO L93 Difference]: Finished difference Result 13270 states and 16669 transitions. [2018-10-23 18:50:33,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:33,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2018-10-23 18:50:33,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:33,076 INFO L225 Difference]: With dead ends: 13270 [2018-10-23 18:50:33,076 INFO L226 Difference]: Without dead ends: 6620 [2018-10-23 18:50:33,086 INFO L605 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 [2018-10-23 18:50:33,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6620 states. [2018-10-23 18:50:33,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6620 to 6620. [2018-10-23 18:50:33,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6620 states. [2018-10-23 18:50:33,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6620 states to 6620 states and 8174 transitions. [2018-10-23 18:50:33,219 INFO L78 Accepts]: Start accepts. Automaton has 6620 states and 8174 transitions. Word has length 202 [2018-10-23 18:50:33,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:33,220 INFO L481 AbstractCegarLoop]: Abstraction has 6620 states and 8174 transitions. [2018-10-23 18:50:33,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:33,220 INFO L276 IsEmpty]: Start isEmpty. Operand 6620 states and 8174 transitions. [2018-10-23 18:50:33,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-10-23 18:50:33,234 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:33,235 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:33,235 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:33,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:33,236 INFO L82 PathProgramCache]: Analyzing trace with hash 328527330, now seen corresponding path program 1 times [2018-10-23 18:50:33,236 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:33,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:33,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:33,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:33,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:33,486 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:50:33,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:33,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:33,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:33,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:33,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:33,491 INFO L87 Difference]: Start difference. First operand 6620 states and 8174 transitions. Second operand 3 states. [2018-10-23 18:50:34,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:34,901 INFO L93 Difference]: Finished difference Result 16094 states and 20196 transitions. [2018-10-23 18:50:34,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:34,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2018-10-23 18:50:34,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:34,924 INFO L225 Difference]: With dead ends: 16094 [2018-10-23 18:50:34,925 INFO L226 Difference]: Without dead ends: 9476 [2018-10-23 18:50:34,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:34,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9476 states. [2018-10-23 18:50:35,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9476 to 9476. [2018-10-23 18:50:35,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9476 states. [2018-10-23 18:50:35,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9476 states to 9476 states and 11228 transitions. [2018-10-23 18:50:35,073 INFO L78 Accepts]: Start accepts. Automaton has 9476 states and 11228 transitions. Word has length 213 [2018-10-23 18:50:35,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:35,074 INFO L481 AbstractCegarLoop]: Abstraction has 9476 states and 11228 transitions. [2018-10-23 18:50:35,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:35,074 INFO L276 IsEmpty]: Start isEmpty. Operand 9476 states and 11228 transitions. [2018-10-23 18:50:35,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-23 18:50:35,089 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:35,089 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:35,089 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:35,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:35,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1054277103, now seen corresponding path program 1 times [2018-10-23 18:50:35,090 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:35,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:35,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:35,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:35,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:35,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:35,370 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:50:35,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:35,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:50:35,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 18:50:35,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 18:50:35,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:50:35,372 INFO L87 Difference]: Start difference. First operand 9476 states and 11228 transitions. Second operand 5 states. [2018-10-23 18:50:37,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:37,775 INFO L93 Difference]: Finished difference Result 30652 states and 36094 transitions. [2018-10-23 18:50:37,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 18:50:37,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 236 [2018-10-23 18:50:37,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:37,814 INFO L225 Difference]: With dead ends: 30652 [2018-10-23 18:50:37,815 INFO L226 Difference]: Without dead ends: 21178 [2018-10-23 18:50:37,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:50:37,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21178 states. [2018-10-23 18:50:38,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21178 to 21173. [2018-10-23 18:50:38,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21173 states. [2018-10-23 18:50:38,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21173 states to 21173 states and 24847 transitions. [2018-10-23 18:50:38,114 INFO L78 Accepts]: Start accepts. Automaton has 21173 states and 24847 transitions. Word has length 236 [2018-10-23 18:50:38,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:38,116 INFO L481 AbstractCegarLoop]: Abstraction has 21173 states and 24847 transitions. [2018-10-23 18:50:38,116 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 18:50:38,116 INFO L276 IsEmpty]: Start isEmpty. Operand 21173 states and 24847 transitions. [2018-10-23 18:50:38,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-23 18:50:38,132 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:38,132 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:38,133 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:38,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:38,133 INFO L82 PathProgramCache]: Analyzing trace with hash 743334218, now seen corresponding path program 1 times [2018-10-23 18:50:38,133 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:38,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:38,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:38,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:38,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:38,636 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:50:38,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:38,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:38,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:50:38,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:50:38,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:38,638 INFO L87 Difference]: Start difference. First operand 21173 states and 24847 transitions. Second operand 4 states. [2018-10-23 18:50:41,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:41,181 INFO L93 Difference]: Finished difference Result 69748 states and 80897 transitions. [2018-10-23 18:50:41,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:50:41,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2018-10-23 18:50:41,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:41,268 INFO L225 Difference]: With dead ends: 69748 [2018-10-23 18:50:41,268 INFO L226 Difference]: Without dead ends: 48577 [2018-10-23 18:50:41,301 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:41,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48577 states. [2018-10-23 18:50:41,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48577 to 35450. [2018-10-23 18:50:41,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35450 states. [2018-10-23 18:50:41,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35450 states to 35450 states and 40732 transitions. [2018-10-23 18:50:41,854 INFO L78 Accepts]: Start accepts. Automaton has 35450 states and 40732 transitions. Word has length 240 [2018-10-23 18:50:41,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:41,854 INFO L481 AbstractCegarLoop]: Abstraction has 35450 states and 40732 transitions. [2018-10-23 18:50:41,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:50:41,855 INFO L276 IsEmpty]: Start isEmpty. Operand 35450 states and 40732 transitions. [2018-10-23 18:50:41,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-10-23 18:50:41,877 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:41,878 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:41,878 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:41,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:41,879 INFO L82 PathProgramCache]: Analyzing trace with hash -772333302, now seen corresponding path program 1 times [2018-10-23 18:50:41,879 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:41,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:41,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:41,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:41,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:42,116 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-23 18:50:42,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:42,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:42,117 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:50:42,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:50:42,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:42,118 INFO L87 Difference]: Start difference. First operand 35450 states and 40732 transitions. Second operand 4 states. [2018-10-23 18:50:43,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:43,487 INFO L93 Difference]: Finished difference Result 70283 states and 80770 transitions. [2018-10-23 18:50:43,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:50:43,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 255 [2018-10-23 18:50:43,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:43,529 INFO L225 Difference]: With dead ends: 70283 [2018-10-23 18:50:43,529 INFO L226 Difference]: Without dead ends: 34835 [2018-10-23 18:50:43,558 INFO L605 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 [2018-10-23 18:50:43,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34835 states. [2018-10-23 18:50:44,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34835 to 34835. [2018-10-23 18:50:44,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34835 states. [2018-10-23 18:50:44,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34835 states to 34835 states and 38420 transitions. [2018-10-23 18:50:44,304 INFO L78 Accepts]: Start accepts. Automaton has 34835 states and 38420 transitions. Word has length 255 [2018-10-23 18:50:44,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:44,305 INFO L481 AbstractCegarLoop]: Abstraction has 34835 states and 38420 transitions. [2018-10-23 18:50:44,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:50:44,305 INFO L276 IsEmpty]: Start isEmpty. Operand 34835 states and 38420 transitions. [2018-10-23 18:50:44,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-10-23 18:50:44,325 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:44,325 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:44,326 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:44,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:44,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1969189059, now seen corresponding path program 1 times [2018-10-23 18:50:44,326 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:44,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:44,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:44,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:44,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:44,541 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-23 18:50:44,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:44,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:50:44,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:50:44,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:50:44,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:50:44,543 INFO L87 Difference]: Start difference. First operand 34835 states and 38420 transitions. Second operand 3 states. [2018-10-23 18:50:45,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:45,452 INFO L93 Difference]: Finished difference Result 69667 states and 76837 transitions. [2018-10-23 18:50:45,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:50:45,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 268 [2018-10-23 18:50:45,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:45,487 INFO L225 Difference]: With dead ends: 69667 [2018-10-23 18:50:45,487 INFO L226 Difference]: Without dead ends: 34834 [2018-10-23 18:50:45,510 INFO L605 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 [2018-10-23 18:50:45,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34834 states. [2018-10-23 18:50:45,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34834 to 34834. [2018-10-23 18:50:45,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34834 states. [2018-10-23 18:50:45,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34834 states to 34834 states and 38418 transitions. [2018-10-23 18:50:45,881 INFO L78 Accepts]: Start accepts. Automaton has 34834 states and 38418 transitions. Word has length 268 [2018-10-23 18:50:45,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:45,882 INFO L481 AbstractCegarLoop]: Abstraction has 34834 states and 38418 transitions. [2018-10-23 18:50:45,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:50:45,882 INFO L276 IsEmpty]: Start isEmpty. Operand 34834 states and 38418 transitions. [2018-10-23 18:50:45,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-10-23 18:50:45,900 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:45,900 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:45,901 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:45,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:45,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1847525715, now seen corresponding path program 1 times [2018-10-23 18:50:45,901 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:45,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:45,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:45,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:45,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:45,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:46,263 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-10-23 18:50:46,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:46,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:46,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:50:46,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:50:46,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:46,265 INFO L87 Difference]: Start difference. First operand 34834 states and 38418 transitions. Second operand 4 states. [2018-10-23 18:50:48,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:48,945 INFO L93 Difference]: Finished difference Result 126434 states and 138909 transitions. [2018-10-23 18:50:48,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:50:48,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 284 [2018-10-23 18:50:48,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:49,029 INFO L225 Difference]: With dead ends: 126434 [2018-10-23 18:50:49,029 INFO L226 Difference]: Without dead ends: 91602 [2018-10-23 18:50:49,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:49,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91602 states. [2018-10-23 18:50:49,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91602 to 91598. [2018-10-23 18:50:49,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91598 states. [2018-10-23 18:50:50,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91598 states to 91598 states and 100372 transitions. [2018-10-23 18:50:50,055 INFO L78 Accepts]: Start accepts. Automaton has 91598 states and 100372 transitions. Word has length 284 [2018-10-23 18:50:50,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:50,055 INFO L481 AbstractCegarLoop]: Abstraction has 91598 states and 100372 transitions. [2018-10-23 18:50:50,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:50:50,056 INFO L276 IsEmpty]: Start isEmpty. Operand 91598 states and 100372 transitions. [2018-10-23 18:50:50,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-10-23 18:50:50,064 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:50,065 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:50:50,065 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:50,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:50,066 INFO L82 PathProgramCache]: Analyzing trace with hash -657631533, now seen corresponding path program 1 times [2018-10-23 18:50:50,066 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:50,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:50,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:50,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:50,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:50,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:50,426 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-23 18:50:50,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:50,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:50:50,427 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:50:50,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:50:50,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:50,428 INFO L87 Difference]: Start difference. First operand 91598 states and 100372 transitions. Second operand 4 states. [2018-10-23 18:50:52,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:52,747 INFO L93 Difference]: Finished difference Result 187108 states and 205228 transitions. [2018-10-23 18:50:52,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:50:52,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 284 [2018-10-23 18:50:52,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:52,865 INFO L225 Difference]: With dead ends: 187108 [2018-10-23 18:50:52,866 INFO L226 Difference]: Without dead ends: 95512 [2018-10-23 18:50:52,929 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:50:52,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95512 states. [2018-10-23 18:50:54,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95512 to 95483. [2018-10-23 18:50:54,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95483 states. [2018-10-23 18:50:54,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95483 states to 95483 states and 104575 transitions. [2018-10-23 18:50:54,774 INFO L78 Accepts]: Start accepts. Automaton has 95483 states and 104575 transitions. Word has length 284 [2018-10-23 18:50:54,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:50:54,775 INFO L481 AbstractCegarLoop]: Abstraction has 95483 states and 104575 transitions. [2018-10-23 18:50:54,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:50:54,775 INFO L276 IsEmpty]: Start isEmpty. Operand 95483 states and 104575 transitions. [2018-10-23 18:50:54,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-10-23 18:50:54,788 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:50:54,788 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2018-10-23 18:50:54,788 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:50:54,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:50:54,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1393560831, now seen corresponding path program 1 times [2018-10-23 18:50:54,789 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:50:54,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:50:54,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:54,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:50:54,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:50:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:50:55,285 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-23 18:50:55,379 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-10-23 18:50:55,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:50:55,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:50:55,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 18:50:55,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 18:50:55,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:50:55,381 INFO L87 Difference]: Start difference. First operand 95483 states and 104575 transitions. Second operand 5 states. [2018-10-23 18:50:58,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:50:58,864 INFO L93 Difference]: Finished difference Result 285047 states and 311846 transitions. [2018-10-23 18:50:58,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 18:50:58,865 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 313 [2018-10-23 18:50:58,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:50:59,101 INFO L225 Difference]: With dead ends: 285047 [2018-10-23 18:50:59,102 INFO L226 Difference]: Without dead ends: 189566 [2018-10-23 18:50:59,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:50:59,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189566 states. [2018-10-23 18:51:02,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189566 to 178242. [2018-10-23 18:51:02,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178242 states. [2018-10-23 18:51:02,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178242 states to 178242 states and 194148 transitions. [2018-10-23 18:51:02,244 INFO L78 Accepts]: Start accepts. Automaton has 178242 states and 194148 transitions. Word has length 313 [2018-10-23 18:51:02,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:51:02,245 INFO L481 AbstractCegarLoop]: Abstraction has 178242 states and 194148 transitions. [2018-10-23 18:51:02,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 18:51:02,245 INFO L276 IsEmpty]: Start isEmpty. Operand 178242 states and 194148 transitions. [2018-10-23 18:51:02,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-10-23 18:51:02,263 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:51:02,263 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:51:02,263 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:51:02,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:51:02,264 INFO L82 PathProgramCache]: Analyzing trace with hash -814992243, now seen corresponding path program 1 times [2018-10-23 18:51:02,264 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:51:02,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:51:02,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:02,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:51:02,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:02,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:51:02,680 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:51:02,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:51:02,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:51:02,681 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:51:02,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:51:02,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:51:02,681 INFO L87 Difference]: Start difference. First operand 178242 states and 194148 transitions. Second operand 4 states. [2018-10-23 18:51:06,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:51:06,716 INFO L93 Difference]: Finished difference Result 359539 states and 391686 transitions. [2018-10-23 18:51:06,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:51:06,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 316 [2018-10-23 18:51:06,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:51:06,958 INFO L225 Difference]: With dead ends: 359539 [2018-10-23 18:51:06,958 INFO L226 Difference]: Without dead ends: 181297 [2018-10-23 18:51:07,047 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:51:07,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181297 states. [2018-10-23 18:51:08,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181297 to 181289. [2018-10-23 18:51:08,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181289 states. [2018-10-23 18:51:09,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181289 states to 181289 states and 195449 transitions. [2018-10-23 18:51:09,085 INFO L78 Accepts]: Start accepts. Automaton has 181289 states and 195449 transitions. Word has length 316 [2018-10-23 18:51:09,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:51:09,086 INFO L481 AbstractCegarLoop]: Abstraction has 181289 states and 195449 transitions. [2018-10-23 18:51:09,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:51:09,086 INFO L276 IsEmpty]: Start isEmpty. Operand 181289 states and 195449 transitions. [2018-10-23 18:51:09,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-10-23 18:51:09,104 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:51:09,105 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:51:09,105 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:51:09,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:51:09,105 INFO L82 PathProgramCache]: Analyzing trace with hash -337771774, now seen corresponding path program 1 times [2018-10-23 18:51:09,106 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:51:09,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:51:09,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:09,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:51:09,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:09,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:51:09,329 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-10-23 18:51:09,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:51:09,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:51:09,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:51:09,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:51:09,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:51:09,331 INFO L87 Difference]: Start difference. First operand 181289 states and 195449 transitions. Second operand 3 states. [2018-10-23 18:51:13,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:51:13,428 INFO L93 Difference]: Finished difference Result 450467 states and 485283 transitions. [2018-10-23 18:51:13,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:51:13,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 325 [2018-10-23 18:51:13,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:51:13,752 INFO L225 Difference]: With dead ends: 450467 [2018-10-23 18:51:13,753 INFO L226 Difference]: Without dead ends: 269180 [2018-10-23 18:51:13,871 INFO L605 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 [2018-10-23 18:51:14,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269180 states. [2018-10-23 18:51:22,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269180 to 258721. [2018-10-23 18:51:22,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258721 states. [2018-10-23 18:51:22,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258721 states to 258721 states and 278761 transitions. [2018-10-23 18:51:22,798 INFO L78 Accepts]: Start accepts. Automaton has 258721 states and 278761 transitions. Word has length 325 [2018-10-23 18:51:22,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:51:22,798 INFO L481 AbstractCegarLoop]: Abstraction has 258721 states and 278761 transitions. [2018-10-23 18:51:22,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:51:22,798 INFO L276 IsEmpty]: Start isEmpty. Operand 258721 states and 278761 transitions. [2018-10-23 18:51:22,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-10-23 18:51:22,811 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:51:22,812 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:51:22,812 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:51:22,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:51:22,812 INFO L82 PathProgramCache]: Analyzing trace with hash 632149206, now seen corresponding path program 1 times [2018-10-23 18:51:22,812 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:51:22,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:51:22,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:22,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:51:22,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:51:22,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:51:23,148 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-23 18:51:23,341 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 143 proven. 4 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-10-23 18:51:23,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:51:23,342 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 18:51:23,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:51:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:51:23,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:51:23,748 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-10-23 18:51:23,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 18:51:23,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-23 18:51:23,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-23 18:51:23,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-23 18:51:23,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-23 18:51:23,775 INFO L87 Difference]: Start difference. First operand 258721 states and 278761 transitions. Second operand 6 states. [2018-10-23 18:51:35,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:51:35,101 INFO L93 Difference]: Finished difference Result 1152439 states and 1239561 transitions. [2018-10-23 18:51:35,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-23 18:51:35,102 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 333 [2018-10-23 18:51:35,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:51:36,350 INFO L225 Difference]: With dead ends: 1152439 [2018-10-23 18:51:36,350 INFO L226 Difference]: Without dead ends: 893720 [2018-10-23 18:51:36,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-23 18:51:37,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893720 states. [2018-10-23 18:51:49,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893720 to 888151. [2018-10-23 18:51:49,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888151 states. [2018-10-23 18:52:04,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888151 states to 888151 states and 949667 transitions. [2018-10-23 18:52:04,615 INFO L78 Accepts]: Start accepts. Automaton has 888151 states and 949667 transitions. Word has length 333 [2018-10-23 18:52:04,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:52:04,615 INFO L481 AbstractCegarLoop]: Abstraction has 888151 states and 949667 transitions. [2018-10-23 18:52:04,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-23 18:52:04,616 INFO L276 IsEmpty]: Start isEmpty. Operand 888151 states and 949667 transitions. [2018-10-23 18:52:04,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-10-23 18:52:04,630 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:52:04,630 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-23 18:52:04,630 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:52:04,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:52:04,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1755498419, now seen corresponding path program 1 times [2018-10-23 18:52:04,631 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:52:04,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:52:04,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:04,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:52:04,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:52:04,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:52:05,160 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-23 18:52:05,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:52:05,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:52:05,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:52:05,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:52:05,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:52:05,162 INFO L87 Difference]: Start difference. First operand 888151 states and 949667 transitions. Second operand 4 states. [2018-10-23 18:52:18,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:52:18,646 INFO L93 Difference]: Finished difference Result 2486026 states and 2654736 transitions. [2018-10-23 18:52:18,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:52:18,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 334 [2018-10-23 18:52:18,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:52:23,157 INFO L225 Difference]: With dead ends: 2486026 [2018-10-23 18:52:23,157 INFO L226 Difference]: Without dead ends: 1557107 [2018-10-23 18:52:23,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:52:24,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557107 states. [2018-10-23 18:53:02,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557107 to 1446950. [2018-10-23 18:53:02,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1446950 states. [2018-10-23 18:53:06,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446950 states to 1446950 states and 1533753 transitions. [2018-10-23 18:53:06,906 INFO L78 Accepts]: Start accepts. Automaton has 1446950 states and 1533753 transitions. Word has length 334 [2018-10-23 18:53:06,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:53:06,907 INFO L481 AbstractCegarLoop]: Abstraction has 1446950 states and 1533753 transitions. [2018-10-23 18:53:06,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:53:06,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1446950 states and 1533753 transitions. [2018-10-23 18:53:06,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-10-23 18:53:06,916 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:53:06,917 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:53:06,917 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:53:06,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:53:06,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1403475232, now seen corresponding path program 1 times [2018-10-23 18:53:06,918 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:53:06,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:53:06,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:06,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:53:06,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:53:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:53:07,247 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:53:07,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:53:07,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:53:07,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:53:07,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:53:07,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:53:07,249 INFO L87 Difference]: Start difference. First operand 1446950 states and 1533753 transitions. Second operand 3 states. Received shutdown request... [2018-10-23 18:53:21,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:53:21,287 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-23 18:53:21,292 WARN L205 ceAbstractionStarter]: Timeout [2018-10-23 18:53:21,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 06:53:21 BoogieIcfgContainer [2018-10-23 18:53:21,293 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-23 18:53:21,294 INFO L168 Benchmark]: Toolchain (without parser) took 194540.84 ms. Allocated memory was 1.5 GB in the beginning and 6.6 GB in the end (delta: 5.0 GB). Free memory was 1.4 GB in the beginning and 4.2 GB in the end (delta: -2.8 GB). Peak memory consumption was 3.1 GB. Max. memory is 7.1 GB. [2018-10-23 18:53:21,295 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 18:53:21,295 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1176.80 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-23 18:53:21,296 INFO L168 Benchmark]: Boogie Procedure Inliner took 330.17 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.7 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -868.9 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. [2018-10-23 18:53:21,297 INFO L168 Benchmark]: Boogie Preprocessor took 125.21 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2018-10-23 18:53:21,298 INFO L168 Benchmark]: RCFGBuilder took 5914.18 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 263.3 MB). Peak memory consumption was 263.3 MB. Max. memory is 7.1 GB. [2018-10-23 18:53:21,300 INFO L168 Benchmark]: TraceAbstraction took 186985.83 ms. Allocated memory was 2.3 GB in the beginning and 6.6 GB in the end (delta: 4.3 GB). Free memory was 1.9 GB in the beginning and 4.2 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2018-10-23 18:53:21,310 INFO L336 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 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1176.80 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 330.17 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.7 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -868.9 MB). Peak memory consumption was 40.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 125.21 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5914.18 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 263.3 MB). Peak memory consumption was 263.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 186985.83 ms. Allocated memory was 2.3 GB in the beginning and 6.6 GB in the end (delta: 4.3 GB). Free memory was 1.9 GB in the beginning and 4.2 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1524]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1524). Cancelled while BasicCegarLoop was constructing difference of abstraction (1446950states) and FLOYD_HOARE automaton (currently 3 states, 3 states before enhancement),while ReachableStatesComputation was computing reachable states (493482 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 186.9s OverallTime, 20 OverallIterations, 7 TraceHistogramMax, 88.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4853 SDtfs, 11723 SDslu, 3437 SDs, 0 SdLazy, 20119 SolverSat, 3640 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 46.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 405 GetRequests, 359 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1446950occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 90.9s AutomataMinimizationTime, 19 MinimizatonAttempts, 153100 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 5326 NumberOfCodeBlocks, 5326 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 5305 ConstructedInterpolants, 0 QuantifiedInterpolants, 3060499 SizeOfPredicates, 0 NumberOfNonLiveVariables, 675 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 21 InterpolantComputations, 20 PerfectInterpolantSequences, 2821/2825 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown