java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem13_label09_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 21:16:18,470 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 21:16:18,474 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 21:16:18,494 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 21:16:18,496 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 21:16:18,497 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 21:16:18,499 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 21:16:18,501 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 21:16:18,504 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 21:16:18,512 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 21:16:18,515 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 21:16:18,516 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 21:16:18,517 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 21:16:18,518 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 21:16:18,520 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 21:16:18,521 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 21:16:18,522 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 21:16:18,525 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 21:16:18,530 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 21:16:18,533 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 21:16:18,536 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 21:16:18,537 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 21:16:18,539 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 21:16:18,539 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 21:16:18,540 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 21:16:18,540 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 21:16:18,541 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 21:16:18,542 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 21:16:18,543 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 21:16:18,544 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 21:16:18,544 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 21:16:18,545 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 21:16:18,545 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 21:16:18,545 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 21:16:18,546 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 21:16:18,547 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 21:16:18,547 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 21:16:18,570 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 21:16:18,570 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 21:16:18,572 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 21:16:18,572 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 21:16:18,573 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 21:16:18,573 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 21:16:18,573 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 21:16:18,574 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 21:16:18,575 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 21:16:18,575 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 21:16:18,575 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 21:16:18,575 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 21:16:18,575 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 21:16:18,576 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 21:16:18,576 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 21:16:18,576 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 21:16:18,576 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 21:16:18,576 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 21:16:18,577 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 21:16:18,577 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:16:18,577 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 21:16:18,577 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 21:16:18,577 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 21:16:18,577 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 21:16:18,578 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 21:16:18,578 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 21:16:18,578 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 21:16:18,578 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 21:16:18,644 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 21:16:18,664 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 21:16:18,669 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 21:16:18,671 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 21:16:18,672 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 21:16:18,673 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label09_true-unreach-call.c [2018-11-06 21:16:18,737 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cffd33fc4/991354cacda949a78eabe3eb080bee27/FLAGe8f7ab894 [2018-11-06 21:16:19,564 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 21:16:19,565 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label09_true-unreach-call.c [2018-11-06 21:16:19,602 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cffd33fc4/991354cacda949a78eabe3eb080bee27/FLAGe8f7ab894 [2018-11-06 21:16:19,624 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cffd33fc4/991354cacda949a78eabe3eb080bee27 [2018-11-06 21:16:19,637 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 21:16:19,639 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 21:16:19,640 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 21:16:19,640 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 21:16:19,646 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 21:16:19,648 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:16:19" (1/1) ... [2018-11-06 21:16:19,651 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54967387 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:19, skipping insertion in model container [2018-11-06 21:16:19,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:16:19" (1/1) ... [2018-11-06 21:16:19,662 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 21:16:19,856 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 21:16:21,244 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:16:21,249 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 21:16:21,961 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:16:21,999 INFO L193 MainTranslator]: Completed translation [2018-11-06 21:16:22,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:22 WrapperNode [2018-11-06 21:16:22,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 21:16:22,002 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 21:16:22,002 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 21:16:22,002 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 21:16:22,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:22" (1/1) ... [2018-11-06 21:16:22,386 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:22" (1/1) ... [2018-11-06 21:16:22,837 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 21:16:22,838 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 21:16:22,838 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 21:16:22,838 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 21:16:22,850 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:22" (1/1) ... [2018-11-06 21:16:22,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:22" (1/1) ... [2018-11-06 21:16:22,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:22" (1/1) ... [2018-11-06 21:16:22,898 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:22" (1/1) ... [2018-11-06 21:16:23,172 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:22" (1/1) ... [2018-11-06 21:16:23,228 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:22" (1/1) ... [2018-11-06 21:16:23,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:22" (1/1) ... [2018-11-06 21:16:23,434 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 21:16:23,434 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 21:16:23,434 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 21:16:23,435 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 21:16:23,435 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:16:23,503 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 21:16:23,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 21:16:23,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 21:16:35,915 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 21:16:35,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:16:35 BoogieIcfgContainer [2018-11-06 21:16:35,916 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 21:16:35,917 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 21:16:35,917 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 21:16:35,920 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 21:16:35,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:16:19" (1/3) ... [2018-11-06 21:16:35,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@284ef19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:16:35, skipping insertion in model container [2018-11-06 21:16:35,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:22" (2/3) ... [2018-11-06 21:16:35,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@284ef19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:16:35, skipping insertion in model container [2018-11-06 21:16:35,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:16:35" (3/3) ... [2018-11-06 21:16:35,925 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label09_true-unreach-call.c [2018-11-06 21:16:35,935 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 21:16:35,945 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 21:16:35,964 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 21:16:36,015 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 21:16:36,016 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 21:16:36,016 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 21:16:36,016 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 21:16:36,016 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 21:16:36,017 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 21:16:36,017 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 21:16:36,017 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 21:16:36,017 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 21:16:36,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states. [2018-11-06 21:16:36,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-06 21:16:36,076 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:16:36,077 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] [2018-11-06 21:16:36,080 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:16:36,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:16:36,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1059493314, now seen corresponding path program 1 times [2018-11-06 21:16:36,089 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:16:36,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:16:36,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:16:36,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:16:36,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:16:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:16:36,556 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-11-06 21:16:36,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:16:36,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:16:36,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:16:36,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:16:36,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:16:36,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:16:36,656 INFO L87 Difference]: Start difference. First operand 1099 states. Second operand 4 states. [2018-11-06 21:16:50,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:16:50,244 INFO L93 Difference]: Finished difference Result 3991 states and 7504 transitions. [2018-11-06 21:16:50,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:16:50,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-11-06 21:16:50,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:16:50,297 INFO L225 Difference]: With dead ends: 3991 [2018-11-06 21:16:50,297 INFO L226 Difference]: Without dead ends: 2885 [2018-11-06 21:16:50,306 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:16:50,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2885 states. [2018-11-06 21:16:50,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2885 to 1946. [2018-11-06 21:16:50,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2018-11-06 21:16:50,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 3412 transitions. [2018-11-06 21:16:50,481 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 3412 transitions. Word has length 61 [2018-11-06 21:16:50,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:16:50,482 INFO L480 AbstractCegarLoop]: Abstraction has 1946 states and 3412 transitions. [2018-11-06 21:16:50,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:16:50,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 3412 transitions. [2018-11-06 21:16:50,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-06 21:16:50,490 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:16:50,491 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:16:50,491 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:16:50,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:16:50,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1442154721, now seen corresponding path program 1 times [2018-11-06 21:16:50,493 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:16:50,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:16:50,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:16:50,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:16:50,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:16:50,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:16:50,869 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:16:50,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:16:50,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:16:50,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:16:50,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:16:50,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:16:50,873 INFO L87 Difference]: Start difference. First operand 1946 states and 3412 transitions. Second operand 4 states. [2018-11-06 21:17:02,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:17:02,441 INFO L93 Difference]: Finished difference Result 7107 states and 12745 transitions. [2018-11-06 21:17:02,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:17:02,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2018-11-06 21:17:02,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:17:02,472 INFO L225 Difference]: With dead ends: 7107 [2018-11-06 21:17:02,472 INFO L226 Difference]: Without dead ends: 5163 [2018-11-06 21:17:02,478 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:17:02,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5163 states. [2018-11-06 21:17:02,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5163 to 5141. [2018-11-06 21:17:02,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5141 states. [2018-11-06 21:17:02,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5141 states to 5141 states and 8063 transitions. [2018-11-06 21:17:02,578 INFO L78 Accepts]: Start accepts. Automaton has 5141 states and 8063 transitions. Word has length 128 [2018-11-06 21:17:02,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:17:02,579 INFO L480 AbstractCegarLoop]: Abstraction has 5141 states and 8063 transitions. [2018-11-06 21:17:02,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:17:02,579 INFO L276 IsEmpty]: Start isEmpty. Operand 5141 states and 8063 transitions. [2018-11-06 21:17:02,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-06 21:17:02,584 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:17:02,584 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:17:02,585 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:17:02,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:17:02,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1645796799, now seen corresponding path program 1 times [2018-11-06 21:17:02,585 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:17:02,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:17:02,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:17:02,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:17:02,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:17:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:17:03,108 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-06 21:17:03,720 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-06 21:17:03,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:17:03,721 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:17:03,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:17:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:17:03,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:17:03,947 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:17:03,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:17:03,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-11-06 21:17:03,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:17:03,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:17:03,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:17:03,984 INFO L87 Difference]: Start difference. First operand 5141 states and 8063 transitions. Second operand 6 states. [2018-11-06 21:17:04,178 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-06 21:17:21,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:17:21,831 INFO L93 Difference]: Finished difference Result 26053 states and 40615 transitions. [2018-11-06 21:17:21,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 21:17:21,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 158 [2018-11-06 21:17:21,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:17:21,919 INFO L225 Difference]: With dead ends: 26053 [2018-11-06 21:17:21,919 INFO L226 Difference]: Without dead ends: 20914 [2018-11-06 21:17:21,931 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 160 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:17:21,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20914 states. [2018-11-06 21:17:22,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20914 to 20913. [2018-11-06 21:17:22,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20913 states. [2018-11-06 21:17:22,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20913 states to 20913 states and 28528 transitions. [2018-11-06 21:17:22,349 INFO L78 Accepts]: Start accepts. Automaton has 20913 states and 28528 transitions. Word has length 158 [2018-11-06 21:17:22,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:17:22,350 INFO L480 AbstractCegarLoop]: Abstraction has 20913 states and 28528 transitions. [2018-11-06 21:17:22,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:17:22,351 INFO L276 IsEmpty]: Start isEmpty. Operand 20913 states and 28528 transitions. [2018-11-06 21:17:22,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-11-06 21:17:22,362 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:17:22,363 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:17:22,363 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:17:22,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:17:22,363 INFO L82 PathProgramCache]: Analyzing trace with hash -571397369, now seen corresponding path program 1 times [2018-11-06 21:17:22,364 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:17:22,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:17:22,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:17:22,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:17:22,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:17:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:17:22,810 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 117 proven. 4 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-06 21:17:22,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:17:22,810 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:17:22,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:17:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:17:22,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:17:23,288 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:17:23,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:17:23,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-06 21:17:23,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:17:23,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:17:23,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:17:23,321 INFO L87 Difference]: Start difference. First operand 20913 states and 28528 transitions. Second operand 4 states. [2018-11-06 21:17:33,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:17:33,067 INFO L93 Difference]: Finished difference Result 71020 states and 97374 transitions. [2018-11-06 21:17:33,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:17:33,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 267 [2018-11-06 21:17:33,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:17:33,180 INFO L225 Difference]: With dead ends: 71020 [2018-11-06 21:17:33,180 INFO L226 Difference]: Without dead ends: 50897 [2018-11-06 21:17:33,210 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:17:33,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50897 states. [2018-11-06 21:17:33,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50897 to 39823. [2018-11-06 21:17:33,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39823 states. [2018-11-06 21:17:33,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39823 states to 39823 states and 50523 transitions. [2018-11-06 21:17:33,869 INFO L78 Accepts]: Start accepts. Automaton has 39823 states and 50523 transitions. Word has length 267 [2018-11-06 21:17:33,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:17:33,870 INFO L480 AbstractCegarLoop]: Abstraction has 39823 states and 50523 transitions. [2018-11-06 21:17:33,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:17:33,870 INFO L276 IsEmpty]: Start isEmpty. Operand 39823 states and 50523 transitions. [2018-11-06 21:17:33,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-11-06 21:17:33,880 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:17:33,880 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:17:33,881 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:17:33,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:17:33,881 INFO L82 PathProgramCache]: Analyzing trace with hash 2043076177, now seen corresponding path program 1 times [2018-11-06 21:17:33,881 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:17:33,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:17:33,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:17:33,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:17:33,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:17:33,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:17:34,495 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-11-06 21:17:34,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:17:34,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 21:17:34,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:17:34,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:17:34,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:17:34,496 INFO L87 Difference]: Start difference. First operand 39823 states and 50523 transitions. Second operand 3 states. [2018-11-06 21:17:39,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:17:39,877 INFO L93 Difference]: Finished difference Result 114312 states and 145741 transitions. [2018-11-06 21:17:39,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:17:39,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 293 [2018-11-06 21:17:39,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:17:39,987 INFO L225 Difference]: With dead ends: 114312 [2018-11-06 21:17:39,987 INFO L226 Difference]: Without dead ends: 75279 [2018-11-06 21:17:40,041 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:17:40,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75279 states. [2018-11-06 21:17:40,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75279 to 74490. [2018-11-06 21:17:40,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74490 states. [2018-11-06 21:17:40,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74490 states to 74490 states and 89291 transitions. [2018-11-06 21:17:40,977 INFO L78 Accepts]: Start accepts. Automaton has 74490 states and 89291 transitions. Word has length 293 [2018-11-06 21:17:40,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:17:40,978 INFO L480 AbstractCegarLoop]: Abstraction has 74490 states and 89291 transitions. [2018-11-06 21:17:40,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:17:40,978 INFO L276 IsEmpty]: Start isEmpty. Operand 74490 states and 89291 transitions. [2018-11-06 21:17:40,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-11-06 21:17:40,999 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:17:41,000 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:17:41,000 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:17:41,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:17:41,001 INFO L82 PathProgramCache]: Analyzing trace with hash -40954621, now seen corresponding path program 1 times [2018-11-06 21:17:41,001 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:17:41,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:17:41,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:17:41,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:17:41,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:17:41,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:17:41,353 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 415 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-06 21:17:41,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:17:41,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:17:41,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:17:41,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:17:41,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:17:41,355 INFO L87 Difference]: Start difference. First operand 74490 states and 89291 transitions. Second operand 4 states. [2018-11-06 21:17:53,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:17:53,486 INFO L93 Difference]: Finished difference Result 193140 states and 232971 transitions. [2018-11-06 21:17:53,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:17:53,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 396 [2018-11-06 21:17:53,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:17:53,639 INFO L225 Difference]: With dead ends: 193140 [2018-11-06 21:17:53,639 INFO L226 Difference]: Without dead ends: 119440 [2018-11-06 21:17:53,697 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:17:53,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119440 states. [2018-11-06 21:17:55,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119440 to 119405. [2018-11-06 21:17:55,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119405 states. [2018-11-06 21:17:55,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119405 states to 119405 states and 138598 transitions. [2018-11-06 21:17:55,808 INFO L78 Accepts]: Start accepts. Automaton has 119405 states and 138598 transitions. Word has length 396 [2018-11-06 21:17:55,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:17:55,808 INFO L480 AbstractCegarLoop]: Abstraction has 119405 states and 138598 transitions. [2018-11-06 21:17:55,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:17:55,809 INFO L276 IsEmpty]: Start isEmpty. Operand 119405 states and 138598 transitions. [2018-11-06 21:17:55,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2018-11-06 21:17:55,842 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:17:55,843 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:17:55,843 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:17:55,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:17:55,843 INFO L82 PathProgramCache]: Analyzing trace with hash -2066761458, now seen corresponding path program 1 times [2018-11-06 21:17:55,844 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:17:55,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:17:55,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:17:55,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:17:55,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:17:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:17:56,214 INFO L134 CoverageAnalysis]: Checked inductivity of 827 backedges. 608 proven. 0 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2018-11-06 21:17:56,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:17:56,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:17:56,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:17:56,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:17:56,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:17:56,216 INFO L87 Difference]: Start difference. First operand 119405 states and 138598 transitions. Second operand 5 states. [2018-11-06 21:18:14,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:18:14,781 INFO L93 Difference]: Finished difference Result 391988 states and 454896 transitions. [2018-11-06 21:18:14,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:18:14,782 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 477 [2018-11-06 21:18:14,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:18:15,087 INFO L225 Difference]: With dead ends: 391988 [2018-11-06 21:18:15,088 INFO L226 Difference]: Without dead ends: 273373 [2018-11-06 21:18:15,170 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:18:15,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273373 states. [2018-11-06 21:18:18,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273373 to 260561. [2018-11-06 21:18:18,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260561 states. [2018-11-06 21:18:18,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260561 states to 260561 states and 295629 transitions. [2018-11-06 21:18:18,507 INFO L78 Accepts]: Start accepts. Automaton has 260561 states and 295629 transitions. Word has length 477 [2018-11-06 21:18:18,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:18:18,507 INFO L480 AbstractCegarLoop]: Abstraction has 260561 states and 295629 transitions. [2018-11-06 21:18:18,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:18:18,508 INFO L276 IsEmpty]: Start isEmpty. Operand 260561 states and 295629 transitions. [2018-11-06 21:18:18,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2018-11-06 21:18:18,555 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:18:18,555 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:18:18,556 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:18:18,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:18:18,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1207682100, now seen corresponding path program 1 times [2018-11-06 21:18:18,556 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:18:18,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:18:18,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:18:18,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:18:18,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:18:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:18:19,002 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-11-06 21:18:19,307 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 403 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-11-06 21:18:19,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:18:19,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:18:19,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:18:19,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:18:19,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:18:19,310 INFO L87 Difference]: Start difference. First operand 260561 states and 295629 transitions. Second operand 4 states. [2018-11-06 21:18:30,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:18:30,708 INFO L93 Difference]: Finished difference Result 520352 states and 590500 transitions. [2018-11-06 21:18:30,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:18:30,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 566 [2018-11-06 21:18:30,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:18:31,120 INFO L225 Difference]: With dead ends: 520352 [2018-11-06 21:18:31,121 INFO L226 Difference]: Without dead ends: 260581 [2018-11-06 21:18:31,259 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:18:31,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260581 states. [2018-11-06 21:18:34,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260581 to 255043. [2018-11-06 21:18:34,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255043 states. [2018-11-06 21:18:35,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255043 states to 255043 states and 280707 transitions. [2018-11-06 21:18:35,269 INFO L78 Accepts]: Start accepts. Automaton has 255043 states and 280707 transitions. Word has length 566 [2018-11-06 21:18:35,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:18:35,270 INFO L480 AbstractCegarLoop]: Abstraction has 255043 states and 280707 transitions. [2018-11-06 21:18:35,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:18:35,270 INFO L276 IsEmpty]: Start isEmpty. Operand 255043 states and 280707 transitions. [2018-11-06 21:18:35,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 630 [2018-11-06 21:18:35,310 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:18:35,311 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:18:35,311 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:18:35,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:18:35,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1997089938, now seen corresponding path program 1 times [2018-11-06 21:18:35,312 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:18:35,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:18:35,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:18:35,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:18:35,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:18:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:18:35,766 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-11-06 21:18:37,624 INFO L134 CoverageAnalysis]: Checked inductivity of 927 backedges. 696 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-11-06 21:18:37,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:18:37,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:18:37,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:18:37,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:18:37,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:18:37,626 INFO L87 Difference]: Start difference. First operand 255043 states and 280707 transitions. Second operand 4 states. [2018-11-06 21:18:50,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:18:50,460 INFO L93 Difference]: Finished difference Result 522690 states and 574832 transitions. [2018-11-06 21:18:50,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:18:50,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 629 [2018-11-06 21:18:50,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:18:50,728 INFO L225 Difference]: With dead ends: 522690 [2018-11-06 21:18:50,728 INFO L226 Difference]: Without dead ends: 229750 [2018-11-06 21:18:50,830 INFO L604 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-11-06 21:18:50,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229750 states. [2018-11-06 21:18:53,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229750 to 213989. [2018-11-06 21:18:53,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213989 states. [2018-11-06 21:18:53,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213989 states to 213989 states and 233017 transitions. [2018-11-06 21:18:53,339 INFO L78 Accepts]: Start accepts. Automaton has 213989 states and 233017 transitions. Word has length 629 [2018-11-06 21:18:53,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:18:53,340 INFO L480 AbstractCegarLoop]: Abstraction has 213989 states and 233017 transitions. [2018-11-06 21:18:53,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:18:53,340 INFO L276 IsEmpty]: Start isEmpty. Operand 213989 states and 233017 transitions. [2018-11-06 21:18:53,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 691 [2018-11-06 21:18:53,371 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:18:53,372 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 21:18:53,372 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:18:53,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:18:53,373 INFO L82 PathProgramCache]: Analyzing trace with hash 40773872, now seen corresponding path program 1 times [2018-11-06 21:18:53,373 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:18:53,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:18:53,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:18:53,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:18:53,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:18:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:18:54,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1282 backedges. 776 proven. 8 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2018-11-06 21:18:54,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:18:54,950 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:18:54,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:18:55,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:18:55,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:18:55,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1282 backedges. 961 proven. 0 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-11-06 21:18:55,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:18:55,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-06 21:18:55,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:18:55,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:18:55,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:18:55,894 INFO L87 Difference]: Start difference. First operand 213989 states and 233017 transitions. Second operand 4 states. [2018-11-06 21:19:05,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:19:05,220 INFO L93 Difference]: Finished difference Result 454784 states and 493792 transitions. [2018-11-06 21:19:05,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:19:05,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 690 [2018-11-06 21:19:05,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:19:05,987 INFO L225 Difference]: With dead ends: 454784 [2018-11-06 21:19:05,987 INFO L226 Difference]: Without dead ends: 241585 [2018-11-06 21:19:06,074 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 692 GetRequests, 690 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:19:06,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241585 states. [2018-11-06 21:19:08,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241585 to 221867. [2018-11-06 21:19:08,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221867 states. [2018-11-06 21:19:08,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221867 states to 221867 states and 241032 transitions. [2018-11-06 21:19:08,729 INFO L78 Accepts]: Start accepts. Automaton has 221867 states and 241032 transitions. Word has length 690 [2018-11-06 21:19:08,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:19:08,730 INFO L480 AbstractCegarLoop]: Abstraction has 221867 states and 241032 transitions. [2018-11-06 21:19:08,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:19:08,730 INFO L276 IsEmpty]: Start isEmpty. Operand 221867 states and 241032 transitions. [2018-11-06 21:19:08,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 743 [2018-11-06 21:19:08,770 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:19:08,770 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 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] [2018-11-06 21:19:08,771 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:19:08,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:19:08,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1193181533, now seen corresponding path program 1 times [2018-11-06 21:19:08,771 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:19:08,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:19:08,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:19:08,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:19:08,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:19:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:19:09,263 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-11-06 21:19:09,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1670 backedges. 1276 proven. 0 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2018-11-06 21:19:09,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:19:09,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:19:09,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:19:09,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:19:09,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:19:09,994 INFO L87 Difference]: Start difference. First operand 221867 states and 241032 transitions. Second operand 4 states. [2018-11-06 21:19:19,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:19:19,631 INFO L93 Difference]: Finished difference Result 442177 states and 480414 transitions. [2018-11-06 21:19:19,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:19:19,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 742 [2018-11-06 21:19:19,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:19:19,912 INFO L225 Difference]: With dead ends: 442177 [2018-11-06 21:19:19,912 INFO L226 Difference]: Without dead ends: 221100 [2018-11-06 21:19:20,002 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-11-06 21:19:20,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221100 states. [2018-11-06 21:19:22,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221100 to 218712. [2018-11-06 21:19:22,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218712 states. [2018-11-06 21:19:22,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218712 states to 218712 states and 233777 transitions. [2018-11-06 21:19:22,572 INFO L78 Accepts]: Start accepts. Automaton has 218712 states and 233777 transitions. Word has length 742 [2018-11-06 21:19:22,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:19:22,572 INFO L480 AbstractCegarLoop]: Abstraction has 218712 states and 233777 transitions. [2018-11-06 21:19:22,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:19:22,573 INFO L276 IsEmpty]: Start isEmpty. Operand 218712 states and 233777 transitions. [2018-11-06 21:19:22,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 813 [2018-11-06 21:19:22,601 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:19:22,602 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:19:22,602 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:19:22,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:19:22,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1393003149, now seen corresponding path program 1 times [2018-11-06 21:19:22,602 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:19:22,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:19:22,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:19:22,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:19:22,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:19:22,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:19:24,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2150 backedges. 1280 proven. 16 refuted. 0 times theorem prover too weak. 854 trivial. 0 not checked. [2018-11-06 21:19:24,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:19:24,594 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:19:24,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:19:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:19:24,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:19:25,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2150 backedges. 1396 proven. 0 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2018-11-06 21:19:25,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:19:25,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-11-06 21:19:25,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:19:25,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:19:25,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:19:25,355 INFO L87 Difference]: Start difference. First operand 218712 states and 233777 transitions. Second operand 5 states. [2018-11-06 21:19:39,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:19:39,671 INFO L93 Difference]: Finished difference Result 435057 states and 465597 transitions. [2018-11-06 21:19:39,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-06 21:19:39,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 812 [2018-11-06 21:19:39,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:19:39,937 INFO L225 Difference]: With dead ends: 435057 [2018-11-06 21:19:39,937 INFO L226 Difference]: Without dead ends: 217135 [2018-11-06 21:19:40,023 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 820 GetRequests, 814 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:19:40,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217135 states. [2018-11-06 21:19:46,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217135 to 210791. [2018-11-06 21:19:46,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210791 states. [2018-11-06 21:19:46,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210791 states to 210791 states and 221507 transitions. [2018-11-06 21:19:46,678 INFO L78 Accepts]: Start accepts. Automaton has 210791 states and 221507 transitions. Word has length 812 [2018-11-06 21:19:46,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:19:46,679 INFO L480 AbstractCegarLoop]: Abstraction has 210791 states and 221507 transitions. [2018-11-06 21:19:46,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:19:46,679 INFO L276 IsEmpty]: Start isEmpty. Operand 210791 states and 221507 transitions. [2018-11-06 21:19:46,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 816 [2018-11-06 21:19:46,709 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:19:46,710 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:19:46,710 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:19:46,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:19:46,711 INFO L82 PathProgramCache]: Analyzing trace with hash -342695065, now seen corresponding path program 1 times [2018-11-06 21:19:46,711 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:19:46,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:19:46,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:19:46,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:19:46,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:19:46,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:19:47,736 INFO L134 CoverageAnalysis]: Checked inductivity of 983 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-06 21:19:47,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:19:47,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:19:47,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:19:47,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:19:47,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:19:47,739 INFO L87 Difference]: Start difference. First operand 210791 states and 221507 transitions. Second operand 3 states. [2018-11-06 21:19:54,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:19:54,469 INFO L93 Difference]: Finished difference Result 420765 states and 442029 transitions. [2018-11-06 21:19:54,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:19:54,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 815 [2018-11-06 21:19:54,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:19:54,719 INFO L225 Difference]: With dead ends: 420765 [2018-11-06 21:19:54,719 INFO L226 Difference]: Without dead ends: 207605 [2018-11-06 21:19:54,822 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:19:54,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207605 states. [2018-11-06 21:19:57,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207605 to 200508. [2018-11-06 21:19:57,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200508 states. [2018-11-06 21:19:57,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200508 states to 200508 states and 207995 transitions. [2018-11-06 21:19:57,442 INFO L78 Accepts]: Start accepts. Automaton has 200508 states and 207995 transitions. Word has length 815 [2018-11-06 21:19:57,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:19:57,443 INFO L480 AbstractCegarLoop]: Abstraction has 200508 states and 207995 transitions. [2018-11-06 21:19:57,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:19:57,443 INFO L276 IsEmpty]: Start isEmpty. Operand 200508 states and 207995 transitions. [2018-11-06 21:19:57,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 844 [2018-11-06 21:19:57,474 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:19:57,475 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:19:57,475 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:19:57,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:19:57,476 INFO L82 PathProgramCache]: Analyzing trace with hash -297170431, now seen corresponding path program 1 times [2018-11-06 21:19:57,476 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:19:57,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:19:57,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:19:57,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:19:57,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:19:57,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-11-06 21:19:58,111 WARN L187 SmtUtils]: Removed 1 from assertion stack [2018-11-06 21:19:58,112 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-06 21:19:58,117 WARN L205 ceAbstractionStarter]: Timeout [2018-11-06 21:19:58,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:19:58 BoogieIcfgContainer [2018-11-06 21:19:58,118 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 21:19:58,121 INFO L168 Benchmark]: Toolchain (without parser) took 218480.86 ms. Allocated memory was 1.5 GB in the beginning and 5.1 GB in the end (delta: 3.6 GB). Free memory was 1.4 GB in the beginning and 2.9 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-11-06 21:19:58,123 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 21:19:58,123 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2361.05 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 243.1 MB). Peak memory consumption was 243.1 MB. Max. memory is 7.1 GB. [2018-11-06 21:19:58,124 INFO L168 Benchmark]: Boogie Procedure Inliner took 835.64 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 799.0 MB). Free memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: -978.4 MB). Peak memory consumption was 67.7 MB. Max. memory is 7.1 GB. [2018-11-06 21:19:58,126 INFO L168 Benchmark]: Boogie Preprocessor took 596.25 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 62.8 MB). Peak memory consumption was 62.8 MB. Max. memory is 7.1 GB. [2018-11-06 21:19:58,127 INFO L168 Benchmark]: RCFGBuilder took 12481.90 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 251.1 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 13.9 MB). Peak memory consumption was 596.1 MB. Max. memory is 7.1 GB. [2018-11-06 21:19:58,128 INFO L168 Benchmark]: TraceAbstraction took 202201.05 ms. Allocated memory was 2.6 GB in the beginning and 5.1 GB in the end (delta: 2.6 GB). Free memory was 2.1 GB in the beginning and 2.9 GB in the end (delta: -797.6 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-11-06 21:19:58,135 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.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2361.05 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 243.1 MB). Peak memory consumption was 243.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 835.64 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 799.0 MB). Free memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: -978.4 MB). Peak memory consumption was 67.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 596.25 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 62.8 MB). Peak memory consumption was 62.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 12481.90 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 251.1 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 13.9 MB). Peak memory consumption was 596.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 202201.05 ms. Allocated memory was 2.6 GB in the beginning and 5.1 GB in the end (delta: 2.6 GB). Free memory was 2.1 GB in the beginning and 2.9 GB in the end (delta: -797.6 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 192]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 192). Cancelled while BasicCegarLoop was analyzing trace of length 844 with TraceHistMax 6,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1099 locations, 1 error locations. TIMEOUT Result, 202.1s OverallTime, 14 OverallIterations, 8 TraceHistogramMax, 157.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10326 SDtfs, 32961 SDslu, 3453 SDs, 0 SdLazy, 66715 SolverSat, 18233 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 119.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1984 GetRequests, 1944 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=260561occurred in iteration=7, 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: 28.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 82518 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 7961 NumberOfCodeBlocks, 7961 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 7944 ConstructedInterpolants, 0 QuantifiedInterpolants, 10853022 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2499 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 13063/13095 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown