java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label45_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 13:17:32,731 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 13:17:32,735 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 13:17:32,749 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 13:17:32,749 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 13:17:32,750 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 13:17:32,752 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 13:17:32,755 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 13:17:32,758 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 13:17:32,764 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 13:17:32,765 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 13:17:32,766 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 13:17:32,766 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 13:17:32,770 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 13:17:32,773 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 13:17:32,774 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 13:17:32,775 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 13:17:32,776 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 13:17:32,783 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 13:17:32,785 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 13:17:32,787 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 13:17:32,788 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 13:17:32,791 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 13:17:32,791 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 13:17:32,791 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 13:17:32,792 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 13:17:32,793 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 13:17:32,794 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 13:17:32,795 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 13:17:32,797 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 13:17:32,798 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 13:17:32,799 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 13:17:32,800 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 13:17:32,800 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 13:17:32,801 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 13:17:32,803 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 13:17:32,803 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 13:17:32,832 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 13:17:32,832 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 13:17:32,834 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 13:17:32,834 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 13:17:32,835 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 13:17:32,835 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 13:17:32,835 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 13:17:32,835 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 13:17:32,835 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 13:17:32,836 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 13:17:32,837 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 13:17:32,837 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 13:17:32,837 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 13:17:32,837 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 13:17:32,837 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 13:17:32,839 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 13:17:32,839 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 13:17:32,839 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 13:17:32,839 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 13:17:32,839 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 13:17:32,840 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 13:17:32,840 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 13:17:32,840 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 13:17:32,840 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 13:17:32,840 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 13:17:32,840 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 13:17:32,841 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 13:17:32,841 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 13:17:32,898 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 13:17:32,910 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 13:17:32,915 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 13:17:32,916 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 13:17:32,917 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 13:17:32,919 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label45_false-unreach-call.c [2018-10-24 13:17:32,984 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ac9a8b63d/0abc41d6fc364bcdb9ef993a9d3a2b95/FLAGcae97e5ff [2018-10-24 13:17:33,619 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 13:17:33,620 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label45_false-unreach-call.c [2018-10-24 13:17:33,638 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ac9a8b63d/0abc41d6fc364bcdb9ef993a9d3a2b95/FLAGcae97e5ff [2018-10-24 13:17:33,654 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ac9a8b63d/0abc41d6fc364bcdb9ef993a9d3a2b95 [2018-10-24 13:17:33,665 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 13:17:33,667 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 13:17:33,668 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 13:17:33,669 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 13:17:33,674 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 13:17:33,675 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:17:33" (1/1) ... [2018-10-24 13:17:33,678 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@997f0a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:33, skipping insertion in model container [2018-10-24 13:17:33,678 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:17:33" (1/1) ... [2018-10-24 13:17:33,689 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 13:17:33,770 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 13:17:34,482 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 13:17:34,488 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 13:17:34,807 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 13:17:34,832 INFO L193 MainTranslator]: Completed translation [2018-10-24 13:17:34,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:34 WrapperNode [2018-10-24 13:17:34,833 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 13:17:34,834 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 13:17:34,834 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 13:17:34,834 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 13:17:34,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:34" (1/1) ... [2018-10-24 13:17:34,880 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:34" (1/1) ... [2018-10-24 13:17:35,145 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 13:17:35,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 13:17:35,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 13:17:35,147 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 13:17:35,158 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:34" (1/1) ... [2018-10-24 13:17:35,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:34" (1/1) ... [2018-10-24 13:17:35,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:34" (1/1) ... [2018-10-24 13:17:35,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:34" (1/1) ... [2018-10-24 13:17:35,241 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:34" (1/1) ... [2018-10-24 13:17:35,265 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:34" (1/1) ... [2018-10-24 13:17:35,291 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:34" (1/1) ... [2018-10-24 13:17:35,308 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 13:17:35,309 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 13:17:35,309 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 13:17:35,309 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 13:17:35,310 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 13:17:35,376 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 13:17:35,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 13:17:35,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 13:17:41,448 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 13:17:41,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:17:41 BoogieIcfgContainer [2018-10-24 13:17:41,449 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 13:17:41,450 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 13:17:41,450 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 13:17:41,453 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 13:17:41,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:17:33" (1/3) ... [2018-10-24 13:17:41,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56cb0ece and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:17:41, skipping insertion in model container [2018-10-24 13:17:41,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:17:34" (2/3) ... [2018-10-24 13:17:41,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56cb0ece and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:17:41, skipping insertion in model container [2018-10-24 13:17:41,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:17:41" (3/3) ... [2018-10-24 13:17:41,458 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label45_false-unreach-call.c [2018-10-24 13:17:41,468 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 13:17:41,478 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 13:17:41,496 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 13:17:41,534 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 13:17:41,535 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 13:17:41,535 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 13:17:41,536 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 13:17:41,536 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 13:17:41,536 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 13:17:41,536 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 13:17:41,536 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 13:17:41,537 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 13:17:41,563 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-24 13:17:41,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-24 13:17:41,583 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:41,584 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] [2018-10-24 13:17:41,587 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:41,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:41,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1272460738, now seen corresponding path program 1 times [2018-10-24 13:17:41,594 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:41,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:41,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:41,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:41,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:41,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:42,465 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-24 13:17:42,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 13:17:42,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:42,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:17:42,547 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:17:42,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:17:42,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:17:42,568 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-24 13:17:46,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:46,015 INFO L93 Difference]: Finished difference Result 1072 states and 1917 transitions. [2018-10-24 13:17:46,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:17:46,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2018-10-24 13:17:46,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:46,063 INFO L225 Difference]: With dead ends: 1072 [2018-10-24 13:17:46,063 INFO L226 Difference]: Without dead ends: 762 [2018-10-24 13:17:46,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:17:46,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2018-10-24 13:17:46,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 518. [2018-10-24 13:17:46,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-10-24 13:17:46,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 855 transitions. [2018-10-24 13:17:46,179 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 855 transitions. Word has length 145 [2018-10-24 13:17:46,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:46,181 INFO L481 AbstractCegarLoop]: Abstraction has 518 states and 855 transitions. [2018-10-24 13:17:46,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:17:46,181 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 855 transitions. [2018-10-24 13:17:46,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-24 13:17:46,192 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:46,192 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:17:46,194 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:46,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:46,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1408994801, now seen corresponding path program 1 times [2018-10-24 13:17:46,195 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:46,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:46,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:46,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:46,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:46,491 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 13:17:46,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:46,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:17:46,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:17:46,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:17:46,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:17:46,494 INFO L87 Difference]: Start difference. First operand 518 states and 855 transitions. Second operand 4 states. [2018-10-24 13:17:49,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:49,653 INFO L93 Difference]: Finished difference Result 1918 states and 3253 transitions. [2018-10-24 13:17:49,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:17:49,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2018-10-24 13:17:49,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:49,663 INFO L225 Difference]: With dead ends: 1918 [2018-10-24 13:17:49,664 INFO L226 Difference]: Without dead ends: 1402 [2018-10-24 13:17:49,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:17:49,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2018-10-24 13:17:49,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 933. [2018-10-24 13:17:49,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-10-24 13:17:49,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1472 transitions. [2018-10-24 13:17:49,709 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1472 transitions. Word has length 151 [2018-10-24 13:17:49,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:49,709 INFO L481 AbstractCegarLoop]: Abstraction has 933 states and 1472 transitions. [2018-10-24 13:17:49,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:17:49,710 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1472 transitions. [2018-10-24 13:17:49,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-24 13:17:49,714 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:49,714 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] [2018-10-24 13:17:49,715 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:49,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:49,715 INFO L82 PathProgramCache]: Analyzing trace with hash 470557859, now seen corresponding path program 1 times [2018-10-24 13:17:49,715 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:49,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:49,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:49,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:49,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:49,824 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 13:17:49,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:49,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 13:17:49,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:17:49,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:17:49,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:49,826 INFO L87 Difference]: Start difference. First operand 933 states and 1472 transitions. Second operand 3 states. [2018-10-24 13:17:54,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:54,583 INFO L93 Difference]: Finished difference Result 2699 states and 4315 transitions. [2018-10-24 13:17:54,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:17:54,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2018-10-24 13:17:54,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:54,595 INFO L225 Difference]: With dead ends: 2699 [2018-10-24 13:17:54,595 INFO L226 Difference]: Without dead ends: 1768 [2018-10-24 13:17:54,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:54,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2018-10-24 13:17:54,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1751. [2018-10-24 13:17:54,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1751 states. [2018-10-24 13:17:54,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1751 states and 2699 transitions. [2018-10-24 13:17:54,640 INFO L78 Accepts]: Start accepts. Automaton has 1751 states and 2699 transitions. Word has length 154 [2018-10-24 13:17:54,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:54,641 INFO L481 AbstractCegarLoop]: Abstraction has 1751 states and 2699 transitions. [2018-10-24 13:17:54,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:17:54,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2699 transitions. [2018-10-24 13:17:54,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-24 13:17:54,647 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:54,648 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:17:54,649 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:54,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:54,649 INFO L82 PathProgramCache]: Analyzing trace with hash 970264919, now seen corresponding path program 1 times [2018-10-24 13:17:54,649 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:54,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:54,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:54,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:54,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:54,835 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-24 13:17:54,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:54,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 13:17:54,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:17:54,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:17:54,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:54,837 INFO L87 Difference]: Start difference. First operand 1751 states and 2699 transitions. Second operand 3 states. [2018-10-24 13:17:56,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:56,480 INFO L93 Difference]: Finished difference Result 4329 states and 6639 transitions. [2018-10-24 13:17:56,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:17:56,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2018-10-24 13:17:56,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:56,496 INFO L225 Difference]: With dead ends: 4329 [2018-10-24 13:17:56,496 INFO L226 Difference]: Without dead ends: 2580 [2018-10-24 13:17:56,500 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:56,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2580 states. [2018-10-24 13:17:56,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 2579. [2018-10-24 13:17:56,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2579 states. [2018-10-24 13:17:56,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2579 states to 2579 states and 3884 transitions. [2018-10-24 13:17:56,564 INFO L78 Accepts]: Start accepts. Automaton has 2579 states and 3884 transitions. Word has length 162 [2018-10-24 13:17:56,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:56,564 INFO L481 AbstractCegarLoop]: Abstraction has 2579 states and 3884 transitions. [2018-10-24 13:17:56,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:17:56,565 INFO L276 IsEmpty]: Start isEmpty. Operand 2579 states and 3884 transitions. [2018-10-24 13:17:56,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-24 13:17:56,570 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:56,571 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] [2018-10-24 13:17:56,571 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:56,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:56,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1840830910, now seen corresponding path program 1 times [2018-10-24 13:17:56,572 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:56,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:56,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:56,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:56,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:56,794 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-24 13:17:56,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:17:56,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 13:17:56,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:17:56,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:17:56,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:56,796 INFO L87 Difference]: Start difference. First operand 2579 states and 3884 transitions. Second operand 3 states. [2018-10-24 13:17:57,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:17:57,994 INFO L93 Difference]: Finished difference Result 7713 states and 11623 transitions. [2018-10-24 13:17:57,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:17:57,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2018-10-24 13:17:57,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:17:58,022 INFO L225 Difference]: With dead ends: 7713 [2018-10-24 13:17:58,022 INFO L226 Difference]: Without dead ends: 5136 [2018-10-24 13:17:58,028 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:17:58,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5136 states. [2018-10-24 13:17:58,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5136 to 5133. [2018-10-24 13:17:58,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5133 states. [2018-10-24 13:17:58,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5133 states to 5133 states and 7720 transitions. [2018-10-24 13:17:58,146 INFO L78 Accepts]: Start accepts. Automaton has 5133 states and 7720 transitions. Word has length 168 [2018-10-24 13:17:58,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:17:58,146 INFO L481 AbstractCegarLoop]: Abstraction has 5133 states and 7720 transitions. [2018-10-24 13:17:58,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:17:58,147 INFO L276 IsEmpty]: Start isEmpty. Operand 5133 states and 7720 transitions. [2018-10-24 13:17:58,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-24 13:17:58,157 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:17:58,157 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:17:58,157 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:17:58,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:17:58,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1874553211, now seen corresponding path program 1 times [2018-10-24 13:17:58,158 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:17:58,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:17:58,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:58,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:58,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:17:58,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:58,515 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 31 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-24 13:17:58,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 13:17:58,516 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 13:17:58,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:17:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:17:58,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 13:17:58,694 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-24 13:17:58,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 13:17:58,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2018-10-24 13:17:58,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:17:58,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:17:58,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:17:58,730 INFO L87 Difference]: Start difference. First operand 5133 states and 7720 transitions. Second operand 4 states. [2018-10-24 13:18:02,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:02,204 INFO L93 Difference]: Finished difference Result 20487 states and 30826 transitions. [2018-10-24 13:18:02,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:18:02,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2018-10-24 13:18:02,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:02,293 INFO L225 Difference]: With dead ends: 20487 [2018-10-24 13:18:02,293 INFO L226 Difference]: Without dead ends: 15356 [2018-10-24 13:18:02,305 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 177 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:18:02,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15356 states. [2018-10-24 13:18:02,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15356 to 10229. [2018-10-24 13:18:02,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10229 states. [2018-10-24 13:18:02,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10229 states to 10229 states and 15363 transitions. [2018-10-24 13:18:02,554 INFO L78 Accepts]: Start accepts. Automaton has 10229 states and 15363 transitions. Word has length 177 [2018-10-24 13:18:02,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:02,554 INFO L481 AbstractCegarLoop]: Abstraction has 10229 states and 15363 transitions. [2018-10-24 13:18:02,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:18:02,555 INFO L276 IsEmpty]: Start isEmpty. Operand 10229 states and 15363 transitions. [2018-10-24 13:18:02,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-24 13:18:02,569 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:02,569 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] [2018-10-24 13:18:02,570 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:02,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:02,570 INFO L82 PathProgramCache]: Analyzing trace with hash 598732614, now seen corresponding path program 1 times [2018-10-24 13:18:02,570 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:02,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:02,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:02,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:02,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:02,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:03,176 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-24 13:18:03,228 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 13:18:03,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:18:03,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 13:18:03,229 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 13:18:03,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 13:18:03,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 13:18:03,235 INFO L87 Difference]: Start difference. First operand 10229 states and 15363 transitions. Second operand 5 states. [2018-10-24 13:18:10,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:10,692 INFO L93 Difference]: Finished difference Result 23029 states and 35010 transitions. [2018-10-24 13:18:10,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 13:18:10,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 185 [2018-10-24 13:18:10,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:10,729 INFO L225 Difference]: With dead ends: 23029 [2018-10-24 13:18:10,730 INFO L226 Difference]: Without dead ends: 12802 [2018-10-24 13:18:10,748 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 13:18:10,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12802 states. [2018-10-24 13:18:11,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12802 to 11045. [2018-10-24 13:18:11,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11045 states. [2018-10-24 13:18:11,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11045 states to 11045 states and 16559 transitions. [2018-10-24 13:18:11,046 INFO L78 Accepts]: Start accepts. Automaton has 11045 states and 16559 transitions. Word has length 185 [2018-10-24 13:18:11,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:11,046 INFO L481 AbstractCegarLoop]: Abstraction has 11045 states and 16559 transitions. [2018-10-24 13:18:11,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 13:18:11,047 INFO L276 IsEmpty]: Start isEmpty. Operand 11045 states and 16559 transitions. [2018-10-24 13:18:11,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-24 13:18:11,060 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:11,061 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 13:18:11,061 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:11,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:11,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1720192058, now seen corresponding path program 1 times [2018-10-24 13:18:11,062 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:11,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:11,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:11,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:11,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:11,311 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-10-24 13:18:11,336 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-24 13:18:11,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:18:11,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:18:11,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:18:11,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:18:11,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:18:11,338 INFO L87 Difference]: Start difference. First operand 11045 states and 16559 transitions. Second operand 4 states. [2018-10-24 13:18:15,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:15,226 INFO L93 Difference]: Finished difference Result 41022 states and 61357 transitions. [2018-10-24 13:18:15,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:18:15,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2018-10-24 13:18:15,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:15,304 INFO L225 Difference]: With dead ends: 41022 [2018-10-24 13:18:15,304 INFO L226 Difference]: Without dead ends: 29979 [2018-10-24 13:18:15,325 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:18:15,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29979 states. [2018-10-24 13:18:15,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29979 to 20440. [2018-10-24 13:18:15,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20440 states. [2018-10-24 13:18:15,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20440 states to 20440 states and 29051 transitions. [2018-10-24 13:18:15,668 INFO L78 Accepts]: Start accepts. Automaton has 20440 states and 29051 transitions. Word has length 185 [2018-10-24 13:18:15,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:15,669 INFO L481 AbstractCegarLoop]: Abstraction has 20440 states and 29051 transitions. [2018-10-24 13:18:15,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:18:15,669 INFO L276 IsEmpty]: Start isEmpty. Operand 20440 states and 29051 transitions. [2018-10-24 13:18:15,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-24 13:18:15,692 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:15,692 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:18:15,693 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:15,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:15,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1634157547, now seen corresponding path program 1 times [2018-10-24 13:18:15,693 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:15,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:15,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:15,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:15,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:15,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:15,820 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 13:18:15,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:18:15,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:18:15,821 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:18:15,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:18:15,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:18:15,822 INFO L87 Difference]: Start difference. First operand 20440 states and 29051 transitions. Second operand 3 states. [2018-10-24 13:18:17,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:17,346 INFO L93 Difference]: Finished difference Result 40906 states and 58154 transitions. [2018-10-24 13:18:17,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:18:17,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2018-10-24 13:18:17,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:17,376 INFO L225 Difference]: With dead ends: 40906 [2018-10-24 13:18:17,377 INFO L226 Difference]: Without dead ends: 20468 [2018-10-24 13:18:17,402 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:18:17,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20468 states. [2018-10-24 13:18:17,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20468 to 20440. [2018-10-24 13:18:17,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20440 states. [2018-10-24 13:18:17,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20440 states to 20440 states and 27343 transitions. [2018-10-24 13:18:17,819 INFO L78 Accepts]: Start accepts. Automaton has 20440 states and 27343 transitions. Word has length 186 [2018-10-24 13:18:17,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:17,819 INFO L481 AbstractCegarLoop]: Abstraction has 20440 states and 27343 transitions. [2018-10-24 13:18:17,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:18:17,819 INFO L276 IsEmpty]: Start isEmpty. Operand 20440 states and 27343 transitions. [2018-10-24 13:18:17,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-24 13:18:17,842 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:17,843 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:18:17,843 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:17,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:17,844 INFO L82 PathProgramCache]: Analyzing trace with hash -394781917, now seen corresponding path program 1 times [2018-10-24 13:18:17,844 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:17,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:17,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:17,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:17,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:17,974 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-24 13:18:17,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:18:17,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:18:17,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:18:17,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:18:17,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:18:17,977 INFO L87 Difference]: Start difference. First operand 20440 states and 27343 transitions. Second operand 3 states. [2018-10-24 13:18:19,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:19,484 INFO L93 Difference]: Finished difference Result 57404 states and 76442 transitions. [2018-10-24 13:18:19,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:18:19,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2018-10-24 13:18:19,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:19,523 INFO L225 Difference]: With dead ends: 57404 [2018-10-24 13:18:19,523 INFO L226 Difference]: Without dead ends: 36966 [2018-10-24 13:18:19,543 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:18:19,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36966 states. [2018-10-24 13:18:19,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36966 to 36958. [2018-10-24 13:18:19,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36958 states. [2018-10-24 13:18:20,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36958 states to 36958 states and 44611 transitions. [2018-10-24 13:18:20,030 INFO L78 Accepts]: Start accepts. Automaton has 36958 states and 44611 transitions. Word has length 193 [2018-10-24 13:18:20,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:20,031 INFO L481 AbstractCegarLoop]: Abstraction has 36958 states and 44611 transitions. [2018-10-24 13:18:20,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:18:20,032 INFO L276 IsEmpty]: Start isEmpty. Operand 36958 states and 44611 transitions. [2018-10-24 13:18:20,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-24 13:18:20,062 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:20,062 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:18:20,062 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:20,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:20,063 INFO L82 PathProgramCache]: Analyzing trace with hash 576159644, now seen corresponding path program 1 times [2018-10-24 13:18:20,063 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:20,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:20,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:20,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:20,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:20,391 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 13:18:20,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:18:20,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:18:20,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:18:20,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:18:20,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:18:20,393 INFO L87 Difference]: Start difference. First operand 36958 states and 44611 transitions. Second operand 4 states. [2018-10-24 13:18:22,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:22,646 INFO L93 Difference]: Finished difference Result 87182 states and 106671 transitions. [2018-10-24 13:18:22,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:18:22,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2018-10-24 13:18:22,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:22,711 INFO L225 Difference]: With dead ends: 87182 [2018-10-24 13:18:22,711 INFO L226 Difference]: Without dead ends: 50226 [2018-10-24 13:18:22,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:18:22,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50226 states. [2018-10-24 13:18:23,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50226 to 50218. [2018-10-24 13:18:23,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50218 states. [2018-10-24 13:18:23,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50218 states to 50218 states and 59044 transitions. [2018-10-24 13:18:23,735 INFO L78 Accepts]: Start accepts. Automaton has 50218 states and 59044 transitions. Word has length 201 [2018-10-24 13:18:23,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:23,735 INFO L481 AbstractCegarLoop]: Abstraction has 50218 states and 59044 transitions. [2018-10-24 13:18:23,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:18:23,735 INFO L276 IsEmpty]: Start isEmpty. Operand 50218 states and 59044 transitions. [2018-10-24 13:18:23,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-10-24 13:18:23,762 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:23,763 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:18:23,763 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:23,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:23,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1703859263, now seen corresponding path program 1 times [2018-10-24 13:18:23,763 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:23,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:23,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:23,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:23,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:23,957 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-24 13:18:23,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:18:23,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 13:18:23,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:18:23,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:18:23,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:18:23,959 INFO L87 Difference]: Start difference. First operand 50218 states and 59044 transitions. Second operand 3 states. [2018-10-24 13:18:24,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:24,881 INFO L93 Difference]: Finished difference Result 99538 states and 116952 transitions. [2018-10-24 13:18:24,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:18:24,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2018-10-24 13:18:24,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:24,927 INFO L225 Difference]: With dead ends: 99538 [2018-10-24 13:18:24,927 INFO L226 Difference]: Without dead ends: 49322 [2018-10-24 13:18:24,955 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:18:24,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49322 states. [2018-10-24 13:18:25,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49322 to 49322. [2018-10-24 13:18:25,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49322 states. [2018-10-24 13:18:25,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49322 states to 49322 states and 57402 transitions. [2018-10-24 13:18:25,496 INFO L78 Accepts]: Start accepts. Automaton has 49322 states and 57402 transitions. Word has length 235 [2018-10-24 13:18:25,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:25,497 INFO L481 AbstractCegarLoop]: Abstraction has 49322 states and 57402 transitions. [2018-10-24 13:18:25,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:18:25,497 INFO L276 IsEmpty]: Start isEmpty. Operand 49322 states and 57402 transitions. [2018-10-24 13:18:25,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-10-24 13:18:25,509 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:25,509 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:18:25,510 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:25,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:25,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1273999016, now seen corresponding path program 1 times [2018-10-24 13:18:25,510 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:25,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:25,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:25,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:25,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:25,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:25,697 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-24 13:18:25,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:18:25,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:18:25,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:18:25,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:18:25,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:18:25,699 INFO L87 Difference]: Start difference. First operand 49322 states and 57402 transitions. Second operand 4 states. [2018-10-24 13:18:28,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:28,230 INFO L93 Difference]: Finished difference Result 162853 states and 187890 transitions. [2018-10-24 13:18:28,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:18:28,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 245 [2018-10-24 13:18:28,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:28,386 INFO L225 Difference]: With dead ends: 162853 [2018-10-24 13:18:28,386 INFO L226 Difference]: Without dead ends: 113533 [2018-10-24 13:18:28,444 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:18:28,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113533 states. [2018-10-24 13:18:29,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113533 to 83184. [2018-10-24 13:18:29,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83184 states. [2018-10-24 13:18:29,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83184 states to 83184 states and 95221 transitions. [2018-10-24 13:18:29,353 INFO L78 Accepts]: Start accepts. Automaton has 83184 states and 95221 transitions. Word has length 245 [2018-10-24 13:18:29,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:29,353 INFO L481 AbstractCegarLoop]: Abstraction has 83184 states and 95221 transitions. [2018-10-24 13:18:29,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:18:29,353 INFO L276 IsEmpty]: Start isEmpty. Operand 83184 states and 95221 transitions. [2018-10-24 13:18:29,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-10-24 13:18:29,370 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:29,370 INFO L375 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 13:18:29,370 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:29,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:29,371 INFO L82 PathProgramCache]: Analyzing trace with hash -507780283, now seen corresponding path program 1 times [2018-10-24 13:18:29,371 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:29,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:29,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:29,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:29,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:29,562 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-24 13:18:29,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:18:29,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 13:18:29,564 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:18:29,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:18:29,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:18:29,564 INFO L87 Difference]: Start difference. First operand 83184 states and 95221 transitions. Second operand 3 states. [2018-10-24 13:18:32,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:32,241 INFO L93 Difference]: Finished difference Result 166358 states and 190432 transitions. [2018-10-24 13:18:32,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:18:32,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 273 [2018-10-24 13:18:32,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:33,365 INFO L225 Difference]: With dead ends: 166358 [2018-10-24 13:18:33,366 INFO L226 Difference]: Without dead ends: 83176 [2018-10-24 13:18:33,398 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:18:33,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83176 states. [2018-10-24 13:18:34,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83176 to 83176. [2018-10-24 13:18:34,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83176 states. [2018-10-24 13:18:34,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83176 states to 83176 states and 95205 transitions. [2018-10-24 13:18:34,205 INFO L78 Accepts]: Start accepts. Automaton has 83176 states and 95205 transitions. Word has length 273 [2018-10-24 13:18:34,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:34,206 INFO L481 AbstractCegarLoop]: Abstraction has 83176 states and 95205 transitions. [2018-10-24 13:18:34,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:18:34,206 INFO L276 IsEmpty]: Start isEmpty. Operand 83176 states and 95205 transitions. [2018-10-24 13:18:34,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-10-24 13:18:34,227 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:34,228 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:18:34,228 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:34,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:34,228 INFO L82 PathProgramCache]: Analyzing trace with hash -2102083729, now seen corresponding path program 1 times [2018-10-24 13:18:34,228 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:34,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:34,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:34,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:34,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:34,555 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-24 13:18:34,751 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 106 proven. 4 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-10-24 13:18:34,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 13:18:34,752 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 13:18:34,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:34,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 13:18:35,048 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-10-24 13:18:35,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 13:18:35,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-10-24 13:18:35,071 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 13:18:35,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 13:18:35,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-24 13:18:35,072 INFO L87 Difference]: Start difference. First operand 83176 states and 95205 transitions. Second operand 6 states. [2018-10-24 13:18:40,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:40,814 INFO L93 Difference]: Finished difference Result 244831 states and 280408 transitions. [2018-10-24 13:18:40,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 13:18:40,814 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 280 [2018-10-24 13:18:40,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:41,002 INFO L225 Difference]: With dead ends: 244831 [2018-10-24 13:18:41,003 INFO L226 Difference]: Without dead ends: 161657 [2018-10-24 13:18:41,062 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-24 13:18:41,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161657 states. [2018-10-24 13:18:42,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161657 to 160366. [2018-10-24 13:18:42,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160366 states. [2018-10-24 13:18:42,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160366 states to 160366 states and 179182 transitions. [2018-10-24 13:18:42,741 INFO L78 Accepts]: Start accepts. Automaton has 160366 states and 179182 transitions. Word has length 280 [2018-10-24 13:18:42,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:42,742 INFO L481 AbstractCegarLoop]: Abstraction has 160366 states and 179182 transitions. [2018-10-24 13:18:42,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 13:18:42,742 INFO L276 IsEmpty]: Start isEmpty. Operand 160366 states and 179182 transitions. [2018-10-24 13:18:42,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-10-24 13:18:42,766 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:42,767 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 13:18:42,767 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:42,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:42,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1814311929, now seen corresponding path program 1 times [2018-10-24 13:18:42,768 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:42,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:42,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:42,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:42,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:42,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:43,262 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 13:18:43,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:18:43,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 13:18:43,263 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:18:43,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:18:43,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:18:43,264 INFO L87 Difference]: Start difference. First operand 160366 states and 179182 transitions. Second operand 4 states. [2018-10-24 13:18:47,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:47,549 INFO L93 Difference]: Finished difference Result 604415 states and 675088 transitions. [2018-10-24 13:18:47,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:18:47,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 288 [2018-10-24 13:18:47,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:48,132 INFO L225 Difference]: With dead ends: 604415 [2018-10-24 13:18:48,133 INFO L226 Difference]: Without dead ends: 444051 [2018-10-24 13:18:48,262 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:18:48,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444051 states. [2018-10-24 13:18:52,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444051 to 297594. [2018-10-24 13:18:52,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297594 states. [2018-10-24 13:18:53,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297594 states to 297594 states and 332385 transitions. [2018-10-24 13:18:53,359 INFO L78 Accepts]: Start accepts. Automaton has 297594 states and 332385 transitions. Word has length 288 [2018-10-24 13:18:53,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:18:53,360 INFO L481 AbstractCegarLoop]: Abstraction has 297594 states and 332385 transitions. [2018-10-24 13:18:53,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:18:53,360 INFO L276 IsEmpty]: Start isEmpty. Operand 297594 states and 332385 transitions. [2018-10-24 13:18:53,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-10-24 13:18:53,384 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:18:53,384 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 13:18:53,385 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:18:53,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:18:53,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1462176291, now seen corresponding path program 1 times [2018-10-24 13:18:53,385 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:18:53,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:18:53,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:53,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:18:53,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:18:53,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:18:55,014 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 13:18:55,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:18:55,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 13:18:55,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:18:55,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:18:55,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:18:55,016 INFO L87 Difference]: Start difference. First operand 297594 states and 332385 transitions. Second operand 4 states. [2018-10-24 13:18:59,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:18:59,087 INFO L93 Difference]: Finished difference Result 545794 states and 611298 transitions. [2018-10-24 13:18:59,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:18:59,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 294 [2018-10-24 13:18:59,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:18:59,473 INFO L225 Difference]: With dead ends: 545794 [2018-10-24 13:18:59,473 INFO L226 Difference]: Without dead ends: 248202 [2018-10-24 13:18:59,627 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:18:59,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248202 states. [2018-10-24 13:19:09,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248202 to 243492. [2018-10-24 13:19:09,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243492 states. [2018-10-24 13:19:09,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243492 states to 243492 states and 269937 transitions. [2018-10-24 13:19:09,884 INFO L78 Accepts]: Start accepts. Automaton has 243492 states and 269937 transitions. Word has length 294 [2018-10-24 13:19:09,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:19:09,884 INFO L481 AbstractCegarLoop]: Abstraction has 243492 states and 269937 transitions. [2018-10-24 13:19:09,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:19:09,884 INFO L276 IsEmpty]: Start isEmpty. Operand 243492 states and 269937 transitions. [2018-10-24 13:19:09,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-10-24 13:19:09,914 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:19:09,914 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:19:09,915 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:19:09,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:19:09,915 INFO L82 PathProgramCache]: Analyzing trace with hash -72322090, now seen corresponding path program 1 times [2018-10-24 13:19:09,915 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:19:09,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:19:09,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:19:09,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:19:09,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:19:09,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:19:10,209 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2018-10-24 13:19:10,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:19:10,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:19:10,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:19:10,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:19:10,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:19:10,211 INFO L87 Difference]: Start difference. First operand 243492 states and 269937 transitions. Second operand 4 states. [2018-10-24 13:19:13,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:19:13,752 INFO L93 Difference]: Finished difference Result 507072 states and 562986 transitions. [2018-10-24 13:19:13,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:19:13,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 324 [2018-10-24 13:19:13,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:19:14,138 INFO L225 Difference]: With dead ends: 507072 [2018-10-24 13:19:14,138 INFO L226 Difference]: Without dead ends: 263582 [2018-10-24 13:19:15,486 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:19:15,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263582 states. [2018-10-24 13:19:18,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263582 to 260262. [2018-10-24 13:19:18,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260262 states. [2018-10-24 13:19:19,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260262 states to 260262 states and 287743 transitions. [2018-10-24 13:19:19,044 INFO L78 Accepts]: Start accepts. Automaton has 260262 states and 287743 transitions. Word has length 324 [2018-10-24 13:19:19,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:19:19,044 INFO L481 AbstractCegarLoop]: Abstraction has 260262 states and 287743 transitions. [2018-10-24 13:19:19,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:19:19,044 INFO L276 IsEmpty]: Start isEmpty. Operand 260262 states and 287743 transitions. [2018-10-24 13:19:19,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-10-24 13:19:19,075 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:19:19,075 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:19:19,075 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:19:19,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:19:19,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1893998904, now seen corresponding path program 1 times [2018-10-24 13:19:19,076 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:19:19,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:19:19,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:19:19,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:19:19,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:19:19,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:19:19,329 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-10-24 13:19:19,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:19:19,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 13:19:19,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:19:19,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:19:19,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:19:19,331 INFO L87 Difference]: Start difference. First operand 260262 states and 287743 transitions. Second operand 3 states. [2018-10-24 13:19:23,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:19:23,311 INFO L93 Difference]: Finished difference Result 701128 states and 772302 transitions. [2018-10-24 13:19:23,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:19:23,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2018-10-24 13:19:23,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:19:23,988 INFO L225 Difference]: With dead ends: 701128 [2018-10-24 13:19:23,988 INFO L226 Difference]: Without dead ends: 440868 [2018-10-24 13:19:24,175 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:19:24,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440868 states. [2018-10-24 13:19:30,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440868 to 439234. [2018-10-24 13:19:30,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439234 states. [2018-10-24 13:19:31,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439234 states to 439234 states and 482806 transitions. [2018-10-24 13:19:31,100 INFO L78 Accepts]: Start accepts. Automaton has 439234 states and 482806 transitions. Word has length 324 [2018-10-24 13:19:31,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:19:31,100 INFO L481 AbstractCegarLoop]: Abstraction has 439234 states and 482806 transitions. [2018-10-24 13:19:31,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:19:31,100 INFO L276 IsEmpty]: Start isEmpty. Operand 439234 states and 482806 transitions. [2018-10-24 13:19:31,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-10-24 13:19:31,134 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:19:31,134 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 13:19:31,134 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:19:31,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:19:31,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1006802306, now seen corresponding path program 1 times [2018-10-24 13:19:31,135 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:19:31,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:19:31,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:19:31,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:19:31,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:19:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:19:32,810 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-24 13:19:32,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:19:32,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:19:32,811 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:19:32,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:19:32,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:19:32,811 INFO L87 Difference]: Start difference. First operand 439234 states and 482806 transitions. Second operand 3 states. [2018-10-24 13:19:44,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:19:44,068 INFO L93 Difference]: Finished difference Result 881292 states and 968682 transitions. [2018-10-24 13:19:44,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:19:44,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 339 [2018-10-24 13:19:44,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:19:44,587 INFO L225 Difference]: With dead ends: 881292 [2018-10-24 13:19:44,587 INFO L226 Difference]: Without dead ends: 442060 [2018-10-24 13:19:44,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:19:45,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442060 states. [2018-10-24 13:19:50,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442060 to 442048. [2018-10-24 13:19:50,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442048 states. [2018-10-24 13:19:51,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442048 states to 442048 states and 484616 transitions. [2018-10-24 13:19:51,805 INFO L78 Accepts]: Start accepts. Automaton has 442048 states and 484616 transitions. Word has length 339 [2018-10-24 13:19:51,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:19:51,806 INFO L481 AbstractCegarLoop]: Abstraction has 442048 states and 484616 transitions. [2018-10-24 13:19:51,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:19:51,806 INFO L276 IsEmpty]: Start isEmpty. Operand 442048 states and 484616 transitions. [2018-10-24 13:19:51,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-10-24 13:19:51,845 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:19:51,845 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 13:19:51,846 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:19:51,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:19:51,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1693244667, now seen corresponding path program 1 times [2018-10-24 13:19:51,846 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:19:51,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:19:51,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:19:51,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:19:51,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:19:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:19:52,134 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2018-10-24 13:19:52,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:19:52,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:19:52,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 13:19:52,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 13:19:52,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:19:52,135 INFO L87 Difference]: Start difference. First operand 442048 states and 484616 transitions. Second operand 4 states. [2018-10-24 13:20:01,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:20:01,260 INFO L93 Difference]: Finished difference Result 1534562 states and 1680604 transitions. [2018-10-24 13:20:01,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 13:20:01,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 352 [2018-10-24 13:20:01,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:20:02,974 INFO L225 Difference]: With dead ends: 1534562 [2018-10-24 13:20:02,974 INFO L226 Difference]: Without dead ends: 1092516 [2018-10-24 13:20:03,316 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 13:20:04,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092516 states. [2018-10-24 13:20:17,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092516 to 676836. [2018-10-24 13:20:17,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676836 states. [2018-10-24 13:20:34,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676836 states to 676836 states and 740434 transitions. [2018-10-24 13:20:34,843 INFO L78 Accepts]: Start accepts. Automaton has 676836 states and 740434 transitions. Word has length 352 [2018-10-24 13:20:34,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:20:34,843 INFO L481 AbstractCegarLoop]: Abstraction has 676836 states and 740434 transitions. [2018-10-24 13:20:34,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 13:20:34,844 INFO L276 IsEmpty]: Start isEmpty. Operand 676836 states and 740434 transitions. [2018-10-24 13:20:34,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-10-24 13:20:34,877 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:20:34,877 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 13:20:34,877 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:20:34,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:20:34,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1071552378, now seen corresponding path program 1 times [2018-10-24 13:20:34,878 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:20:34,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:20:34,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:20:34,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:20:34,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:20:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 13:20:35,219 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-10-24 13:20:35,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 13:20:35,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 13:20:35,220 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 13:20:35,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 13:20:35,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:20:35,221 INFO L87 Difference]: Start difference. First operand 676836 states and 740434 transitions. Second operand 3 states. [2018-10-24 13:20:40,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 13:20:40,727 INFO L93 Difference]: Finished difference Result 1166968 states and 1279242 transitions. [2018-10-24 13:20:40,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 13:20:40,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 353 [2018-10-24 13:20:40,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 13:20:41,379 INFO L225 Difference]: With dead ends: 1166968 [2018-10-24 13:20:41,379 INFO L226 Difference]: Without dead ends: 490134 [2018-10-24 13:20:41,611 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 13:20:43,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490134 states. [2018-10-24 13:20:48,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490134 to 352036. [2018-10-24 13:20:48,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352036 states. [2018-10-24 13:20:48,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352036 states to 352036 states and 380449 transitions. [2018-10-24 13:20:48,653 INFO L78 Accepts]: Start accepts. Automaton has 352036 states and 380449 transitions. Word has length 353 [2018-10-24 13:20:48,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 13:20:48,654 INFO L481 AbstractCegarLoop]: Abstraction has 352036 states and 380449 transitions. [2018-10-24 13:20:48,654 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 13:20:48,654 INFO L276 IsEmpty]: Start isEmpty. Operand 352036 states and 380449 transitions. [2018-10-24 13:20:48,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 559 [2018-10-24 13:20:48,770 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 13:20:48,771 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-10-24 13:20:48,771 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 13:20:48,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 13:20:48,771 INFO L82 PathProgramCache]: Analyzing trace with hash 954484116, now seen corresponding path program 1 times [2018-10-24 13:20:48,771 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 13:20:48,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 13:20:48,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:20:48,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 13:20:48,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 13:20:49,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-10-24 13:20:50,045 WARN L187 SmtUtils]: Removed 1 from assertion stack [2018-10-24 13:20:50,045 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 13:20:50,050 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 13:20:50,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 01:20:50 BoogieIcfgContainer [2018-10-24 13:20:50,051 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 13:20:50,052 INFO L168 Benchmark]: Toolchain (without parser) took 196385.98 ms. Allocated memory was 1.5 GB in the beginning and 7.2 GB in the end (delta: 5.7 GB). Free memory was 1.4 GB in the beginning and 3.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.9 GB. Max. memory is 7.1 GB. [2018-10-24 13:20:50,053 INFO L168 Benchmark]: CDTParser took 1.53 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 13:20:50,053 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1165.13 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-24 13:20:50,054 INFO L168 Benchmark]: Boogie Procedure Inliner took 311.03 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 764.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -887.9 MB). Peak memory consumption was 40.2 MB. Max. memory is 7.1 GB. [2018-10-24 13:20:50,055 INFO L168 Benchmark]: Boogie Preprocessor took 163.24 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2018-10-24 13:20:50,056 INFO L168 Benchmark]: RCFGBuilder took 6140.06 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 255.5 MB). Peak memory consumption was 255.5 MB. Max. memory is 7.1 GB. [2018-10-24 13:20:50,057 INFO L168 Benchmark]: TraceAbstraction took 188600.80 ms. Allocated memory was 2.3 GB in the beginning and 7.2 GB in the end (delta: 4.9 GB). Free memory was 2.0 GB in the beginning and 3.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 3.7 GB. Max. memory is 7.1 GB. [2018-10-24 13:20:50,062 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.53 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1165.13 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 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 311.03 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 764.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -887.9 MB). Peak memory consumption was 40.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 163.24 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 6140.06 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 255.5 MB). Peak memory consumption was 255.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 188600.80 ms. Allocated memory was 2.3 GB in the beginning and 7.2 GB in the end (delta: 4.9 GB). Free memory was 2.0 GB in the beginning and 3.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 3.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1467]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1467). Cancelled while BasicCegarLoop was analyzing trace of length 559 with TraceHistMax 6,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 8. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 188.5s OverallTime, 23 OverallIterations, 6 TraceHistogramMax, 97.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6391 SDtfs, 13352 SDslu, 5451 SDs, 0 SdLazy, 17902 SolverSat, 3949 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 44.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 536 GetRequests, 487 SyntacticMatches, 8 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=676836occurred in iteration=21, 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: 78.5s AutomataMinimizationTime, 22 MinimizatonAttempts, 758752 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 5671 NumberOfCodeBlocks, 5671 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 5647 ConstructedInterpolants, 0 QuantifiedInterpolants, 2595970 SizeOfPredicates, 1 NumberOfNonLiveVariables, 960 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 24 InterpolantComputations, 22 PerfectInterpolantSequences, 3260/3274 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown