java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-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_label21_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:55:58,956 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:55:58,959 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:55:58,979 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:55:58,980 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:55:58,984 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:55:58,986 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:55:58,988 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:55:58,990 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:55:58,991 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:55:58,994 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:55:58,995 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:55:58,996 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:55:58,999 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:55:59,000 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:55:59,001 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:55:59,002 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:55:59,004 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:55:59,006 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:55:59,008 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:55:59,009 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:55:59,010 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:55:59,013 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:55:59,013 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:55:59,013 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:55:59,015 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:55:59,016 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:55:59,016 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:55:59,017 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:55:59,019 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:55:59,019 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:55:59,020 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:55:59,020 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:55:59,020 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:55:59,021 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:55:59,022 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:55:59,022 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 19:55:59,049 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:55:59,049 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:55:59,050 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:55:59,052 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:55:59,053 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:55:59,053 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:55:59,053 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:55:59,053 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:55:59,055 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:55:59,055 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:55:59,055 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:55:59,055 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:55:59,056 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:55:59,056 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:55:59,056 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:55:59,056 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:55:59,058 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:55:59,058 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:55:59,058 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:55:59,058 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:55:59,059 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:55:59,059 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:55:59,059 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:55:59,059 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:55:59,059 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:55:59,060 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:55:59,060 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:55:59,060 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:55:59,132 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:55:59,151 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:55:59,156 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:55:59,158 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:55:59,158 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:55:59,159 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label21_true-unreach-call.c [2018-11-06 19:55:59,232 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fda4c172a/ecd1fb16963d4af088ba7dc3a96ec4e7/FLAGbb963be54 [2018-11-06 19:55:59,947 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:55:59,949 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label21_true-unreach-call.c [2018-11-06 19:55:59,971 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fda4c172a/ecd1fb16963d4af088ba7dc3a96ec4e7/FLAGbb963be54 [2018-11-06 19:55:59,996 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fda4c172a/ecd1fb16963d4af088ba7dc3a96ec4e7 [2018-11-06 19:56:00,007 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:56:00,008 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:56:00,009 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:56:00,010 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:56:00,013 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:56:00,014 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:55:59" (1/1) ... [2018-11-06 19:56:00,017 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@429b8899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:00, skipping insertion in model container [2018-11-06 19:56:00,018 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:55:59" (1/1) ... [2018-11-06 19:56:00,028 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:56:00,118 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:56:00,855 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:56:00,861 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:56:01,182 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:56:01,206 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:56:01,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:01 WrapperNode [2018-11-06 19:56:01,207 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:56:01,208 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:56:01,208 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:56:01,208 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:56:01,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:01" (1/1) ... [2018-11-06 19:56:01,429 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:01" (1/1) ... [2018-11-06 19:56:01,542 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:56:01,543 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:56:01,543 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:56:01,543 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:56:01,554 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:01" (1/1) ... [2018-11-06 19:56:01,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:01" (1/1) ... [2018-11-06 19:56:01,562 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:01" (1/1) ... [2018-11-06 19:56:01,562 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:01" (1/1) ... [2018-11-06 19:56:01,620 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:01" (1/1) ... [2018-11-06 19:56:01,655 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:01" (1/1) ... [2018-11-06 19:56:01,677 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:01" (1/1) ... [2018-11-06 19:56:01,694 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:56:01,694 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:56:01,694 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:56:01,695 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:56:01,696 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:56:01,773 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:56:01,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:56:01,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:56:07,470 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:56:07,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:56:07 BoogieIcfgContainer [2018-11-06 19:56:07,471 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:56:07,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:56:07,472 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:56:07,476 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:56:07,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:55:59" (1/3) ... [2018-11-06 19:56:07,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fb4e366 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:56:07, skipping insertion in model container [2018-11-06 19:56:07,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:01" (2/3) ... [2018-11-06 19:56:07,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fb4e366 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:56:07, skipping insertion in model container [2018-11-06 19:56:07,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:56:07" (3/3) ... [2018-11-06 19:56:07,480 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label21_true-unreach-call.c [2018-11-06 19:56:07,490 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:56:07,498 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:56:07,516 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:56:07,551 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:56:07,551 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:56:07,551 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:56:07,552 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:56:07,552 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:56:07,552 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:56:07,552 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:56:07,552 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:56:07,552 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:56:07,579 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-11-06 19:56:07,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-06 19:56:07,604 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:07,605 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:56:07,608 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:07,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:07,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1515972374, now seen corresponding path program 1 times [2018-11-06 19:56:07,615 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:07,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:07,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:07,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:07,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:07,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:08,431 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-11-06 19:56:08,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:56:08,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:08,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:56:08,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:56:08,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:56:08,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:56:08,576 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-11-06 19:56:12,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:12,447 INFO L93 Difference]: Finished difference Result 1027 states and 1865 transitions. [2018-11-06 19:56:12,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:56:12,450 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 203 [2018-11-06 19:56:12,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:12,475 INFO L225 Difference]: With dead ends: 1027 [2018-11-06 19:56:12,475 INFO L226 Difference]: Without dead ends: 717 [2018-11-06 19:56:12,481 INFO L604 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-11-06 19:56:12,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-11-06 19:56:12,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 715. [2018-11-06 19:56:12,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2018-11-06 19:56:12,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1145 transitions. [2018-11-06 19:56:12,576 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1145 transitions. Word has length 203 [2018-11-06 19:56:12,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:12,577 INFO L480 AbstractCegarLoop]: Abstraction has 715 states and 1145 transitions. [2018-11-06 19:56:12,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:56:12,577 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1145 transitions. [2018-11-06 19:56:12,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-06 19:56:12,586 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:12,587 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:56:12,587 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:12,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:12,588 INFO L82 PathProgramCache]: Analyzing trace with hash -197428085, now seen corresponding path program 1 times [2018-11-06 19:56:12,588 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:12,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:12,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:12,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:12,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:12,768 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:56:12,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:12,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:56:12,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:56:12,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:56:12,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:56:12,774 INFO L87 Difference]: Start difference. First operand 715 states and 1145 transitions. Second operand 3 states. [2018-11-06 19:56:14,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:14,865 INFO L93 Difference]: Finished difference Result 2058 states and 3347 transitions. [2018-11-06 19:56:14,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:56:14,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2018-11-06 19:56:14,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:14,875 INFO L225 Difference]: With dead ends: 2058 [2018-11-06 19:56:14,875 INFO L226 Difference]: Without dead ends: 1345 [2018-11-06 19:56:14,880 INFO L604 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-11-06 19:56:14,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2018-11-06 19:56:14,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1331. [2018-11-06 19:56:14,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2018-11-06 19:56:14,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2076 transitions. [2018-11-06 19:56:14,939 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2076 transitions. Word has length 212 [2018-11-06 19:56:14,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:14,939 INFO L480 AbstractCegarLoop]: Abstraction has 1331 states and 2076 transitions. [2018-11-06 19:56:14,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:56:14,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2076 transitions. [2018-11-06 19:56:14,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-11-06 19:56:14,951 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:14,952 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:56:14,952 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:14,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:14,952 INFO L82 PathProgramCache]: Analyzing trace with hash -472348186, now seen corresponding path program 1 times [2018-11-06 19:56:14,952 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:14,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:14,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:14,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:14,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:14,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:15,116 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-06 19:56:15,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:15,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:56:15,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:56:15,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:56:15,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:56:15,119 INFO L87 Difference]: Start difference. First operand 1331 states and 2076 transitions. Second operand 3 states. [2018-11-06 19:56:17,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:17,324 INFO L93 Difference]: Finished difference Result 3977 states and 6209 transitions. [2018-11-06 19:56:17,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:56:17,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2018-11-06 19:56:17,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:17,338 INFO L225 Difference]: With dead ends: 3977 [2018-11-06 19:56:17,338 INFO L226 Difference]: Without dead ends: 2648 [2018-11-06 19:56:17,341 INFO L604 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-11-06 19:56:17,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2648 states. [2018-11-06 19:56:17,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2648 to 2645. [2018-11-06 19:56:17,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2645 states. [2018-11-06 19:56:17,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 4120 transitions. [2018-11-06 19:56:17,395 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 4120 transitions. Word has length 226 [2018-11-06 19:56:17,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:17,395 INFO L480 AbstractCegarLoop]: Abstraction has 2645 states and 4120 transitions. [2018-11-06 19:56:17,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:56:17,395 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 4120 transitions. [2018-11-06 19:56:17,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-11-06 19:56:17,404 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:17,404 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:56:17,405 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:17,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:17,405 INFO L82 PathProgramCache]: Analyzing trace with hash -494435718, now seen corresponding path program 1 times [2018-11-06 19:56:17,405 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:17,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:17,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:17,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:17,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:17,605 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-06 19:56:17,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:17,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:56:17,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:56:17,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:56:17,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:56:17,606 INFO L87 Difference]: Start difference. First operand 2645 states and 4120 transitions. Second operand 3 states. [2018-11-06 19:56:18,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:18,377 INFO L93 Difference]: Finished difference Result 5250 states and 8186 transitions. [2018-11-06 19:56:18,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:56:18,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2018-11-06 19:56:18,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:18,391 INFO L225 Difference]: With dead ends: 5250 [2018-11-06 19:56:18,391 INFO L226 Difference]: Without dead ends: 2607 [2018-11-06 19:56:18,396 INFO L604 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-11-06 19:56:18,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2607 states. [2018-11-06 19:56:18,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2607 to 2607. [2018-11-06 19:56:18,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2607 states. [2018-11-06 19:56:18,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2607 states to 2607 states and 3992 transitions. [2018-11-06 19:56:18,476 INFO L78 Accepts]: Start accepts. Automaton has 2607 states and 3992 transitions. Word has length 234 [2018-11-06 19:56:18,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:18,477 INFO L480 AbstractCegarLoop]: Abstraction has 2607 states and 3992 transitions. [2018-11-06 19:56:18,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:56:18,477 INFO L276 IsEmpty]: Start isEmpty. Operand 2607 states and 3992 transitions. [2018-11-06 19:56:18,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-11-06 19:56:18,484 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:18,485 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:56:18,485 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:18,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:18,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1318050450, now seen corresponding path program 1 times [2018-11-06 19:56:18,486 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:18,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:18,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:18,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:18,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:18,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:19,074 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-11-06 19:56:19,175 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:56:19,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:19,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:56:19,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:56:19,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:56:19,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:56:19,177 INFO L87 Difference]: Start difference. First operand 2607 states and 3992 transitions. Second operand 5 states. [2018-11-06 19:56:23,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:23,146 INFO L93 Difference]: Finished difference Result 6279 states and 9778 transitions. [2018-11-06 19:56:23,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:56:23,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 243 [2018-11-06 19:56:23,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:23,165 INFO L225 Difference]: With dead ends: 6279 [2018-11-06 19:56:23,165 INFO L226 Difference]: Without dead ends: 3674 [2018-11-06 19:56:23,170 INFO L604 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-11-06 19:56:23,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3674 states. [2018-11-06 19:56:23,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3674 to 3015. [2018-11-06 19:56:23,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3015 states. [2018-11-06 19:56:23,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3015 states to 3015 states and 4612 transitions. [2018-11-06 19:56:23,231 INFO L78 Accepts]: Start accepts. Automaton has 3015 states and 4612 transitions. Word has length 243 [2018-11-06 19:56:23,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:23,232 INFO L480 AbstractCegarLoop]: Abstraction has 3015 states and 4612 transitions. [2018-11-06 19:56:23,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:56:23,232 INFO L276 IsEmpty]: Start isEmpty. Operand 3015 states and 4612 transitions. [2018-11-06 19:56:23,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-11-06 19:56:23,240 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:23,241 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:56:23,241 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:23,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:23,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1744395106, now seen corresponding path program 1 times [2018-11-06 19:56:23,242 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:23,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:23,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:23,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:23,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:23,439 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 62 proven. 10 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-06 19:56:23,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:56:23,440 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-06 19:56:23,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:23,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:56:23,749 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-11-06 19:56:23,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:56:23,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2018-11-06 19:56:23,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:56:23,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:56:23,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:56:23,783 INFO L87 Difference]: Start difference. First operand 3015 states and 4612 transitions. Second operand 4 states. [2018-11-06 19:56:26,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:26,388 INFO L93 Difference]: Finished difference Result 12048 states and 18435 transitions. [2018-11-06 19:56:26,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:56:26,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 279 [2018-11-06 19:56:26,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:26,435 INFO L225 Difference]: With dead ends: 12048 [2018-11-06 19:56:26,435 INFO L226 Difference]: Without dead ends: 9035 [2018-11-06 19:56:26,442 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 279 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:56:26,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9035 states. [2018-11-06 19:56:26,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9035 to 6022. [2018-11-06 19:56:26,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6022 states. [2018-11-06 19:56:26,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6022 states to 6022 states and 9192 transitions. [2018-11-06 19:56:26,592 INFO L78 Accepts]: Start accepts. Automaton has 6022 states and 9192 transitions. Word has length 279 [2018-11-06 19:56:26,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:26,592 INFO L480 AbstractCegarLoop]: Abstraction has 6022 states and 9192 transitions. [2018-11-06 19:56:26,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:56:26,593 INFO L276 IsEmpty]: Start isEmpty. Operand 6022 states and 9192 transitions. [2018-11-06 19:56:26,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-11-06 19:56:26,605 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:26,605 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:56:26,606 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:26,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:26,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1003075031, now seen corresponding path program 1 times [2018-11-06 19:56:26,606 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:26,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:26,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:26,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:26,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:26,835 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-06 19:56:26,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:26,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:56:26,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:56:26,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:56:26,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:56:26,843 INFO L87 Difference]: Start difference. First operand 6022 states and 9192 transitions. Second operand 3 states. [2018-11-06 19:56:28,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:28,283 INFO L93 Difference]: Finished difference Result 17361 states and 26560 transitions. [2018-11-06 19:56:28,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:56:28,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 279 [2018-11-06 19:56:28,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:28,331 INFO L225 Difference]: With dead ends: 17361 [2018-11-06 19:56:28,332 INFO L226 Difference]: Without dead ends: 11341 [2018-11-06 19:56:28,341 INFO L604 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-11-06 19:56:28,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11341 states. [2018-11-06 19:56:28,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11341 to 11337. [2018-11-06 19:56:28,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11337 states. [2018-11-06 19:56:28,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11337 states to 11337 states and 15999 transitions. [2018-11-06 19:56:28,517 INFO L78 Accepts]: Start accepts. Automaton has 11337 states and 15999 transitions. Word has length 279 [2018-11-06 19:56:28,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:28,517 INFO L480 AbstractCegarLoop]: Abstraction has 11337 states and 15999 transitions. [2018-11-06 19:56:28,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:56:28,518 INFO L276 IsEmpty]: Start isEmpty. Operand 11337 states and 15999 transitions. [2018-11-06 19:56:28,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-11-06 19:56:28,536 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:28,536 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, 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-11-06 19:56:28,536 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:28,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:28,537 INFO L82 PathProgramCache]: Analyzing trace with hash 949743912, now seen corresponding path program 1 times [2018-11-06 19:56:28,537 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:28,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:28,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:28,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:28,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:28,807 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:56:28,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:28,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:56:28,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:56:28,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:56:28,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:56:28,809 INFO L87 Difference]: Start difference. First operand 11337 states and 15999 transitions. Second operand 4 states. [2018-11-06 19:56:31,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:31,192 INFO L93 Difference]: Finished difference Result 41586 states and 58258 transitions. [2018-11-06 19:56:31,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:56:31,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 282 [2018-11-06 19:56:31,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:31,259 INFO L225 Difference]: With dead ends: 41586 [2018-11-06 19:56:31,259 INFO L226 Difference]: Without dead ends: 30251 [2018-11-06 19:56:31,278 INFO L604 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-11-06 19:56:31,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30251 states. [2018-11-06 19:56:31,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30251 to 21129. [2018-11-06 19:56:31,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21129 states. [2018-11-06 19:56:31,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21129 states to 21129 states and 28285 transitions. [2018-11-06 19:56:31,627 INFO L78 Accepts]: Start accepts. Automaton has 21129 states and 28285 transitions. Word has length 282 [2018-11-06 19:56:31,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:31,627 INFO L480 AbstractCegarLoop]: Abstraction has 21129 states and 28285 transitions. [2018-11-06 19:56:31,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:56:31,627 INFO L276 IsEmpty]: Start isEmpty. Operand 21129 states and 28285 transitions. [2018-11-06 19:56:31,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-11-06 19:56:31,660 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:31,660 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:56:31,661 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:31,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:31,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1216779258, now seen corresponding path program 1 times [2018-11-06 19:56:31,661 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:31,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:31,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:31,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:31,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:31,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:31,821 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-06 19:56:31,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:31,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:56:31,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:56:31,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:56:31,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:56:31,823 INFO L87 Difference]: Start difference. First operand 21129 states and 28285 transitions. Second operand 3 states. [2018-11-06 19:56:33,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:33,330 INFO L93 Difference]: Finished difference Result 42264 states and 56582 transitions. [2018-11-06 19:56:33,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:56:33,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 289 [2018-11-06 19:56:33,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:33,363 INFO L225 Difference]: With dead ends: 42264 [2018-11-06 19:56:33,363 INFO L226 Difference]: Without dead ends: 21137 [2018-11-06 19:56:33,387 INFO L604 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-11-06 19:56:33,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21137 states. [2018-11-06 19:56:33,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21137 to 21129. [2018-11-06 19:56:33,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21129 states. [2018-11-06 19:56:33,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21129 states to 21129 states and 25984 transitions. [2018-11-06 19:56:33,653 INFO L78 Accepts]: Start accepts. Automaton has 21129 states and 25984 transitions. Word has length 289 [2018-11-06 19:56:33,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:33,653 INFO L480 AbstractCegarLoop]: Abstraction has 21129 states and 25984 transitions. [2018-11-06 19:56:33,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:56:33,653 INFO L276 IsEmpty]: Start isEmpty. Operand 21129 states and 25984 transitions. [2018-11-06 19:56:33,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-11-06 19:56:33,676 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:33,676 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 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] [2018-11-06 19:56:33,676 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:33,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:33,677 INFO L82 PathProgramCache]: Analyzing trace with hash 287123333, now seen corresponding path program 1 times [2018-11-06 19:56:33,677 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:33,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:33,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:33,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:33,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:33,925 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-11-06 19:56:33,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:33,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:56:33,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:56:33,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:56:33,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:56:33,927 INFO L87 Difference]: Start difference. First operand 21129 states and 25984 transitions. Second operand 4 states. [2018-11-06 19:56:35,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:35,345 INFO L93 Difference]: Finished difference Result 41848 states and 51444 transitions. [2018-11-06 19:56:35,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:56:35,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 306 [2018-11-06 19:56:35,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:35,377 INFO L225 Difference]: With dead ends: 41848 [2018-11-06 19:56:35,377 INFO L226 Difference]: Without dead ends: 20721 [2018-11-06 19:56:35,400 INFO L604 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-11-06 19:56:35,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20721 states. [2018-11-06 19:56:35,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20721 to 20721. [2018-11-06 19:56:35,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20721 states. [2018-11-06 19:56:35,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20721 states to 20721 states and 24096 transitions. [2018-11-06 19:56:35,662 INFO L78 Accepts]: Start accepts. Automaton has 20721 states and 24096 transitions. Word has length 306 [2018-11-06 19:56:35,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:35,662 INFO L480 AbstractCegarLoop]: Abstraction has 20721 states and 24096 transitions. [2018-11-06 19:56:35,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:56:35,663 INFO L276 IsEmpty]: Start isEmpty. Operand 20721 states and 24096 transitions. [2018-11-06 19:56:35,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-11-06 19:56:35,682 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:35,682 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:56:35,682 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:35,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:35,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1928214112, now seen corresponding path program 1 times [2018-11-06 19:56:35,683 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:35,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:35,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:35,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:35,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:35,922 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-11-06 19:56:35,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:35,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:56:35,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:56:35,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:56:35,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:56:35,924 INFO L87 Difference]: Start difference. First operand 20721 states and 24096 transitions. Second operand 4 states. [2018-11-06 19:56:38,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:38,443 INFO L93 Difference]: Finished difference Result 81406 states and 94708 transitions. [2018-11-06 19:56:38,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:56:38,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2018-11-06 19:56:38,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:38,536 INFO L225 Difference]: With dead ends: 81406 [2018-11-06 19:56:38,536 INFO L226 Difference]: Without dead ends: 60687 [2018-11-06 19:56:38,559 INFO L604 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-11-06 19:56:38,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60687 states. [2018-11-06 19:56:39,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60687 to 60685. [2018-11-06 19:56:39,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60685 states. [2018-11-06 19:56:39,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60685 states to 60685 states and 70476 transitions. [2018-11-06 19:56:39,316 INFO L78 Accepts]: Start accepts. Automaton has 60685 states and 70476 transitions. Word has length 308 [2018-11-06 19:56:39,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:39,316 INFO L480 AbstractCegarLoop]: Abstraction has 60685 states and 70476 transitions. [2018-11-06 19:56:39,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:56:39,317 INFO L276 IsEmpty]: Start isEmpty. Operand 60685 states and 70476 transitions. [2018-11-06 19:56:39,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-11-06 19:56:39,342 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:39,342 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:56:39,342 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:39,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:39,343 INFO L82 PathProgramCache]: Analyzing trace with hash -458556812, now seen corresponding path program 1 times [2018-11-06 19:56:39,343 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:39,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:39,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:39,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:39,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:39,542 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-06 19:56:39,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:39,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:56:39,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:56:39,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:56:39,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:56:39,544 INFO L87 Difference]: Start difference. First operand 60685 states and 70476 transitions. Second operand 3 states. [2018-11-06 19:56:41,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:41,911 INFO L93 Difference]: Finished difference Result 165657 states and 191383 transitions. [2018-11-06 19:56:41,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:56:41,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 341 [2018-11-06 19:56:41,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:42,027 INFO L225 Difference]: With dead ends: 165657 [2018-11-06 19:56:42,027 INFO L226 Difference]: Without dead ends: 104974 [2018-11-06 19:56:42,062 INFO L604 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-11-06 19:56:42,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104974 states. [2018-11-06 19:56:43,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104974 to 104938. [2018-11-06 19:56:43,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104938 states. [2018-11-06 19:56:43,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104938 states to 104938 states and 118157 transitions. [2018-11-06 19:56:43,142 INFO L78 Accepts]: Start accepts. Automaton has 104938 states and 118157 transitions. Word has length 341 [2018-11-06 19:56:43,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:43,142 INFO L480 AbstractCegarLoop]: Abstraction has 104938 states and 118157 transitions. [2018-11-06 19:56:43,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:56:43,143 INFO L276 IsEmpty]: Start isEmpty. Operand 104938 states and 118157 transitions. [2018-11-06 19:56:43,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-11-06 19:56:43,160 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:43,160 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:56:43,160 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:43,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:43,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1480618161, now seen corresponding path program 1 times [2018-11-06 19:56:43,161 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:43,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:43,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:43,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:43,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:43,396 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-06 19:56:43,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:56:43,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:56:43,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:56:43,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:56:43,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:56:43,398 INFO L87 Difference]: Start difference. First operand 104938 states and 118157 transitions. Second operand 3 states. [2018-11-06 19:56:46,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:46,361 INFO L93 Difference]: Finished difference Result 263416 states and 296388 transitions. [2018-11-06 19:56:46,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:56:46,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 342 [2018-11-06 19:56:46,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:46,549 INFO L225 Difference]: With dead ends: 263416 [2018-11-06 19:56:46,549 INFO L226 Difference]: Without dead ends: 158480 [2018-11-06 19:56:46,599 INFO L604 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-11-06 19:56:46,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158480 states. [2018-11-06 19:56:48,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158480 to 158462. [2018-11-06 19:56:48,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158462 states. [2018-11-06 19:56:48,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158462 states to 158462 states and 178052 transitions. [2018-11-06 19:56:48,242 INFO L78 Accepts]: Start accepts. Automaton has 158462 states and 178052 transitions. Word has length 342 [2018-11-06 19:56:48,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:56:48,243 INFO L480 AbstractCegarLoop]: Abstraction has 158462 states and 178052 transitions. [2018-11-06 19:56:48,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:56:48,243 INFO L276 IsEmpty]: Start isEmpty. Operand 158462 states and 178052 transitions. [2018-11-06 19:56:48,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-11-06 19:56:48,286 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:56:48,286 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-11-06 19:56:48,286 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:56:48,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:56:48,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1211834363, now seen corresponding path program 1 times [2018-11-06 19:56:48,287 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:56:48,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:56:48,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:48,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:48,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:56:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:48,652 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-06 19:56:49,734 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 111 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-06 19:56:49,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:56:49,735 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 19:56:49,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:56:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:56:49,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:56:50,077 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-06 19:56:50,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:56:50,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-11-06 19:56:50,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-06 19:56:50,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-06 19:56:50,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-06 19:56:50,099 INFO L87 Difference]: Start difference. First operand 158462 states and 178052 transitions. Second operand 7 states. [2018-11-06 19:56:57,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:56:57,102 INFO L93 Difference]: Finished difference Result 490832 states and 552463 transitions. [2018-11-06 19:56:57,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-06 19:56:57,103 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 350 [2018-11-06 19:56:57,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:56:57,595 INFO L225 Difference]: With dead ends: 490832 [2018-11-06 19:56:57,595 INFO L226 Difference]: Without dead ends: 332366 [2018-11-06 19:56:57,765 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-11-06 19:56:58,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332366 states. [2018-11-06 19:57:04,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332366 to 331100. [2018-11-06 19:57:04,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331100 states. [2018-11-06 19:57:04,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331100 states to 331100 states and 362711 transitions. [2018-11-06 19:57:04,536 INFO L78 Accepts]: Start accepts. Automaton has 331100 states and 362711 transitions. Word has length 350 [2018-11-06 19:57:04,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:57:04,537 INFO L480 AbstractCegarLoop]: Abstraction has 331100 states and 362711 transitions. [2018-11-06 19:57:04,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-06 19:57:04,537 INFO L276 IsEmpty]: Start isEmpty. Operand 331100 states and 362711 transitions. [2018-11-06 19:57:04,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-11-06 19:57:04,600 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:57:04,600 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 19:57:04,601 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:57:04,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:57:04,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1657524425, now seen corresponding path program 1 times [2018-11-06 19:57:04,601 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:57:04,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:57:04,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:04,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:57:04,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:57:05,222 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-11-06 19:57:05,373 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2018-11-06 19:57:05,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:57:05,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-06 19:57:05,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 19:57:05,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 19:57:05,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:57:05,375 INFO L87 Difference]: Start difference. First operand 331100 states and 362711 transitions. Second operand 6 states. [2018-11-06 19:57:17,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:57:17,629 INFO L93 Difference]: Finished difference Result 1202642 states and 1309094 transitions. [2018-11-06 19:57:17,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 19:57:17,629 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 414 [2018-11-06 19:57:17,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:57:18,769 INFO L225 Difference]: With dead ends: 1202642 [2018-11-06 19:57:18,769 INFO L226 Difference]: Without dead ends: 871544 [2018-11-06 19:57:20,165 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-06 19:57:20,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871544 states. [2018-11-06 19:57:31,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871544 to 870676. [2018-11-06 19:57:31,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870676 states. [2018-11-06 19:57:32,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870676 states to 870676 states and 944357 transitions. [2018-11-06 19:57:32,522 INFO L78 Accepts]: Start accepts. Automaton has 870676 states and 944357 transitions. Word has length 414 [2018-11-06 19:57:32,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:57:32,522 INFO L480 AbstractCegarLoop]: Abstraction has 870676 states and 944357 transitions. [2018-11-06 19:57:32,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 19:57:32,522 INFO L276 IsEmpty]: Start isEmpty. Operand 870676 states and 944357 transitions. [2018-11-06 19:57:34,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2018-11-06 19:57:34,613 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:57:34,613 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 19:57:34,613 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:57:34,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:57:34,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1681683295, now seen corresponding path program 1 times [2018-11-06 19:57:34,614 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:57:34,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:57:34,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:34,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:57:34,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:57:34,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:57:35,003 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-11-06 19:57:35,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:57:35,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:57:35,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:57:35,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:57:35,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:57:35,005 INFO L87 Difference]: Start difference. First operand 870676 states and 944357 transitions. Second operand 5 states. [2018-11-06 19:57:53,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:57:53,992 INFO L93 Difference]: Finished difference Result 2249398 states and 2431434 transitions. [2018-11-06 19:57:53,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:57:53,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 416 [2018-11-06 19:57:53,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:57:56,189 INFO L225 Difference]: With dead ends: 2249398 [2018-11-06 19:57:56,189 INFO L226 Difference]: Without dead ends: 1378724 [2018-11-06 19:57:56,611 INFO L604 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-11-06 19:57:59,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378724 states. [2018-11-06 19:58:34,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378724 to 1269242. [2018-11-06 19:58:34,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1269242 states. [2018-11-06 19:58:37,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269242 states to 1269242 states and 1370861 transitions. [2018-11-06 19:58:37,072 INFO L78 Accepts]: Start accepts. Automaton has 1269242 states and 1370861 transitions. Word has length 416 [2018-11-06 19:58:37,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:58:37,073 INFO L480 AbstractCegarLoop]: Abstraction has 1269242 states and 1370861 transitions. [2018-11-06 19:58:37,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:58:37,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1269242 states and 1370861 transitions. [2018-11-06 19:58:40,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2018-11-06 19:58:40,037 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:58:40,037 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 19:58:40,037 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:58:40,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:58:40,038 INFO L82 PathProgramCache]: Analyzing trace with hash 893198241, now seen corresponding path program 1 times [2018-11-06 19:58:40,038 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:58:40,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:58:40,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:40,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:58:40,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:58:40,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:58:40,455 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 245 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2018-11-06 19:58:40,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:58:40,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:58:40,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:58:40,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:58:40,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:58:40,457 INFO L87 Difference]: Start difference. First operand 1269242 states and 1370861 transitions. Second operand 4 states. [2018-11-06 19:59:09,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:59:09,691 INFO L93 Difference]: Finished difference Result 3659012 states and 3938065 transitions. [2018-11-06 19:59:09,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:59:09,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 452 [2018-11-06 19:59:09,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:59:13,619 INFO L225 Difference]: With dead ends: 3659012 [2018-11-06 19:59:13,619 INFO L226 Difference]: Without dead ends: 2389772 Received shutdown request... [2018-11-06 19:59:15,530 INFO L604 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-11-06 19:59:16,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2389772 states. [2018-11-06 19:59:16,802 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 19:59:16,805 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 19:59:16,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:59:16 BoogieIcfgContainer [2018-11-06 19:59:16,806 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 19:59:16,807 INFO L168 Benchmark]: Toolchain (without parser) took 196799.27 ms. Allocated memory was 1.5 GB in the beginning and 7.1 GB in the end (delta: 5.6 GB). Free memory was 1.4 GB in the beginning and 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 4.7 GB. Max. memory is 7.1 GB. [2018-11-06 19:59:16,808 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-11-06 19:59:16,808 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1198.15 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-11-06 19:59:16,809 INFO L168 Benchmark]: Boogie Procedure Inliner took 334.22 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.3 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -849.6 MB). Peak memory consumption was 28.3 MB. Max. memory is 7.1 GB. [2018-11-06 19:59:16,810 INFO L168 Benchmark]: Boogie Preprocessor took 151.34 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 19:59:16,810 INFO L168 Benchmark]: RCFGBuilder took 5776.99 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: 275.8 MB). Peak memory consumption was 275.8 MB. Max. memory is 7.1 GB. [2018-11-06 19:59:16,811 INFO L168 Benchmark]: TraceAbstraction took 189333.90 ms. Allocated memory was 2.3 GB in the beginning and 7.1 GB in the end (delta: 4.9 GB). Free memory was 1.9 GB in the beginning and 3.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 4.4 GB. Max. memory is 7.1 GB. [2018-11-06 19:59:16,816 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 1198.15 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 334.22 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.3 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -849.6 MB). Peak memory consumption was 28.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 151.34 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 5776.99 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: 275.8 MB). Peak memory consumption was 275.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 189333.90 ms. Allocated memory was 2.3 GB in the beginning and 7.1 GB in the end (delta: 4.9 GB). Free memory was 1.9 GB in the beginning and 3.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 4.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1641]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1641). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 189.2s OverallTime, 17 OverallIterations, 7 TraceHistogramMax, 110.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4397 SDtfs, 12994 SDslu, 4755 SDs, 0 SdLazy, 17193 SolverSat, 3636 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 33.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 692 GetRequests, 646 SyntacticMatches, 8 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1269242occurred in iteration=16, 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: 65.8s AutomataMinimizationTime, 17 MinimizatonAttempts, 124497 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 5805 NumberOfCodeBlocks, 5805 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 5786 ConstructedInterpolants, 0 QuantifiedInterpolants, 3106999 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1158 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 19 InterpolantComputations, 17 PerfectInterpolantSequences, 3483/3497 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown