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_label59_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 15:02:53,903 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 15:02:53,908 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 15:02:53,931 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 15:02:53,931 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 15:02:53,932 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 15:02:53,934 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 15:02:53,937 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 15:02:53,939 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 15:02:53,941 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 15:02:53,943 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 15:02:53,944 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 15:02:53,945 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 15:02:53,946 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 15:02:53,953 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 15:02:53,954 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 15:02:53,957 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 15:02:53,963 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 15:02:53,965 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 15:02:53,966 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 15:02:53,971 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 15:02:53,973 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 15:02:53,976 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 15:02:53,980 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 15:02:53,981 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 15:02:53,982 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 15:02:53,983 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 15:02:53,983 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 15:02:53,984 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 15:02:53,989 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 15:02:53,989 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 15:02:53,991 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 15:02:53,991 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 15:02:53,991 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 15:02:53,992 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 15:02:53,993 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 15:02:53,994 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 15:02:54,022 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 15:02:54,023 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 15:02:54,024 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 15:02:54,024 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 15:02:54,025 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 15:02:54,025 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 15:02:54,026 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 15:02:54,026 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 15:02:54,026 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 15:02:54,026 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 15:02:54,026 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 15:02:54,028 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 15:02:54,028 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 15:02:54,028 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 15:02:54,028 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 15:02:54,029 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 15:02:54,029 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 15:02:54,029 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 15:02:54,029 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 15:02:54,029 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 15:02:54,030 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 15:02:54,031 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 15:02:54,031 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 15:02:54,031 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 15:02:54,031 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 15:02:54,032 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 15:02:54,032 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 15:02:54,032 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 15:02:54,096 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 15:02:54,114 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 15:02:54,118 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 15:02:54,120 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 15:02:54,120 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 15:02:54,121 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label59_true-unreach-call.c [2018-10-24 15:02:54,189 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e1c3d74fa/7b3b42817131464a84777854da972a1d/FLAG4fc7857c9 [2018-10-24 15:02:54,924 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 15:02:54,925 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label59_true-unreach-call.c [2018-10-24 15:02:54,945 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e1c3d74fa/7b3b42817131464a84777854da972a1d/FLAG4fc7857c9 [2018-10-24 15:02:54,963 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e1c3d74fa/7b3b42817131464a84777854da972a1d [2018-10-24 15:02:54,976 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 15:02:54,978 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 15:02:54,979 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 15:02:54,979 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 15:02:54,983 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 15:02:54,984 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:02:54" (1/1) ... [2018-10-24 15:02:54,988 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5086d3ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:02:54, skipping insertion in model container [2018-10-24 15:02:54,988 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:02:54" (1/1) ... [2018-10-24 15:02:54,999 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 15:02:55,087 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 15:02:55,767 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 15:02:55,773 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 15:02:56,075 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 15:02:56,099 INFO L193 MainTranslator]: Completed translation [2018-10-24 15:02:56,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:02:56 WrapperNode [2018-10-24 15:02:56,101 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 15:02:56,102 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 15:02:56,102 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 15:02:56,102 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 15:02:56,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:02:56" (1/1) ... [2018-10-24 15:02:56,164 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:02:56" (1/1) ... [2018-10-24 15:02:56,398 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 15:02:56,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 15:02:56,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 15:02:56,399 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 15:02:56,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:02:56" (1/1) ... [2018-10-24 15:02:56,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:02:56" (1/1) ... [2018-10-24 15:02:56,417 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:02:56" (1/1) ... [2018-10-24 15:02:56,417 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:02:56" (1/1) ... [2018-10-24 15:02:56,458 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:02:56" (1/1) ... [2018-10-24 15:02:56,472 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:02:56" (1/1) ... [2018-10-24 15:02:56,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:02:56" (1/1) ... [2018-10-24 15:02:56,497 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 15:02:56,498 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 15:02:56,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 15:02:56,498 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 15:02:56,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:02:56" (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 15:02:56,560 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 15:02:56,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 15:02:56,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 15:03:02,424 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 15:03:02,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:03:02 BoogieIcfgContainer [2018-10-24 15:03:02,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 15:03:02,427 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 15:03:02,427 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 15:03:02,431 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 15:03:02,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:02:54" (1/3) ... [2018-10-24 15:03:02,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c75ccda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:03:02, skipping insertion in model container [2018-10-24 15:03:02,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:02:56" (2/3) ... [2018-10-24 15:03:02,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c75ccda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:03:02, skipping insertion in model container [2018-10-24 15:03:02,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:03:02" (3/3) ... [2018-10-24 15:03:02,435 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label59_true-unreach-call.c [2018-10-24 15:03:02,447 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 15:03:02,457 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 15:03:02,476 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 15:03:02,517 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 15:03:02,518 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 15:03:02,518 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 15:03:02,518 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 15:03:02,519 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 15:03:02,519 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 15:03:02,519 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 15:03:02,519 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 15:03:02,519 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 15:03:02,548 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states. [2018-10-24 15:03:02,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-24 15:03:02,571 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:03:02,572 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:03:02,576 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:03:02,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:03:02,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1588100358, now seen corresponding path program 1 times [2018-10-24 15:03:02,584 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:03:02,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:03:02,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:02,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:03:02,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:02,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:03:03,611 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 15:03:03,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:03:03,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:03:03,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:03:03,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:03:03,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:03:03,643 INFO L87 Difference]: Start difference. First operand 303 states. Second operand 4 states. [2018-10-24 15:03:07,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:03:07,116 INFO L93 Difference]: Finished difference Result 1089 states and 1954 transitions. [2018-10-24 15:03:07,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:03:07,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2018-10-24 15:03:07,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:03:07,232 INFO L225 Difference]: With dead ends: 1089 [2018-10-24 15:03:07,232 INFO L226 Difference]: Without dead ends: 779 [2018-10-24 15:03:07,238 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 15:03:07,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-10-24 15:03:07,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 515. [2018-10-24 15:03:07,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-10-24 15:03:07,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 887 transitions. [2018-10-24 15:03:07,362 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 887 transitions. Word has length 175 [2018-10-24 15:03:07,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:03:07,364 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 887 transitions. [2018-10-24 15:03:07,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:03:07,365 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 887 transitions. [2018-10-24 15:03:07,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-24 15:03:07,373 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:03:07,374 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:03:07,374 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:03:07,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:03:07,376 INFO L82 PathProgramCache]: Analyzing trace with hash -439509271, now seen corresponding path program 1 times [2018-10-24 15:03:07,376 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:03:07,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:03:07,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:07,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:03:07,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:03:07,704 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 15:03:07,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:03:07,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:03:07,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:03:07,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:03:07,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:03:07,709 INFO L87 Difference]: Start difference. First operand 515 states and 887 transitions. Second operand 4 states. [2018-10-24 15:03:12,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:03:12,489 INFO L93 Difference]: Finished difference Result 1904 states and 3379 transitions. [2018-10-24 15:03:12,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:03:12,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2018-10-24 15:03:12,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:03:12,499 INFO L225 Difference]: With dead ends: 1904 [2018-10-24 15:03:12,499 INFO L226 Difference]: Without dead ends: 1391 [2018-10-24 15:03:12,502 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 15:03:12,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2018-10-24 15:03:12,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 927. [2018-10-24 15:03:12,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-10-24 15:03:12,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1521 transitions. [2018-10-24 15:03:12,540 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1521 transitions. Word has length 181 [2018-10-24 15:03:12,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:03:12,541 INFO L481 AbstractCegarLoop]: Abstraction has 927 states and 1521 transitions. [2018-10-24 15:03:12,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:03:12,541 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1521 transitions. [2018-10-24 15:03:12,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-24 15:03:12,545 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:03:12,545 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:03:12,546 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:03:12,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:03:12,546 INFO L82 PathProgramCache]: Analyzing trace with hash 980035246, now seen corresponding path program 1 times [2018-10-24 15:03:12,546 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:03:12,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:03:12,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:12,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:03:12,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:12,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:03:12,640 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:03:12,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:03:12,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 15:03:12,642 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:03:12,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:03:12,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:03:12,642 INFO L87 Difference]: Start difference. First operand 927 states and 1521 transitions. Second operand 3 states. [2018-10-24 15:03:14,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:03:14,441 INFO L93 Difference]: Finished difference Result 2712 states and 4483 transitions. [2018-10-24 15:03:14,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:03:14,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2018-10-24 15:03:14,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:03:14,452 INFO L225 Difference]: With dead ends: 2712 [2018-10-24 15:03:14,453 INFO L226 Difference]: Without dead ends: 1787 [2018-10-24 15:03:14,455 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 15:03:14,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2018-10-24 15:03:14,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1783. [2018-10-24 15:03:14,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1783 states. [2018-10-24 15:03:14,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 2737 transitions. [2018-10-24 15:03:14,495 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 2737 transitions. Word has length 182 [2018-10-24 15:03:14,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:03:14,496 INFO L481 AbstractCegarLoop]: Abstraction has 1783 states and 2737 transitions. [2018-10-24 15:03:14,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:03:14,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2737 transitions. [2018-10-24 15:03:14,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-24 15:03:14,501 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:03:14,501 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:03:14,502 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:03:14,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:03:14,502 INFO L82 PathProgramCache]: Analyzing trace with hash 554627611, now seen corresponding path program 1 times [2018-10-24 15:03:14,502 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:03:14,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:03:14,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:14,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:03:14,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:14,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:03:14,622 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 15:03:14,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:03:14,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 15:03:14,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:03:14,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:03:14,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:03:14,624 INFO L87 Difference]: Start difference. First operand 1783 states and 2737 transitions. Second operand 3 states. [2018-10-24 15:03:16,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:03:16,136 INFO L93 Difference]: Finished difference Result 5213 states and 8072 transitions. [2018-10-24 15:03:16,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:03:16,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2018-10-24 15:03:16,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:03:16,156 INFO L225 Difference]: With dead ends: 5213 [2018-10-24 15:03:16,157 INFO L226 Difference]: Without dead ends: 3432 [2018-10-24 15:03:16,161 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 15:03:16,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3432 states. [2018-10-24 15:03:16,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3432 to 3415. [2018-10-24 15:03:16,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3415 states. [2018-10-24 15:03:16,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3415 states to 3415 states and 5131 transitions. [2018-10-24 15:03:16,303 INFO L78 Accepts]: Start accepts. Automaton has 3415 states and 5131 transitions. Word has length 184 [2018-10-24 15:03:16,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:03:16,304 INFO L481 AbstractCegarLoop]: Abstraction has 3415 states and 5131 transitions. [2018-10-24 15:03:16,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:03:16,304 INFO L276 IsEmpty]: Start isEmpty. Operand 3415 states and 5131 transitions. [2018-10-24 15:03:16,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-24 15:03:16,313 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:03:16,313 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:03:16,313 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:03:16,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:03:16,314 INFO L82 PathProgramCache]: Analyzing trace with hash 785822816, now seen corresponding path program 1 times [2018-10-24 15:03:16,314 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:03:16,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:03:16,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:16,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:03:16,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:16,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:03:16,493 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:03:16,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:03:16,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 15:03:16,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:03:16,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:03:16,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:03:16,495 INFO L87 Difference]: Start difference. First operand 3415 states and 5131 transitions. Second operand 3 states. [2018-10-24 15:03:18,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:03:18,358 INFO L93 Difference]: Finished difference Result 8269 states and 12391 transitions. [2018-10-24 15:03:18,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:03:18,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2018-10-24 15:03:18,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:03:18,381 INFO L225 Difference]: With dead ends: 8269 [2018-10-24 15:03:18,381 INFO L226 Difference]: Without dead ends: 4856 [2018-10-24 15:03:18,387 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 15:03:18,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4856 states. [2018-10-24 15:03:18,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4856 to 4855. [2018-10-24 15:03:18,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4855 states. [2018-10-24 15:03:18,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4855 states to 4855 states and 7152 transitions. [2018-10-24 15:03:18,477 INFO L78 Accepts]: Start accepts. Automaton has 4855 states and 7152 transitions. Word has length 186 [2018-10-24 15:03:18,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:03:18,477 INFO L481 AbstractCegarLoop]: Abstraction has 4855 states and 7152 transitions. [2018-10-24 15:03:18,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:03:18,478 INFO L276 IsEmpty]: Start isEmpty. Operand 4855 states and 7152 transitions. [2018-10-24 15:03:18,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-24 15:03:18,488 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:03:18,489 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:03:18,489 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:03:18,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:03:18,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1789823033, now seen corresponding path program 1 times [2018-10-24 15:03:18,489 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:03:18,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:03:18,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:18,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:03:18,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:03:18,801 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 15:03:18,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:03:18,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:03:18,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:03:18,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:03:18,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:03:18,803 INFO L87 Difference]: Start difference. First operand 4855 states and 7152 transitions. Second operand 3 states. [2018-10-24 15:03:20,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:03:20,635 INFO L93 Difference]: Finished difference Result 9678 states and 14272 transitions. [2018-10-24 15:03:20,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:03:20,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2018-10-24 15:03:20,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:03:20,660 INFO L225 Difference]: With dead ends: 9678 [2018-10-24 15:03:20,660 INFO L226 Difference]: Without dead ends: 4825 [2018-10-24 15:03:20,668 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 15:03:20,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4825 states. [2018-10-24 15:03:20,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4825 to 4823. [2018-10-24 15:03:20,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4823 states. [2018-10-24 15:03:20,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4823 states to 4823 states and 6572 transitions. [2018-10-24 15:03:20,752 INFO L78 Accepts]: Start accepts. Automaton has 4823 states and 6572 transitions. Word has length 192 [2018-10-24 15:03:20,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:03:20,753 INFO L481 AbstractCegarLoop]: Abstraction has 4823 states and 6572 transitions. [2018-10-24 15:03:20,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:03:20,753 INFO L276 IsEmpty]: Start isEmpty. Operand 4823 states and 6572 transitions. [2018-10-24 15:03:20,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-24 15:03:20,762 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:03:20,763 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:03:20,763 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:03:20,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:03:20,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1668382964, now seen corresponding path program 1 times [2018-10-24 15:03:20,764 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:03:20,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:03:20,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:20,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:03:20,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:20,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:03:21,079 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:03:21,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 15:03:21,080 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 15:03:21,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:03:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:03:21,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 15:03:21,328 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 15:03:21,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 15:03:21,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-10-24 15:03:21,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 15:03:21,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 15:03:21,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-24 15:03:21,364 INFO L87 Difference]: Start difference. First operand 4823 states and 6572 transitions. Second operand 7 states. [2018-10-24 15:03:22,512 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-24 15:03:28,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:03:28,607 INFO L93 Difference]: Finished difference Result 20489 states and 27696 transitions. [2018-10-24 15:03:28,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-24 15:03:28,608 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 194 [2018-10-24 15:03:28,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:03:28,678 INFO L225 Difference]: With dead ends: 20489 [2018-10-24 15:03:28,678 INFO L226 Difference]: Without dead ends: 15668 [2018-10-24 15:03:28,699 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-24 15:03:28,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15668 states. [2018-10-24 15:03:29,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15668 to 14436. [2018-10-24 15:03:29,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14436 states. [2018-10-24 15:03:29,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14436 states to 14436 states and 17101 transitions. [2018-10-24 15:03:29,048 INFO L78 Accepts]: Start accepts. Automaton has 14436 states and 17101 transitions. Word has length 194 [2018-10-24 15:03:29,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:03:29,048 INFO L481 AbstractCegarLoop]: Abstraction has 14436 states and 17101 transitions. [2018-10-24 15:03:29,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 15:03:29,049 INFO L276 IsEmpty]: Start isEmpty. Operand 14436 states and 17101 transitions. [2018-10-24 15:03:29,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-24 15:03:29,074 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:03:29,074 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:03:29,075 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:03:29,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:03:29,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1899480474, now seen corresponding path program 1 times [2018-10-24 15:03:29,075 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:03:29,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:03:29,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:29,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:03:29,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:03:29,400 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-24 15:03:29,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:03:29,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:03:29,401 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:03:29,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:03:29,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:03:29,402 INFO L87 Difference]: Start difference. First operand 14436 states and 17101 transitions. Second operand 4 states. [2018-10-24 15:03:32,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:03:32,246 INFO L93 Difference]: Finished difference Result 51773 states and 60953 transitions. [2018-10-24 15:03:32,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:03:32,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 219 [2018-10-24 15:03:32,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:03:32,332 INFO L225 Difference]: With dead ends: 51773 [2018-10-24 15:03:32,333 INFO L226 Difference]: Without dead ends: 37339 [2018-10-24 15:03:32,356 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 15:03:32,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37339 states. [2018-10-24 15:03:32,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37339 to 25450. [2018-10-24 15:03:32,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25450 states. [2018-10-24 15:03:33,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25450 states to 25450 states and 29160 transitions. [2018-10-24 15:03:33,000 INFO L78 Accepts]: Start accepts. Automaton has 25450 states and 29160 transitions. Word has length 219 [2018-10-24 15:03:33,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:03:33,001 INFO L481 AbstractCegarLoop]: Abstraction has 25450 states and 29160 transitions. [2018-10-24 15:03:33,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:03:33,001 INFO L276 IsEmpty]: Start isEmpty. Operand 25450 states and 29160 transitions. [2018-10-24 15:03:33,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-24 15:03:33,039 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:03:33,039 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:03:33,040 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:03:33,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:03:33,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1616212620, now seen corresponding path program 1 times [2018-10-24 15:03:33,040 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:03:33,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:03:33,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:33,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:03:33,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:33,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:03:33,230 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-24 15:03:33,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:03:33,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 15:03:33,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:03:33,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:03:33,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:03:33,231 INFO L87 Difference]: Start difference. First operand 25450 states and 29160 transitions. Second operand 3 states. [2018-10-24 15:03:34,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:03:34,980 INFO L93 Difference]: Finished difference Result 49842 states and 57086 transitions. [2018-10-24 15:03:34,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:03:34,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 236 [2018-10-24 15:03:34,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:03:35,026 INFO L225 Difference]: With dead ends: 49842 [2018-10-24 15:03:35,027 INFO L226 Difference]: Without dead ends: 24394 [2018-10-24 15:03:35,053 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 15:03:35,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24394 states. [2018-10-24 15:03:35,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24394 to 24394. [2018-10-24 15:03:35,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24394 states. [2018-10-24 15:03:35,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24394 states to 24394 states and 27706 transitions. [2018-10-24 15:03:35,378 INFO L78 Accepts]: Start accepts. Automaton has 24394 states and 27706 transitions. Word has length 236 [2018-10-24 15:03:35,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:03:35,379 INFO L481 AbstractCegarLoop]: Abstraction has 24394 states and 27706 transitions. [2018-10-24 15:03:35,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:03:35,379 INFO L276 IsEmpty]: Start isEmpty. Operand 24394 states and 27706 transitions. [2018-10-24 15:03:35,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-10-24 15:03:35,415 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:03:35,416 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:03:35,416 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:03:35,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:03:35,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1412223249, now seen corresponding path program 1 times [2018-10-24 15:03:35,417 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:03:35,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:03:35,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:35,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:03:35,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:03:35,884 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-10-24 15:03:35,948 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-10-24 15:03:35,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:03:35,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 15:03:35,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 15:03:35,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 15:03:35,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 15:03:35,950 INFO L87 Difference]: Start difference. First operand 24394 states and 27706 transitions. Second operand 5 states. [2018-10-24 15:03:38,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:03:38,615 INFO L93 Difference]: Finished difference Result 72579 states and 82679 transitions. [2018-10-24 15:03:38,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 15:03:38,615 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 270 [2018-10-24 15:03:38,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:03:38,706 INFO L225 Difference]: With dead ends: 72579 [2018-10-24 15:03:38,707 INFO L226 Difference]: Without dead ends: 48187 [2018-10-24 15:03:38,735 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 15:03:38,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48187 states. [2018-10-24 15:03:39,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48187 to 42840. [2018-10-24 15:03:39,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42840 states. [2018-10-24 15:03:39,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42840 states to 42840 states and 48640 transitions. [2018-10-24 15:03:39,657 INFO L78 Accepts]: Start accepts. Automaton has 42840 states and 48640 transitions. Word has length 270 [2018-10-24 15:03:39,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:03:39,657 INFO L481 AbstractCegarLoop]: Abstraction has 42840 states and 48640 transitions. [2018-10-24 15:03:39,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 15:03:39,658 INFO L276 IsEmpty]: Start isEmpty. Operand 42840 states and 48640 transitions. [2018-10-24 15:03:39,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-10-24 15:03:39,690 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:03:39,690 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 15:03:39,690 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:03:39,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:03:39,691 INFO L82 PathProgramCache]: Analyzing trace with hash 509848481, now seen corresponding path program 1 times [2018-10-24 15:03:39,691 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:03:39,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:03:39,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:39,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:03:39,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:03:39,911 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 15:03:39,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:03:39,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 15:03:39,912 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:03:39,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:03:39,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:03:39,913 INFO L87 Difference]: Start difference. First operand 42840 states and 48640 transitions. Second operand 3 states. [2018-10-24 15:03:40,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:03:40,859 INFO L93 Difference]: Finished difference Result 85674 states and 97274 transitions. [2018-10-24 15:03:40,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:03:40,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 279 [2018-10-24 15:03:40,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:03:40,904 INFO L225 Difference]: With dead ends: 85674 [2018-10-24 15:03:40,904 INFO L226 Difference]: Without dead ends: 42836 [2018-10-24 15:03:40,935 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 15:03:40,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42836 states. [2018-10-24 15:03:41,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42836 to 42836. [2018-10-24 15:03:41,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42836 states. [2018-10-24 15:03:41,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42836 states to 42836 states and 48632 transitions. [2018-10-24 15:03:41,374 INFO L78 Accepts]: Start accepts. Automaton has 42836 states and 48632 transitions. Word has length 279 [2018-10-24 15:03:41,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:03:41,375 INFO L481 AbstractCegarLoop]: Abstraction has 42836 states and 48632 transitions. [2018-10-24 15:03:41,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:03:41,375 INFO L276 IsEmpty]: Start isEmpty. Operand 42836 states and 48632 transitions. [2018-10-24 15:03:41,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-10-24 15:03:41,393 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:03:41,393 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:03:41,394 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:03:41,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:03:41,394 INFO L82 PathProgramCache]: Analyzing trace with hash 650014746, now seen corresponding path program 1 times [2018-10-24 15:03:41,394 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:03:41,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:03:41,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:41,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:03:41,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:03:41,816 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:03:41,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:03:41,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 15:03:41,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 15:03:41,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 15:03:41,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 15:03:41,818 INFO L87 Difference]: Start difference. First operand 42836 states and 48632 transitions. Second operand 5 states. [2018-10-24 15:03:45,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:03:45,817 INFO L93 Difference]: Finished difference Result 207589 states and 235657 transitions. [2018-10-24 15:03:45,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 15:03:45,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 285 [2018-10-24 15:03:45,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:03:45,999 INFO L225 Difference]: With dead ends: 207589 [2018-10-24 15:03:45,999 INFO L226 Difference]: Without dead ends: 164755 [2018-10-24 15:03:46,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-24 15:03:46,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164755 states. [2018-10-24 15:03:47,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164755 to 122331. [2018-10-24 15:03:47,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122331 states. [2018-10-24 15:03:48,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122331 states to 122331 states and 138707 transitions. [2018-10-24 15:03:48,448 INFO L78 Accepts]: Start accepts. Automaton has 122331 states and 138707 transitions. Word has length 285 [2018-10-24 15:03:48,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:03:48,448 INFO L481 AbstractCegarLoop]: Abstraction has 122331 states and 138707 transitions. [2018-10-24 15:03:48,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 15:03:48,448 INFO L276 IsEmpty]: Start isEmpty. Operand 122331 states and 138707 transitions. [2018-10-24 15:03:48,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-10-24 15:03:48,462 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:03:48,462 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 15:03:48,462 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:03:48,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:03:48,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1770193357, now seen corresponding path program 1 times [2018-10-24 15:03:48,463 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:03:48,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:03:48,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:48,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:03:48,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:48,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:03:48,640 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 15:03:48,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:03:48,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:03:48,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:03:48,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:03:48,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:03:48,642 INFO L87 Difference]: Start difference. First operand 122331 states and 138707 transitions. Second operand 3 states. [2018-10-24 15:03:50,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:03:50,396 INFO L93 Difference]: Finished difference Result 243026 states and 275594 transitions. [2018-10-24 15:03:50,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:03:50,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 288 [2018-10-24 15:03:50,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:03:50,535 INFO L225 Difference]: With dead ends: 243026 [2018-10-24 15:03:50,535 INFO L226 Difference]: Without dead ends: 120697 [2018-10-24 15:03:50,606 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 15:03:50,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120697 states. [2018-10-24 15:03:51,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120697 to 120691. [2018-10-24 15:03:51,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120691 states. [2018-10-24 15:03:52,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120691 states to 120691 states and 133343 transitions. [2018-10-24 15:03:52,909 INFO L78 Accepts]: Start accepts. Automaton has 120691 states and 133343 transitions. Word has length 288 [2018-10-24 15:03:52,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:03:52,909 INFO L481 AbstractCegarLoop]: Abstraction has 120691 states and 133343 transitions. [2018-10-24 15:03:52,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:03:52,909 INFO L276 IsEmpty]: Start isEmpty. Operand 120691 states and 133343 transitions. [2018-10-24 15:03:52,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2018-10-24 15:03:52,939 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:03:52,939 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 15:03:52,940 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:03:52,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:03:52,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1453785929, now seen corresponding path program 1 times [2018-10-24 15:03:52,940 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:03:52,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:03:52,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:52,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:03:52,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:03:53,323 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-10-24 15:03:53,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:03:53,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:03:53,325 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 15:03:53,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 15:03:53,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 15:03:53,326 INFO L87 Difference]: Start difference. First operand 120691 states and 133343 transitions. Second operand 4 states. [2018-10-24 15:03:56,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:03:56,629 INFO L93 Difference]: Finished difference Result 244676 states and 270749 transitions. [2018-10-24 15:03:56,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 15:03:56,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 357 [2018-10-24 15:03:56,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:03:56,767 INFO L225 Difference]: With dead ends: 244676 [2018-10-24 15:03:56,767 INFO L226 Difference]: Without dead ends: 123987 [2018-10-24 15:03:56,829 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 15:03:56,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123987 states. [2018-10-24 15:03:57,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123987 to 123958. [2018-10-24 15:03:57,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123958 states. [2018-10-24 15:03:58,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123958 states to 123958 states and 136111 transitions. [2018-10-24 15:03:58,032 INFO L78 Accepts]: Start accepts. Automaton has 123958 states and 136111 transitions. Word has length 357 [2018-10-24 15:03:58,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:03:58,032 INFO L481 AbstractCegarLoop]: Abstraction has 123958 states and 136111 transitions. [2018-10-24 15:03:58,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 15:03:58,032 INFO L276 IsEmpty]: Start isEmpty. Operand 123958 states and 136111 transitions. [2018-10-24 15:03:58,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2018-10-24 15:03:58,068 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:03:58,069 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:03:58,069 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:03:58,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:03:58,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1200294787, now seen corresponding path program 1 times [2018-10-24 15:03:58,070 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:03:58,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:03:58,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:58,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:03:58,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:03:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:03:59,507 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 331 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-24 15:03:59,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:03:59,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 15:03:59,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:03:59,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:03:59,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:03:59,509 INFO L87 Difference]: Start difference. First operand 123958 states and 136111 transitions. Second operand 3 states. [2018-10-24 15:04:00,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:04:00,853 INFO L93 Difference]: Finished difference Result 340325 states and 372669 transitions. [2018-10-24 15:04:00,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:04:00,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 407 [2018-10-24 15:04:00,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:04:01,099 INFO L225 Difference]: With dead ends: 340325 [2018-10-24 15:04:01,099 INFO L226 Difference]: Without dead ends: 216369 [2018-10-24 15:04:01,192 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 15:04:01,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216369 states. [2018-10-24 15:04:04,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216369 to 216369. [2018-10-24 15:04:04,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216369 states. [2018-10-24 15:04:04,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216369 states to 216369 states and 235230 transitions. [2018-10-24 15:04:04,855 INFO L78 Accepts]: Start accepts. Automaton has 216369 states and 235230 transitions. Word has length 407 [2018-10-24 15:04:04,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:04:04,855 INFO L481 AbstractCegarLoop]: Abstraction has 216369 states and 235230 transitions. [2018-10-24 15:04:04,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 15:04:04,856 INFO L276 IsEmpty]: Start isEmpty. Operand 216369 states and 235230 transitions. [2018-10-24 15:04:04,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-10-24 15:04:04,893 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:04:04,893 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:04:04,893 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:04:04,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:04:04,894 INFO L82 PathProgramCache]: Analyzing trace with hash -702187967, now seen corresponding path program 1 times [2018-10-24 15:04:04,894 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:04:04,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:04:04,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:04:04,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:04:04,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:04:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:04:05,342 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-24 15:04:05,558 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-24 15:04:05,822 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-24 15:04:06,035 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-24 15:04:06,350 WARN L179 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-24 15:04:07,042 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 312 proven. 29 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-10-24 15:04:07,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 15:04:07,042 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 15:04:07,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:04:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:04:07,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 15:04:08,198 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 231 proven. 90 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-10-24 15:04:08,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 15:04:08,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 3] total 11 [2018-10-24 15:04:08,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-24 15:04:08,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-24 15:04:08,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-10-24 15:04:08,224 INFO L87 Difference]: Start difference. First operand 216369 states and 235230 transitions. Second operand 12 states. [2018-10-24 15:04:35,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:04:35,429 INFO L93 Difference]: Finished difference Result 1808637 states and 1955855 transitions. [2018-10-24 15:04:35,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-24 15:04:35,429 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 409 [2018-10-24 15:04:35,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:04:37,864 INFO L225 Difference]: With dead ends: 1808637 [2018-10-24 15:04:37,864 INFO L226 Difference]: Without dead ends: 1592264 [2018-10-24 15:04:38,174 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 407 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=304, Invalid=886, Unknown=0, NotChecked=0, Total=1190 [2018-10-24 15:04:39,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592264 states. [2018-10-24 15:05:15,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592264 to 1374545. [2018-10-24 15:05:15,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1374545 states. [2018-10-24 15:05:19,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374545 states to 1374545 states and 1487018 transitions. [2018-10-24 15:05:19,405 INFO L78 Accepts]: Start accepts. Automaton has 1374545 states and 1487018 transitions. Word has length 409 [2018-10-24 15:05:19,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 15:05:19,405 INFO L481 AbstractCegarLoop]: Abstraction has 1374545 states and 1487018 transitions. [2018-10-24 15:05:19,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-24 15:05:19,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1374545 states and 1487018 transitions. [2018-10-24 15:05:19,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2018-10-24 15:05:19,533 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 15:05:19,534 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, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-24 15:05:19,534 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 15:05:19,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 15:05:19,535 INFO L82 PathProgramCache]: Analyzing trace with hash -197966188, now seen corresponding path program 1 times [2018-10-24 15:05:19,535 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 15:05:19,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 15:05:19,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:05:19,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 15:05:19,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 15:05:19,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 15:05:19,742 INFO L134 CoverageAnalysis]: Checked inductivity of 563 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2018-10-24 15:05:19,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 15:05:19,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 15:05:19,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 15:05:19,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 15:05:19,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 15:05:19,744 INFO L87 Difference]: Start difference. First operand 1374545 states and 1487018 transitions. Second operand 3 states. [2018-10-24 15:05:54,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 15:05:54,451 INFO L93 Difference]: Finished difference Result 3284728 states and 3542415 transitions. [2018-10-24 15:05:54,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 15:05:54,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 461 [2018-10-24 15:05:54,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 15:05:57,863 INFO L225 Difference]: With dead ends: 3284728 [2018-10-24 15:05:57,864 INFO L226 Difference]: Without dead ends: 1910185 [2018-10-24 15:05:58,662 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 15:06:01,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1910185 states. Received shutdown request... [2018-10-24 15:06:13,554 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-24 15:06:13,558 WARN L205 ceAbstractionStarter]: Timeout [2018-10-24 15:06:13,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 03:06:13 BoogieIcfgContainer [2018-10-24 15:06:13,559 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 15:06:13,560 INFO L168 Benchmark]: Toolchain (without parser) took 198583.57 ms. Allocated memory was 1.5 GB in the beginning and 7.3 GB in the end (delta: 5.8 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -634.9 MB). Peak memory consumption was 6.0 GB. Max. memory is 7.1 GB. [2018-10-24 15:06:13,561 INFO L168 Benchmark]: CDTParser took 0.25 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 15:06:13,562 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1122.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. [2018-10-24 15:06:13,563 INFO L168 Benchmark]: Boogie Procedure Inliner took 295.83 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.4 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -875.8 MB). Peak memory consumption was 40.2 MB. Max. memory is 7.1 GB. [2018-10-24 15:06:13,564 INFO L168 Benchmark]: Boogie Preprocessor took 99.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.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2018-10-24 15:06:13,564 INFO L168 Benchmark]: RCFGBuilder took 5927.91 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 259.8 MB). Peak memory consumption was 259.8 MB. Max. memory is 7.1 GB. [2018-10-24 15:06:13,565 INFO L168 Benchmark]: TraceAbstraction took 191132.28 ms. Allocated memory was 2.3 GB in the beginning and 7.3 GB in the end (delta: 5.0 GB). Free memory was 1.9 GB in the beginning and 2.0 GB in the end (delta: -117.3 MB). Peak memory consumption was 5.8 GB. Max. memory is 7.1 GB. [2018-10-24 15:06:13,573 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 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 1122.92 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 84.6 MB). Peak memory consumption was 84.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 295.83 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.4 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -875.8 MB). Peak memory consumption was 40.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 99.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.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 5927.91 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 259.8 MB). Peak memory consumption was 259.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 191132.28 ms. Allocated memory was 2.3 GB in the beginning and 7.3 GB in the end (delta: 5.0 GB). Free memory was 1.9 GB in the beginning and 2.0 GB in the end (delta: -117.3 MB). Peak memory consumption was 5.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1557]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1557). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 1 error locations. TIMEOUT Result, 191.0s OverallTime, 17 OverallIterations, 6 TraceHistogramMax, 111.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4355 SDtfs, 16476 SDslu, 3459 SDs, 0 SdLazy, 25515 SolverSat, 4761 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 49.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 691 GetRequests, 620 SyntacticMatches, 8 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1374545occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 68.8s AutomataMinimizationTime, 17 MinimizatonAttempts, 279398 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 5108 NumberOfCodeBlocks, 5108 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 5089 ConstructedInterpolants, 0 QuantifiedInterpolants, 4416578 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1078 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 19 InterpolantComputations, 16 PerfectInterpolantSequences, 2681/2804 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown