java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label14_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-0fd1304 [2018-10-23 18:46:25,300 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 18:46:25,302 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 18:46:25,314 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 18:46:25,315 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 18:46:25,316 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 18:46:25,317 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 18:46:25,319 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 18:46:25,321 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 18:46:25,322 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 18:46:25,323 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 18:46:25,324 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 18:46:25,327 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 18:46:25,329 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 18:46:25,333 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 18:46:25,336 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 18:46:25,337 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 18:46:25,344 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 18:46:25,349 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 18:46:25,351 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 18:46:25,352 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 18:46:25,353 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 18:46:25,359 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 18:46:25,359 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 18:46:25,360 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 18:46:25,364 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 18:46:25,365 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 18:46:25,366 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 18:46:25,366 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 18:46:25,372 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 18:46:25,372 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 18:46:25,374 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 18:46:25,375 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 18:46:25,375 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 18:46:25,376 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 18:46:25,376 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 18:46:25,377 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-23 18:46:25,406 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 18:46:25,406 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 18:46:25,407 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 18:46:25,407 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-23 18:46:25,407 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-23 18:46:25,408 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-23 18:46:25,408 INFO L133 SettingsManager]: * Use SBE=true [2018-10-23 18:46:25,408 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 18:46:25,408 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 18:46:25,409 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 18:46:25,409 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 18:46:25,409 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 18:46:25,409 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 18:46:25,409 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 18:46:25,409 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 18:46:25,410 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 18:46:25,410 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 18:46:25,410 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 18:46:25,410 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 18:46:25,410 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 18:46:25,411 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 18:46:25,411 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 18:46:25,411 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 18:46:25,411 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-23 18:46:25,411 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 18:46:25,412 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 18:46:25,412 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 18:46:25,412 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 18:46:25,455 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 18:46:25,467 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 18:46:25,471 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 18:46:25,473 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 18:46:25,473 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 18:46:25,474 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label14_true-unreach-call_false-termination.c [2018-10-23 18:46:25,533 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ca41790b2/3d1f900c54c446bfae054f3c56f24d5c/FLAG37eefba4d [2018-10-23 18:46:26,154 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 18:46:26,157 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label14_true-unreach-call_false-termination.c [2018-10-23 18:46:26,174 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ca41790b2/3d1f900c54c446bfae054f3c56f24d5c/FLAG37eefba4d [2018-10-23 18:46:26,190 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ca41790b2/3d1f900c54c446bfae054f3c56f24d5c [2018-10-23 18:46:26,200 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 18:46:26,201 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 18:46:26,202 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 18:46:26,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 18:46:26,206 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 18:46:26,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:46:26" (1/1) ... [2018-10-23 18:46:26,210 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ecd9993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:46:26, skipping insertion in model container [2018-10-23 18:46:26,211 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:46:26" (1/1) ... [2018-10-23 18:46:26,221 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 18:46:26,281 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 18:46:26,726 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 18:46:26,731 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 18:46:26,876 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 18:46:26,894 INFO L193 MainTranslator]: Completed translation [2018-10-23 18:46:26,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:46:26 WrapperNode [2018-10-23 18:46:26,894 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 18:46:26,895 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 18:46:26,896 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 18:46:26,896 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 18:46:26,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:46:26" (1/1) ... [2018-10-23 18:46:26,924 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:46:26" (1/1) ... [2018-10-23 18:46:27,081 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 18:46:27,082 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 18:46:27,082 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 18:46:27,082 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 18:46:27,093 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:46:26" (1/1) ... [2018-10-23 18:46:27,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:46:26" (1/1) ... [2018-10-23 18:46:27,098 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:46:26" (1/1) ... [2018-10-23 18:46:27,098 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:46:26" (1/1) ... [2018-10-23 18:46:27,120 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:46:26" (1/1) ... [2018-10-23 18:46:27,133 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:46:26" (1/1) ... [2018-10-23 18:46:27,145 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:46:26" (1/1) ... [2018-10-23 18:46:27,152 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 18:46:27,153 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 18:46:27,153 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 18:46:27,153 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 18:46:27,157 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:46:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 18:46:27,232 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-23 18:46:27,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 18:46:27,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 18:46:30,560 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 18:46:30,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:46:30 BoogieIcfgContainer [2018-10-23 18:46:30,561 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 18:46:30,562 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 18:46:30,562 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 18:46:30,566 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 18:46:30,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 06:46:26" (1/3) ... [2018-10-23 18:46:30,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c24bfa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:46:30, skipping insertion in model container [2018-10-23 18:46:30,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:46:26" (2/3) ... [2018-10-23 18:46:30,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c24bfa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:46:30, skipping insertion in model container [2018-10-23 18:46:30,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:46:30" (3/3) ... [2018-10-23 18:46:30,570 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label14_true-unreach-call_false-termination.c [2018-10-23 18:46:30,581 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 18:46:30,591 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-23 18:46:30,611 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-23 18:46:30,650 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-23 18:46:30,651 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 18:46:30,652 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 18:46:30,652 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 18:46:30,652 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 18:46:30,653 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 18:46:30,653 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 18:46:30,653 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 18:46:30,653 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 18:46:30,678 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2018-10-23 18:46:30,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-23 18:46:30,696 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:46:30,697 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:46:30,700 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:46:30,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:46:30,706 INFO L82 PathProgramCache]: Analyzing trace with hash 782686367, now seen corresponding path program 1 times [2018-10-23 18:46:30,709 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:46:30,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:46:30,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:46:30,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:46:30,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:46:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:46:31,623 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-10-23 18:46:32,002 WARN L179 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2018-10-23 18:46:32,336 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2018-10-23 18:46:32,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:46:32,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:46:32,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-23 18:46:32,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-23 18:46:32,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-23 18:46:32,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-23 18:46:32,772 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 10 states. [2018-10-23 18:46:33,191 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-10-23 18:46:35,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:46:35,359 INFO L93 Difference]: Finished difference Result 636 states and 1117 transitions. [2018-10-23 18:46:35,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-23 18:46:35,362 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 132 [2018-10-23 18:46:35,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:46:35,380 INFO L225 Difference]: With dead ends: 636 [2018-10-23 18:46:35,380 INFO L226 Difference]: Without dead ends: 254 [2018-10-23 18:46:35,385 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-10-23 18:46:35,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-10-23 18:46:35,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2018-10-23 18:46:35,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-10-23 18:46:35,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 384 transitions. [2018-10-23 18:46:35,446 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 384 transitions. Word has length 132 [2018-10-23 18:46:35,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:46:35,447 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 384 transitions. [2018-10-23 18:46:35,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-23 18:46:35,448 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 384 transitions. [2018-10-23 18:46:35,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-23 18:46:35,451 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:46:35,451 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:46:35,452 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:46:35,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:46:35,452 INFO L82 PathProgramCache]: Analyzing trace with hash -2122611721, now seen corresponding path program 1 times [2018-10-23 18:46:35,452 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:46:35,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:46:35,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:46:35,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:46:35,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:46:35,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:46:35,674 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-23 18:46:35,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:46:35,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:46:35,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:46:35,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:46:35,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:46:35,679 INFO L87 Difference]: Start difference. First operand 254 states and 384 transitions. Second operand 3 states. [2018-10-23 18:46:36,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:46:36,798 INFO L93 Difference]: Finished difference Result 579 states and 960 transitions. [2018-10-23 18:46:36,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:46:36,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2018-10-23 18:46:36,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:46:36,804 INFO L225 Difference]: With dead ends: 579 [2018-10-23 18:46:36,804 INFO L226 Difference]: Without dead ends: 386 [2018-10-23 18:46:36,806 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:46:36,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-10-23 18:46:36,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2018-10-23 18:46:36,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-10-23 18:46:36,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 594 transitions. [2018-10-23 18:46:36,831 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 594 transitions. Word has length 137 [2018-10-23 18:46:36,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:46:36,832 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 594 transitions. [2018-10-23 18:46:36,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:46:36,833 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 594 transitions. [2018-10-23 18:46:36,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-23 18:46:36,836 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:46:36,837 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:46:36,837 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:46:36,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:46:36,837 INFO L82 PathProgramCache]: Analyzing trace with hash 146041456, now seen corresponding path program 1 times [2018-10-23 18:46:36,838 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:46:36,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:46:36,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:46:36,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:46:36,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:46:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:46:36,991 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-23 18:46:36,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:46:36,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:46:36,992 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:46:36,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:46:36,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:46:36,993 INFO L87 Difference]: Start difference. First operand 386 states and 594 transitions. Second operand 4 states. [2018-10-23 18:46:38,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:46:38,327 INFO L93 Difference]: Finished difference Result 975 states and 1590 transitions. [2018-10-23 18:46:38,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:46:38,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2018-10-23 18:46:38,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:46:38,332 INFO L225 Difference]: With dead ends: 975 [2018-10-23 18:46:38,332 INFO L226 Difference]: Without dead ends: 650 [2018-10-23 18:46:38,334 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:46:38,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-10-23 18:46:38,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2018-10-23 18:46:38,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2018-10-23 18:46:38,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 954 transitions. [2018-10-23 18:46:38,364 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 954 transitions. Word has length 143 [2018-10-23 18:46:38,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:46:38,365 INFO L481 AbstractCegarLoop]: Abstraction has 650 states and 954 transitions. [2018-10-23 18:46:38,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:46:38,365 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 954 transitions. [2018-10-23 18:46:38,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-23 18:46:38,367 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:46:38,368 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:46:38,368 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:46:38,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:46:38,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1898708700, now seen corresponding path program 1 times [2018-10-23 18:46:38,369 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:46:38,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:46:38,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:46:38,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:46:38,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:46:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:46:38,465 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-23 18:46:38,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:46:38,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 18:46:38,466 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:46:38,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:46:38,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:46:38,467 INFO L87 Difference]: Start difference. First operand 650 states and 954 transitions. Second operand 3 states. [2018-10-23 18:46:40,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:46:40,349 INFO L93 Difference]: Finished difference Result 1371 states and 2052 transitions. [2018-10-23 18:46:40,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:46:40,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2018-10-23 18:46:40,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:46:40,354 INFO L225 Difference]: With dead ends: 1371 [2018-10-23 18:46:40,354 INFO L226 Difference]: Without dead ends: 782 [2018-10-23 18:46:40,356 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:46:40,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2018-10-23 18:46:40,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 782. [2018-10-23 18:46:40,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2018-10-23 18:46:40,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1134 transitions. [2018-10-23 18:46:40,390 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1134 transitions. Word has length 151 [2018-10-23 18:46:40,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:46:40,391 INFO L481 AbstractCegarLoop]: Abstraction has 782 states and 1134 transitions. [2018-10-23 18:46:40,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:46:40,391 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1134 transitions. [2018-10-23 18:46:40,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-23 18:46:40,394 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:46:40,394 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:46:40,394 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:46:40,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:46:40,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1347151541, now seen corresponding path program 1 times [2018-10-23 18:46:40,395 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:46:40,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:46:40,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:46:40,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:46:40,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:46:40,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:46:40,682 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-23 18:46:40,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:46:40,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:46:40,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:46:40,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:46:40,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:46:40,684 INFO L87 Difference]: Start difference. First operand 782 states and 1134 transitions. Second operand 4 states. [2018-10-23 18:46:42,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:46:42,099 INFO L93 Difference]: Finished difference Result 2691 states and 4008 transitions. [2018-10-23 18:46:42,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:46:42,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2018-10-23 18:46:42,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:46:42,110 INFO L225 Difference]: With dead ends: 2691 [2018-10-23 18:46:42,111 INFO L226 Difference]: Without dead ends: 1970 [2018-10-23 18:46:42,112 INFO L605 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-10-23 18:46:42,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2018-10-23 18:46:42,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1970. [2018-10-23 18:46:42,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1970 states. [2018-10-23 18:46:42,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1970 states and 2683 transitions. [2018-10-23 18:46:42,149 INFO L78 Accepts]: Start accepts. Automaton has 1970 states and 2683 transitions. Word has length 161 [2018-10-23 18:46:42,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:46:42,149 INFO L481 AbstractCegarLoop]: Abstraction has 1970 states and 2683 transitions. [2018-10-23 18:46:42,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:46:42,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 2683 transitions. [2018-10-23 18:46:42,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-23 18:46:42,155 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:46:42,155 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:46:42,155 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:46:42,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:46:42,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1183098076, now seen corresponding path program 1 times [2018-10-23 18:46:42,156 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:46:42,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:46:42,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:46:42,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:46:42,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:46:42,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:46:42,248 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-23 18:46:42,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:46:42,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:46:42,249 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:46:42,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:46:42,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:46:42,249 INFO L87 Difference]: Start difference. First operand 1970 states and 2683 transitions. Second operand 4 states. [2018-10-23 18:46:43,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:46:43,179 INFO L93 Difference]: Finished difference Result 3879 states and 5300 transitions. [2018-10-23 18:46:43,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:46:43,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2018-10-23 18:46:43,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:46:43,190 INFO L225 Difference]: With dead ends: 3879 [2018-10-23 18:46:43,190 INFO L226 Difference]: Without dead ends: 1970 [2018-10-23 18:46:43,194 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:46:43,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2018-10-23 18:46:43,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1970. [2018-10-23 18:46:43,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1970 states. [2018-10-23 18:46:43,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1970 states and 2659 transitions. [2018-10-23 18:46:43,234 INFO L78 Accepts]: Start accepts. Automaton has 1970 states and 2659 transitions. Word has length 167 [2018-10-23 18:46:43,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:46:43,234 INFO L481 AbstractCegarLoop]: Abstraction has 1970 states and 2659 transitions. [2018-10-23 18:46:43,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:46:43,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 2659 transitions. [2018-10-23 18:46:43,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-23 18:46:43,241 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:46:43,241 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:46:43,241 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:46:43,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:46:43,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1439669736, now seen corresponding path program 1 times [2018-10-23 18:46:43,242 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:46:43,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:46:43,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:46:43,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:46:43,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:46:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:46:43,372 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-23 18:46:43,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:46:43,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:46:43,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:46:43,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:46:43,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:46:43,374 INFO L87 Difference]: Start difference. First operand 1970 states and 2659 transitions. Second operand 3 states. [2018-10-23 18:46:44,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:46:44,403 INFO L93 Difference]: Finished difference Result 5327 states and 7170 transitions. [2018-10-23 18:46:44,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:46:44,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2018-10-23 18:46:44,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:46:44,419 INFO L225 Difference]: With dead ends: 5327 [2018-10-23 18:46:44,419 INFO L226 Difference]: Without dead ends: 2475 [2018-10-23 18:46:44,423 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:46:44,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2018-10-23 18:46:44,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 2475. [2018-10-23 18:46:44,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2475 states. [2018-10-23 18:46:44,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 2886 transitions. [2018-10-23 18:46:44,462 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 2886 transitions. Word has length 170 [2018-10-23 18:46:44,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:46:44,462 INFO L481 AbstractCegarLoop]: Abstraction has 2475 states and 2886 transitions. [2018-10-23 18:46:44,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:46:44,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 2886 transitions. [2018-10-23 18:46:44,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-23 18:46:44,468 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:46:44,468 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:46:44,468 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:46:44,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:46:44,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1304267757, now seen corresponding path program 1 times [2018-10-23 18:46:44,469 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:46:44,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:46:44,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:46:44,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:46:44,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:46:44,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:46:44,612 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 18:46:44,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:46:44,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:46:44,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 18:46:44,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 18:46:44,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:46:44,614 INFO L87 Difference]: Start difference. First operand 2475 states and 2886 transitions. Second operand 5 states. [2018-10-23 18:46:47,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:46:47,633 INFO L93 Difference]: Finished difference Result 7536 states and 8885 transitions. [2018-10-23 18:46:47,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 18:46:47,634 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 184 [2018-10-23 18:46:47,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:46:47,651 INFO L225 Difference]: With dead ends: 7536 [2018-10-23 18:46:47,651 INFO L226 Difference]: Without dead ends: 4590 [2018-10-23 18:46:47,656 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:46:47,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4590 states. [2018-10-23 18:46:47,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4590 to 3657. [2018-10-23 18:46:47,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3657 states. [2018-10-23 18:46:47,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3657 states to 3657 states and 4125 transitions. [2018-10-23 18:46:47,714 INFO L78 Accepts]: Start accepts. Automaton has 3657 states and 4125 transitions. Word has length 184 [2018-10-23 18:46:47,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:46:47,715 INFO L481 AbstractCegarLoop]: Abstraction has 3657 states and 4125 transitions. [2018-10-23 18:46:47,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 18:46:47,715 INFO L276 IsEmpty]: Start isEmpty. Operand 3657 states and 4125 transitions. [2018-10-23 18:46:47,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-23 18:46:47,722 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:46:47,722 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:46:47,723 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:46:47,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:46:47,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1770574550, now seen corresponding path program 1 times [2018-10-23 18:46:47,723 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:46:47,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:46:47,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:46:47,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:46:47,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:46:47,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:46:47,910 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-23 18:46:47,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:46:47,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:46:47,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:46:47,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:46:47,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:46:47,911 INFO L87 Difference]: Start difference. First operand 3657 states and 4125 transitions. Second operand 4 states. [2018-10-23 18:46:49,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:46:49,238 INFO L93 Difference]: Finished difference Result 7787 states and 8844 transitions. [2018-10-23 18:46:49,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:46:49,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 214 [2018-10-23 18:46:49,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:46:49,251 INFO L225 Difference]: With dead ends: 7787 [2018-10-23 18:46:49,252 INFO L226 Difference]: Without dead ends: 3925 [2018-10-23 18:46:49,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:46:49,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3925 states. [2018-10-23 18:46:49,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3925 to 3923. [2018-10-23 18:46:49,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3923 states. [2018-10-23 18:46:49,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3923 states to 3923 states and 4270 transitions. [2018-10-23 18:46:49,314 INFO L78 Accepts]: Start accepts. Automaton has 3923 states and 4270 transitions. Word has length 214 [2018-10-23 18:46:49,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:46:49,314 INFO L481 AbstractCegarLoop]: Abstraction has 3923 states and 4270 transitions. [2018-10-23 18:46:49,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:46:49,314 INFO L276 IsEmpty]: Start isEmpty. Operand 3923 states and 4270 transitions. [2018-10-23 18:46:49,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-10-23 18:46:49,322 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:46:49,323 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 18:46:49,323 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:46:49,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:46:49,323 INFO L82 PathProgramCache]: Analyzing trace with hash 488468739, now seen corresponding path program 1 times [2018-10-23 18:46:49,323 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:46:49,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:46:49,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:46:49,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:46:49,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:46:49,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:46:49,540 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-10-23 18:46:49,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:46:49,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 18:46:49,541 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 18:46:49,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 18:46:49,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:46:49,542 INFO L87 Difference]: Start difference. First operand 3923 states and 4270 transitions. Second operand 3 states. [2018-10-23 18:46:50,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:46:50,102 INFO L93 Difference]: Finished difference Result 7649 states and 8332 transitions. [2018-10-23 18:46:50,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 18:46:50,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2018-10-23 18:46:50,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:46:50,115 INFO L225 Difference]: With dead ends: 7649 [2018-10-23 18:46:50,115 INFO L226 Difference]: Without dead ends: 3385 [2018-10-23 18:46:50,120 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 18:46:50,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3385 states. [2018-10-23 18:46:50,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3385 to 3385. [2018-10-23 18:46:50,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3385 states. [2018-10-23 18:46:50,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 3617 transitions. [2018-10-23 18:46:50,178 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 3617 transitions. Word has length 239 [2018-10-23 18:46:50,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:46:50,179 INFO L481 AbstractCegarLoop]: Abstraction has 3385 states and 3617 transitions. [2018-10-23 18:46:50,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 18:46:50,179 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 3617 transitions. [2018-10-23 18:46:50,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-23 18:46:50,187 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:46:50,188 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2018-10-23 18:46:50,188 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:46:50,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:46:50,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1228233012, now seen corresponding path program 1 times [2018-10-23 18:46:50,189 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:46:50,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:46:50,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:46:50,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:46:50,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:46:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:46:50,376 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-10-23 18:46:50,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:46:50,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:46:50,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-23 18:46:50,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-23 18:46:50,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:46:50,378 INFO L87 Difference]: Start difference. First operand 3385 states and 3617 transitions. Second operand 4 states. [2018-10-23 18:46:51,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:46:51,158 INFO L93 Difference]: Finished difference Result 6576 states and 7029 transitions. [2018-10-23 18:46:51,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:46:51,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 242 [2018-10-23 18:46:51,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:46:51,166 INFO L225 Difference]: With dead ends: 6576 [2018-10-23 18:46:51,166 INFO L226 Difference]: Without dead ends: 2058 [2018-10-23 18:46:51,170 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-23 18:46:51,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2018-10-23 18:46:51,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 2058. [2018-10-23 18:46:51,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2058 states. [2018-10-23 18:46:51,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 2153 transitions. [2018-10-23 18:46:51,195 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 2153 transitions. Word has length 242 [2018-10-23 18:46:51,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:46:51,195 INFO L481 AbstractCegarLoop]: Abstraction has 2058 states and 2153 transitions. [2018-10-23 18:46:51,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-23 18:46:51,196 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 2153 transitions. [2018-10-23 18:46:51,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-10-23 18:46:51,201 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:46:51,201 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2018-10-23 18:46:51,201 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:46:51,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:46:51,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1100970507, now seen corresponding path program 1 times [2018-10-23 18:46:51,202 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:46:51,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:46:51,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:46:51,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:46:51,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:46:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:46:51,718 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-10-23 18:46:51,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:46:51,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:46:51,719 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 18:46:51,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 18:46:51,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:46:51,720 INFO L87 Difference]: Start difference. First operand 2058 states and 2153 transitions. Second operand 5 states. [2018-10-23 18:46:52,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:46:52,744 INFO L93 Difference]: Finished difference Result 4320 states and 4530 transitions. [2018-10-23 18:46:52,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-23 18:46:52,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 264 [2018-10-23 18:46:52,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:46:52,754 INFO L225 Difference]: With dead ends: 4320 [2018-10-23 18:46:52,754 INFO L226 Difference]: Without dead ends: 2057 [2018-10-23 18:46:52,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:46:52,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2057 states. [2018-10-23 18:46:52,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2057 to 2057. [2018-10-23 18:46:52,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2057 states. [2018-10-23 18:46:52,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 2147 transitions. [2018-10-23 18:46:52,784 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 2147 transitions. Word has length 264 [2018-10-23 18:46:52,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:46:52,785 INFO L481 AbstractCegarLoop]: Abstraction has 2057 states and 2147 transitions. [2018-10-23 18:46:52,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 18:46:52,785 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 2147 transitions. [2018-10-23 18:46:52,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-10-23 18:46:52,791 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:46:52,792 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-23 18:46:52,792 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:46:52,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:46:52,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1163586335, now seen corresponding path program 1 times [2018-10-23 18:46:52,793 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:46:52,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:46:52,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:46:52,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:46:52,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:46:52,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:46:53,319 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-23 18:46:53,836 WARN L179 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2018-10-23 18:46:54,358 WARN L179 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2018-10-23 18:46:55,030 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 223 proven. 5 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-10-23 18:46:55,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 18:46:55,031 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 18:46:55,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:46:55,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:46:55,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 18:46:55,361 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-10-23 18:46:55,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 18:46:55,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2018-10-23 18:46:55,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-23 18:46:55,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-23 18:46:55,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-10-23 18:46:55,387 INFO L87 Difference]: Start difference. First operand 2057 states and 2147 transitions. Second operand 14 states. [2018-10-23 18:46:57,766 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 22 [2018-10-23 18:47:02,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:47:02,557 INFO L93 Difference]: Finished difference Result 4113 states and 4298 transitions. [2018-10-23 18:47:02,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-23 18:47:02,557 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 288 [2018-10-23 18:47:02,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:47:02,565 INFO L225 Difference]: With dead ends: 4113 [2018-10-23 18:47:02,565 INFO L226 Difference]: Without dead ends: 2117 [2018-10-23 18:47:02,567 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 290 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=157, Invalid=263, Unknown=0, NotChecked=0, Total=420 [2018-10-23 18:47:02,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2117 states. [2018-10-23 18:47:02,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2117 to 2117. [2018-10-23 18:47:02,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2117 states. [2018-10-23 18:47:02,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 2209 transitions. [2018-10-23 18:47:02,603 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 2209 transitions. Word has length 288 [2018-10-23 18:47:02,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:47:02,604 INFO L481 AbstractCegarLoop]: Abstraction has 2117 states and 2209 transitions. [2018-10-23 18:47:02,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-23 18:47:02,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 2209 transitions. [2018-10-23 18:47:02,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-10-23 18:47:02,611 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 18:47:02,611 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-10-23 18:47:02,612 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 18:47:02,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 18:47:02,612 INFO L82 PathProgramCache]: Analyzing trace with hash 470577499, now seen corresponding path program 1 times [2018-10-23 18:47:02,612 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-23 18:47:02,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-23 18:47:02,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:47:02,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 18:47:02,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 18:47:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 18:47:03,085 WARN L179 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-23 18:47:03,735 WARN L179 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2018-10-23 18:47:03,865 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2018-10-23 18:47:03,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 18:47:03,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-23 18:47:03,866 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-23 18:47:03,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-23 18:47:03,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:47:03,867 INFO L87 Difference]: Start difference. First operand 2117 states and 2209 transitions. Second operand 5 states. [2018-10-23 18:47:04,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 18:47:04,549 INFO L93 Difference]: Finished difference Result 4038 states and 4216 transitions. [2018-10-23 18:47:04,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-23 18:47:04,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 300 [2018-10-23 18:47:04,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 18:47:04,550 INFO L225 Difference]: With dead ends: 4038 [2018-10-23 18:47:04,550 INFO L226 Difference]: Without dead ends: 0 [2018-10-23 18:47:04,553 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-23 18:47:04,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-23 18:47:04,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-23 18:47:04,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-23 18:47:04,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-23 18:47:04,554 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 300 [2018-10-23 18:47:04,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 18:47:04,555 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-23 18:47:04,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-23 18:47:04,555 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-23 18:47:04,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-23 18:47:04,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-23 18:47:05,253 WARN L179 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2018-10-23 18:47:06,095 WARN L179 SmtUtils]: Spent 838.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2018-10-23 18:47:06,101 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-10-23 18:47:06,101 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-10-23 18:47:06,102 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,102 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,102 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,102 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,102 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,102 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,102 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-10-23 18:47:06,102 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-10-23 18:47:06,102 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-10-23 18:47:06,102 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-10-23 18:47:06,103 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-10-23 18:47:06,103 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-10-23 18:47:06,103 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-10-23 18:47:06,103 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-10-23 18:47:06,103 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-10-23 18:47:06,103 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-10-23 18:47:06,103 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,103 INFO L425 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,103 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,103 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,104 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,104 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,104 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-10-23 18:47:06,104 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-10-23 18:47:06,104 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-10-23 18:47:06,104 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-10-23 18:47:06,104 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-10-23 18:47:06,104 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-10-23 18:47:06,105 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-10-23 18:47:06,105 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-10-23 18:47:06,105 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-10-23 18:47:06,105 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-10-23 18:47:06,105 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-10-23 18:47:06,105 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-10-23 18:47:06,105 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-10-23 18:47:06,105 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-10-23 18:47:06,106 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-10-23 18:47:06,106 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,106 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,106 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,106 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,106 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,106 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-10-23 18:47:06,107 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-10-23 18:47:06,107 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-10-23 18:47:06,107 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-10-23 18:47:06,107 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-10-23 18:47:06,107 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-10-23 18:47:06,107 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-10-23 18:47:06,107 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-10-23 18:47:06,107 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-10-23 18:47:06,108 INFO L421 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1))) (let ((.cse1 (= ~a8~0 15)) (.cse12 (= ~a20~0 1)) (.cse15 (not .cse7))) (let ((.cse11 (and .cse1 .cse12 .cse15)) (.cse14 (= ~a16~0 5)) (.cse0 (not .cse12)) (.cse6 (not (= 6 ~a16~0))) (.cse9 (= ~a16~0 4)) (.cse8 (= ~a21~0 1)) (.cse5 (<= ~a21~0 0)) (.cse13 (= ~a8~0 13)) (.cse2 (= ~a12~0 8)) (.cse10 (<= ~a17~0 0)) (.cse3 (= ~a16~0 6)) (.cse4 (= ~a7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6 .cse2) (and .cse4 .cse7 .cse8) (and .cse9 .cse2 .cse10 .cse11) (and (not .cse4) .cse9 (= ~a8~0 14) .cse2 .cse10 .cse8) (and .cse7 .cse2 .cse8 .cse12) (and .cse4 .cse5 .cse6 .cse13 .cse2 .cse7) (and .cse1 .cse10 .cse14) (and .cse11 .cse3) (and .cse0 .cse1 .cse6 .cse8) (and .cse4 .cse1 .cse14) (and .cse4 .cse2 .cse15 .cse14) (and .cse4 .cse5 .cse9 .cse13 .cse2 .cse10 (= ULTIMATE.start_calculate_output_~input 4)) (and .cse0 .cse6 .cse15) (and .cse9 .cse13 .cse2 .cse10 .cse8 (<= ~a7~0 0)) (and .cse4 .cse5 .cse13 .cse2 .cse10 .cse12 .cse3) (and .cse4 .cse1 .cse12 .cse15))))) [2018-10-23 18:47:06,108 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,108 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,109 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,109 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,109 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,109 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-10-23 18:47:06,109 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-10-23 18:47:06,109 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-10-23 18:47:06,109 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-10-23 18:47:06,110 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-10-23 18:47:06,110 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-10-23 18:47:06,110 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-10-23 18:47:06,110 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-10-23 18:47:06,110 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-10-23 18:47:06,110 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-10-23 18:47:06,110 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-10-23 18:47:06,110 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-10-23 18:47:06,111 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-10-23 18:47:06,111 INFO L428 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-10-23 18:47:06,111 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,111 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,111 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,111 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,111 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,111 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-10-23 18:47:06,111 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-10-23 18:47:06,111 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-10-23 18:47:06,111 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-10-23 18:47:06,112 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-10-23 18:47:06,112 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-10-23 18:47:06,112 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-10-23 18:47:06,112 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-10-23 18:47:06,112 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-10-23 18:47:06,112 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,112 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,112 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,112 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,112 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,112 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-10-23 18:47:06,113 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-10-23 18:47:06,113 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-10-23 18:47:06,113 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-10-23 18:47:06,113 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-10-23 18:47:06,113 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-10-23 18:47:06,113 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-10-23 18:47:06,113 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-10-23 18:47:06,113 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-10-23 18:47:06,113 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-10-23 18:47:06,113 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-10-23 18:47:06,113 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-10-23 18:47:06,113 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-10-23 18:47:06,114 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-10-23 18:47:06,114 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-10-23 18:47:06,114 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-10-23 18:47:06,114 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,114 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,114 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,114 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1))) (let ((.cse1 (= ~a8~0 15)) (.cse12 (= ~a20~0 1)) (.cse15 (not .cse7))) (let ((.cse11 (and .cse1 .cse12 .cse15)) (.cse14 (= ~a16~0 5)) (.cse0 (not .cse12)) (.cse6 (not (= 6 ~a16~0))) (.cse9 (= ~a16~0 4)) (.cse8 (= ~a21~0 1)) (.cse5 (<= ~a21~0 0)) (.cse13 (= ~a8~0 13)) (.cse2 (= ~a12~0 8)) (.cse10 (<= ~a17~0 0)) (.cse3 (= ~a16~0 6)) (.cse4 (= ~a7~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse6 .cse2) (and .cse4 .cse7 .cse8) (and .cse9 .cse2 .cse10 .cse11) (and (not .cse4) .cse9 (= ~a8~0 14) .cse2 .cse10 .cse8) (and .cse7 .cse2 .cse8 .cse12) (and .cse4 .cse5 .cse6 .cse13 .cse2 .cse7) (and .cse1 .cse10 .cse14) (and .cse11 .cse3) (and .cse0 .cse1 .cse6 .cse8) (and .cse4 .cse1 .cse14) (and .cse4 .cse2 .cse15 .cse14) (and .cse4 .cse5 .cse9 .cse13 .cse2 .cse10 (= ULTIMATE.start_calculate_output_~input 4)) (and .cse0 .cse6 .cse15) (and .cse9 .cse13 .cse2 .cse10 .cse8 (<= ~a7~0 0)) (and .cse4 .cse5 .cse13 .cse2 .cse10 .cse12 .cse3) (and .cse4 .cse1 .cse12 .cse15))))) [2018-10-23 18:47:06,114 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,114 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,114 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-10-23 18:47:06,115 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-10-23 18:47:06,115 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-10-23 18:47:06,115 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-10-23 18:47:06,115 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-10-23 18:47:06,115 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-10-23 18:47:06,115 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-10-23 18:47:06,115 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-10-23 18:47:06,115 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,115 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,115 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,115 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,116 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,116 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-10-23 18:47:06,116 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-23 18:47:06,116 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-10-23 18:47:06,116 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-10-23 18:47:06,116 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-10-23 18:47:06,116 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-10-23 18:47:06,116 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-10-23 18:47:06,116 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-10-23 18:47:06,116 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-10-23 18:47:06,116 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-10-23 18:47:06,116 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-10-23 18:47:06,116 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-10-23 18:47:06,116 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-10-23 18:47:06,117 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,117 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,117 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,117 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,117 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,117 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-10-23 18:47:06,117 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,117 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-10-23 18:47:06,117 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-10-23 18:47:06,117 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-23 18:47:06,117 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-10-23 18:47:06,117 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-10-23 18:47:06,117 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-10-23 18:47:06,117 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-10-23 18:47:06,118 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-10-23 18:47:06,118 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-10-23 18:47:06,118 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-10-23 18:47:06,118 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-10-23 18:47:06,118 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-10-23 18:47:06,118 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-10-23 18:47:06,118 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,118 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,118 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,118 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,118 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,118 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,118 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-10-23 18:47:06,119 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 569) no Hoare annotation was computed. [2018-10-23 18:47:06,119 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-10-23 18:47:06,119 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-10-23 18:47:06,119 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-10-23 18:47:06,119 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-10-23 18:47:06,119 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-10-23 18:47:06,119 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-10-23 18:47:06,119 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-10-23 18:47:06,119 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-10-23 18:47:06,119 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-10-23 18:47:06,120 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-10-23 18:47:06,120 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-10-23 18:47:06,120 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-10-23 18:47:06,120 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-10-23 18:47:06,120 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-10-23 18:47:06,120 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-10-23 18:47:06,120 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,120 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,120 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,120 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,120 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,120 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-10-23 18:47:06,121 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-10-23 18:47:06,121 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-10-23 18:47:06,121 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-10-23 18:47:06,121 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-10-23 18:47:06,121 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-10-23 18:47:06,121 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-10-23 18:47:06,121 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-10-23 18:47:06,121 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-10-23 18:47:06,121 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-10-23 18:47:06,121 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-10-23 18:47:06,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 06:47:06 BoogieIcfgContainer [2018-10-23 18:47:06,168 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-23 18:47:06,172 INFO L168 Benchmark]: Toolchain (without parser) took 39972.18 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -260.6 MB). Peak memory consumption was 926.4 MB. Max. memory is 7.1 GB. [2018-10-23 18:47:06,174 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 18:47:06,175 INFO L168 Benchmark]: CACSL2BoogieTranslator took 693.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-23 18:47:06,175 INFO L168 Benchmark]: Boogie Procedure Inliner took 185.98 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 751.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -838.6 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. [2018-10-23 18:47:06,176 INFO L168 Benchmark]: Boogie Preprocessor took 71.07 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 18:47:06,179 INFO L168 Benchmark]: RCFGBuilder took 3407.73 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 115.0 MB). Peak memory consumption was 115.0 MB. Max. memory is 7.1 GB. [2018-10-23 18:47:06,179 INFO L168 Benchmark]: TraceAbstraction took 35606.73 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 435.2 MB). Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 420.8 MB). Peak memory consumption was 855.9 MB. Max. memory is 7.1 GB. [2018-10-23 18:47:06,187 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 693.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 185.98 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 751.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -838.6 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 71.07 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3407.73 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 115.0 MB). Peak memory consumption was 115.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 35606.73 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 435.2 MB). Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 420.8 MB). Peak memory consumption was 855.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 569]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(a20 == 1) && a8 == 15) && a12 == 8) && a16 == 6) || ((((a7 == 1 && !(a20 == 1)) && a21 <= 0) && !(6 == a16)) && a12 == 8)) || ((a7 == 1 && a17 == 1) && a21 == 1)) || (((a16 == 4 && a12 == 8) && a17 <= 0) && (a8 == 15 && a20 == 1) && !(a17 == 1))) || (((((!(a7 == 1) && a16 == 4) && a8 == 14) && a12 == 8) && a17 <= 0) && a21 == 1)) || (((a17 == 1 && a12 == 8) && a21 == 1) && a20 == 1)) || (((((a7 == 1 && a21 <= 0) && !(6 == a16)) && a8 == 13) && a12 == 8) && a17 == 1)) || ((a8 == 15 && a17 <= 0) && a16 == 5)) || (((a8 == 15 && a20 == 1) && !(a17 == 1)) && a16 == 6)) || (((!(a20 == 1) && a8 == 15) && !(6 == a16)) && a21 == 1)) || ((a7 == 1 && a8 == 15) && a16 == 5)) || (((a7 == 1 && a12 == 8) && !(a17 == 1)) && a16 == 5)) || ((((((a7 == 1 && a21 <= 0) && a16 == 4) && a8 == 13) && a12 == 8) && a17 <= 0) && input == 4)) || ((!(a20 == 1) && !(6 == a16)) && !(a17 == 1))) || (((((a16 == 4 && a8 == 13) && a12 == 8) && a17 <= 0) && a21 == 1) && a7 <= 0)) || ((((((a7 == 1 && a21 <= 0) && a8 == 13) && a12 == 8) && a17 <= 0) && a20 == 1) && a16 == 6)) || (((a7 == 1 && a8 == 15) && a20 == 1) && !(a17 == 1)) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(a20 == 1) && a8 == 15) && a12 == 8) && a16 == 6) || ((((a7 == 1 && !(a20 == 1)) && a21 <= 0) && !(6 == a16)) && a12 == 8)) || ((a7 == 1 && a17 == 1) && a21 == 1)) || (((a16 == 4 && a12 == 8) && a17 <= 0) && (a8 == 15 && a20 == 1) && !(a17 == 1))) || (((((!(a7 == 1) && a16 == 4) && a8 == 14) && a12 == 8) && a17 <= 0) && a21 == 1)) || (((a17 == 1 && a12 == 8) && a21 == 1) && a20 == 1)) || (((((a7 == 1 && a21 <= 0) && !(6 == a16)) && a8 == 13) && a12 == 8) && a17 == 1)) || ((a8 == 15 && a17 <= 0) && a16 == 5)) || (((a8 == 15 && a20 == 1) && !(a17 == 1)) && a16 == 6)) || (((!(a20 == 1) && a8 == 15) && !(6 == a16)) && a21 == 1)) || ((a7 == 1 && a8 == 15) && a16 == 5)) || (((a7 == 1 && a12 == 8) && !(a17 == 1)) && a16 == 5)) || ((((((a7 == 1 && a21 <= 0) && a16 == 4) && a8 == 13) && a12 == 8) && a17 <= 0) && input == 4)) || ((!(a20 == 1) && !(6 == a16)) && !(a17 == 1))) || (((((a16 == 4 && a8 == 13) && a12 == 8) && a17 <= 0) && a21 == 1) && a7 <= 0)) || ((((((a7 == 1 && a21 <= 0) && a8 == 13) && a12 == 8) && a17 <= 0) && a20 == 1) && a16 == 6)) || (((a7 == 1 && a8 == 15) && a20 == 1) && !(a17 == 1)) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 199 locations, 1 error locations. SAFE Result, 35.4s OverallTime, 14 OverallIterations, 6 TraceHistogramMax, 25.0s AutomataDifference, 0.0s DeadEndRemovalTime, 1.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 1782 SDtfs, 4244 SDslu, 912 SDs, 0 SdLazy, 10260 SolverSat, 1338 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 374 GetRequests, 309 SyntacticMatches, 9 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3923occurred in iteration=9, 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: 0.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 935 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 96 NumberOfFragments, 543 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1155 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 390 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 3080 NumberOfCodeBlocks, 3080 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3065 ConstructedInterpolants, 0 QuantifiedInterpolants, 3378562 SizeOfPredicates, 1 NumberOfNonLiveVariables, 492 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 1994/1999 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...