./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loop-invgen/apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/loop-invgen/apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e55536c26dc3d2371d51cd4bd073d4d19c2d7077 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 17:36:14,307 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 17:36:14,308 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 17:36:14,320 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 17:36:14,321 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 17:36:14,322 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 17:36:14,323 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 17:36:14,325 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 17:36:14,327 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 17:36:14,328 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 17:36:14,329 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 17:36:14,329 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 17:36:14,330 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 17:36:14,331 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 17:36:14,333 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 17:36:14,333 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 17:36:14,334 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 17:36:14,336 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 17:36:14,338 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 17:36:14,339 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 17:36:14,341 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 17:36:14,342 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 17:36:14,344 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 17:36:14,345 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 17:36:14,345 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 17:36:14,346 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 17:36:14,346 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 17:36:14,347 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 17:36:14,349 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 17:36:14,350 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 17:36:14,350 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 17:36:14,351 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 17:36:14,351 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 17:36:14,351 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 17:36:14,352 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 17:36:14,352 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 17:36:14,353 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-14 17:36:14,367 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 17:36:14,368 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 17:36:14,369 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 17:36:14,369 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 17:36:14,369 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 17:36:14,369 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 17:36:14,370 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 17:36:14,370 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 17:36:14,370 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 17:36:14,370 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 17:36:14,370 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 17:36:14,370 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 17:36:14,371 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 17:36:14,372 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 17:36:14,372 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 17:36:14,372 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 17:36:14,373 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 17:36:14,373 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 17:36:14,373 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 17:36:14,373 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 17:36:14,373 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 17:36:14,373 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 17:36:14,374 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 17:36:14,375 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 17:36:14,375 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 17:36:14,375 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 17:36:14,375 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 17:36:14,376 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e55536c26dc3d2371d51cd4bd073d4d19c2d7077 [2019-01-14 17:36:14,410 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 17:36:14,423 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 17:36:14,427 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 17:36:14,428 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 17:36:14,429 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 17:36:14,429 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-invgen/apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c [2019-01-14 17:36:14,483 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75fb04ba3/b5843cabd25d4c0fa49c6d488ddf921d/FLAGd67e6f569 [2019-01-14 17:36:14,939 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 17:36:14,940 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-invgen/apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c [2019-01-14 17:36:14,946 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75fb04ba3/b5843cabd25d4c0fa49c6d488ddf921d/FLAGd67e6f569 [2019-01-14 17:36:15,284 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75fb04ba3/b5843cabd25d4c0fa49c6d488ddf921d [2019-01-14 17:36:15,288 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 17:36:15,290 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 17:36:15,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 17:36:15,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 17:36:15,298 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 17:36:15,298 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 05:36:15" (1/1) ... [2019-01-14 17:36:15,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6339f23e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:36:15, skipping insertion in model container [2019-01-14 17:36:15,301 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 05:36:15" (1/1) ... [2019-01-14 17:36:15,310 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 17:36:15,346 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 17:36:15,547 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 17:36:15,553 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 17:36:15,593 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 17:36:15,617 INFO L195 MainTranslator]: Completed translation [2019-01-14 17:36:15,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:36:15 WrapperNode [2019-01-14 17:36:15,618 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 17:36:15,619 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 17:36:15,619 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 17:36:15,619 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 17:36:15,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:36:15" (1/1) ... [2019-01-14 17:36:15,639 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:36:15" (1/1) ... [2019-01-14 17:36:15,688 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 17:36:15,689 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 17:36:15,689 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 17:36:15,689 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 17:36:15,755 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:36:15" (1/1) ... [2019-01-14 17:36:15,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:36:15" (1/1) ... [2019-01-14 17:36:15,758 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:36:15" (1/1) ... [2019-01-14 17:36:15,758 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:36:15" (1/1) ... [2019-01-14 17:36:15,763 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:36:15" (1/1) ... [2019-01-14 17:36:15,767 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:36:15" (1/1) ... [2019-01-14 17:36:15,772 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:36:15" (1/1) ... [2019-01-14 17:36:15,775 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 17:36:15,776 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 17:36:15,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 17:36:15,777 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 17:36:15,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:36:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 17:36:15,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 17:36:15,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 17:36:16,538 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 17:36:16,538 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-14 17:36:16,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 05:36:16 BoogieIcfgContainer [2019-01-14 17:36:16,540 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 17:36:16,541 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 17:36:16,541 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 17:36:16,544 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 17:36:16,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 05:36:15" (1/3) ... [2019-01-14 17:36:16,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46279910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 05:36:16, skipping insertion in model container [2019-01-14 17:36:16,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 05:36:15" (2/3) ... [2019-01-14 17:36:16,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46279910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 05:36:16, skipping insertion in model container [2019-01-14 17:36:16,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 05:36:16" (3/3) ... [2019-01-14 17:36:16,548 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c [2019-01-14 17:36:16,559 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 17:36:16,567 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-01-14 17:36:16,584 INFO L257 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-01-14 17:36:16,615 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 17:36:16,616 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 17:36:16,616 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 17:36:16,616 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 17:36:16,616 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 17:36:16,616 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 17:36:16,617 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 17:36:16,617 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 17:36:16,617 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 17:36:16,635 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2019-01-14 17:36:16,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 17:36:16,646 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:36:16,647 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:36:16,651 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:36:16,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:36:16,657 INFO L82 PathProgramCache]: Analyzing trace with hash -2034435078, now seen corresponding path program 1 times [2019-01-14 17:36:16,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:36:16,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:36:16,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:16,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:36:16,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:36:16,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:36:16,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:36:16,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 17:36:16,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 17:36:16,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 17:36:16,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 17:36:16,837 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2019-01-14 17:36:16,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:36:16,870 INFO L93 Difference]: Finished difference Result 88 states and 123 transitions. [2019-01-14 17:36:16,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 17:36:16,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-01-14 17:36:16,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:36:16,884 INFO L225 Difference]: With dead ends: 88 [2019-01-14 17:36:16,884 INFO L226 Difference]: Without dead ends: 76 [2019-01-14 17:36:16,887 INFO L631 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 [2019-01-14 17:36:16,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-14 17:36:16,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-01-14 17:36:16,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-14 17:36:16,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2019-01-14 17:36:16,934 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 15 [2019-01-14 17:36:16,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:36:16,937 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2019-01-14 17:36:16,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 17:36:16,937 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2019-01-14 17:36:16,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 17:36:16,938 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:36:16,938 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:36:16,940 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:36:16,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:36:16,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1357026114, now seen corresponding path program 1 times [2019-01-14 17:36:16,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:36:16,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:36:16,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:16,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:36:16,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:16,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:36:17,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:36:17,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:36:17,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 17:36:17,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 17:36:17,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 17:36:17,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 17:36:17,290 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 6 states. [2019-01-14 17:36:17,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:36:17,527 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-01-14 17:36:17,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 17:36:17,528 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-01-14 17:36:17,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:36:17,529 INFO L225 Difference]: With dead ends: 76 [2019-01-14 17:36:17,530 INFO L226 Difference]: Without dead ends: 74 [2019-01-14 17:36:17,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-14 17:36:17,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-14 17:36:17,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-01-14 17:36:17,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-14 17:36:17,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2019-01-14 17:36:17,540 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 16 [2019-01-14 17:36:17,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:36:17,541 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2019-01-14 17:36:17,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 17:36:17,541 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2019-01-14 17:36:17,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 17:36:17,542 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:36:17,542 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:36:17,543 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:36:17,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:36:17,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1567835227, now seen corresponding path program 1 times [2019-01-14 17:36:17,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:36:17,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:36:17,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:17,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:36:17,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:17,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:36:17,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:36:17,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:36:17,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 17:36:17,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 17:36:17,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 17:36:17,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:36:17,707 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 5 states. [2019-01-14 17:36:18,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:36:18,019 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2019-01-14 17:36:18,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 17:36:18,020 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-01-14 17:36:18,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:36:18,022 INFO L225 Difference]: With dead ends: 112 [2019-01-14 17:36:18,022 INFO L226 Difference]: Without dead ends: 110 [2019-01-14 17:36:18,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-14 17:36:18,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-14 17:36:18,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 72. [2019-01-14 17:36:18,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-14 17:36:18,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2019-01-14 17:36:18,033 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 18 [2019-01-14 17:36:18,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:36:18,033 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2019-01-14 17:36:18,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 17:36:18,034 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2019-01-14 17:36:18,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 17:36:18,034 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:36:18,035 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:36:18,035 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:36:18,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:36:18,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1358247672, now seen corresponding path program 1 times [2019-01-14 17:36:18,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:36:18,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:36:18,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:18,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:36:18,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:36:18,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:36:18,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:36:18,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 17:36:18,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 17:36:18,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 17:36:18,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 17:36:18,227 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 6 states. [2019-01-14 17:36:18,499 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-14 17:36:18,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:36:18,644 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2019-01-14 17:36:18,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 17:36:18,645 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-01-14 17:36:18,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:36:18,646 INFO L225 Difference]: With dead ends: 72 [2019-01-14 17:36:18,646 INFO L226 Difference]: Without dead ends: 70 [2019-01-14 17:36:18,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-01-14 17:36:18,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-14 17:36:18,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-01-14 17:36:18,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-14 17:36:18,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2019-01-14 17:36:18,656 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 19 [2019-01-14 17:36:18,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:36:18,657 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2019-01-14 17:36:18,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 17:36:18,658 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2019-01-14 17:36:18,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 17:36:18,658 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:36:18,659 INFO L402 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] [2019-01-14 17:36:18,660 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:36:18,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:36:18,660 INFO L82 PathProgramCache]: Analyzing trace with hash -665385716, now seen corresponding path program 1 times [2019-01-14 17:36:18,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:36:18,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:36:18,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:18,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:36:18,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:36:18,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:36:18,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:36:18,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 17:36:18,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 17:36:18,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 17:36:18,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:36:18,738 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 5 states. [2019-01-14 17:36:19,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:36:19,015 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2019-01-14 17:36:19,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 17:36:19,018 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-01-14 17:36:19,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:36:19,020 INFO L225 Difference]: With dead ends: 137 [2019-01-14 17:36:19,020 INFO L226 Difference]: Without dead ends: 135 [2019-01-14 17:36:19,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-14 17:36:19,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-14 17:36:19,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 73. [2019-01-14 17:36:19,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-14 17:36:19,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2019-01-14 17:36:19,031 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 22 [2019-01-14 17:36:19,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:36:19,033 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2019-01-14 17:36:19,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 17:36:19,033 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2019-01-14 17:36:19,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 17:36:19,034 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:36:19,035 INFO L402 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] [2019-01-14 17:36:19,035 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:36:19,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:36:19,036 INFO L82 PathProgramCache]: Analyzing trace with hash -661217951, now seen corresponding path program 1 times [2019-01-14 17:36:19,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:36:19,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:36:19,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:19,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:36:19,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:19,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:36:19,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:36:19,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:36:19,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 17:36:19,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 17:36:19,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 17:36:19,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:36:19,151 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 5 states. [2019-01-14 17:36:19,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:36:19,826 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2019-01-14 17:36:19,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 17:36:19,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-01-14 17:36:19,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:36:19,828 INFO L225 Difference]: With dead ends: 104 [2019-01-14 17:36:19,828 INFO L226 Difference]: Without dead ends: 102 [2019-01-14 17:36:19,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-14 17:36:19,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-14 17:36:19,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 75. [2019-01-14 17:36:19,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-14 17:36:19,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2019-01-14 17:36:19,839 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 22 [2019-01-14 17:36:19,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:36:19,839 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2019-01-14 17:36:19,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 17:36:19,839 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2019-01-14 17:36:19,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 17:36:19,841 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:36:19,841 INFO L402 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] [2019-01-14 17:36:19,843 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:36:19,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:36:19,843 INFO L82 PathProgramCache]: Analyzing trace with hash 847883539, now seen corresponding path program 1 times [2019-01-14 17:36:19,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:36:19,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:36:19,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:19,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:36:19,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:36:19,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:36:19,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:36:19,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 17:36:19,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 17:36:19,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 17:36:19,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:36:19,953 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 5 states. [2019-01-14 17:36:20,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:36:20,120 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2019-01-14 17:36:20,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 17:36:20,123 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-01-14 17:36:20,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:36:20,124 INFO L225 Difference]: With dead ends: 117 [2019-01-14 17:36:20,124 INFO L226 Difference]: Without dead ends: 115 [2019-01-14 17:36:20,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-14 17:36:20,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-14 17:36:20,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 73. [2019-01-14 17:36:20,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-14 17:36:20,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2019-01-14 17:36:20,133 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 23 [2019-01-14 17:36:20,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:36:20,134 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2019-01-14 17:36:20,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 17:36:20,134 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2019-01-14 17:36:20,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 17:36:20,135 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:36:20,135 INFO L402 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] [2019-01-14 17:36:20,136 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:36:20,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:36:20,136 INFO L82 PathProgramCache]: Analyzing trace with hash 977084131, now seen corresponding path program 1 times [2019-01-14 17:36:20,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:36:20,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:36:20,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:20,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:36:20,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:20,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:36:20,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:36:20,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:36:20,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 17:36:20,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 17:36:20,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 17:36:20,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:36:20,223 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 5 states. [2019-01-14 17:36:20,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:36:20,349 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2019-01-14 17:36:20,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 17:36:20,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-01-14 17:36:20,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:36:20,352 INFO L225 Difference]: With dead ends: 73 [2019-01-14 17:36:20,352 INFO L226 Difference]: Without dead ends: 71 [2019-01-14 17:36:20,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-14 17:36:20,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-14 17:36:20,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-14 17:36:20,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-14 17:36:20,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2019-01-14 17:36:20,360 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 23 [2019-01-14 17:36:20,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:36:20,360 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2019-01-14 17:36:20,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 17:36:20,361 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2019-01-14 17:36:20,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-14 17:36:20,362 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:36:20,362 INFO L402 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] [2019-01-14 17:36:20,362 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:36:20,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:36:20,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1619855478, now seen corresponding path program 1 times [2019-01-14 17:36:20,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:36:20,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:36:20,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:20,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:36:20,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:36:20,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:36:20,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:36:20,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 17:36:20,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 17:36:20,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 17:36:20,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 17:36:20,403 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 3 states. [2019-01-14 17:36:20,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:36:20,467 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2019-01-14 17:36:20,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 17:36:20,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-01-14 17:36:20,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:36:20,470 INFO L225 Difference]: With dead ends: 111 [2019-01-14 17:36:20,470 INFO L226 Difference]: Without dead ends: 71 [2019-01-14 17:36:20,471 INFO L631 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 [2019-01-14 17:36:20,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-14 17:36:20,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-14 17:36:20,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-14 17:36:20,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2019-01-14 17:36:20,478 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 25 [2019-01-14 17:36:20,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:36:20,478 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2019-01-14 17:36:20,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 17:36:20,478 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2019-01-14 17:36:20,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 17:36:20,479 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:36:20,479 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:36:20,480 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:36:20,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:36:20,480 INFO L82 PathProgramCache]: Analyzing trace with hash 595608307, now seen corresponding path program 1 times [2019-01-14 17:36:20,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:36:20,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:36:20,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:20,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:36:20,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:36:20,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 17:36:20,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 17:36:20,698 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 17:36:20,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:36:20,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:36:20,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:36:20,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 17:36:20,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 17:36:20,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-01-14 17:36:20,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 17:36:20,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 17:36:20,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-01-14 17:36:20,862 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 9 states. [2019-01-14 17:36:21,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:36:21,105 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2019-01-14 17:36:21,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 17:36:21,106 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-01-14 17:36:21,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:36:21,107 INFO L225 Difference]: With dead ends: 111 [2019-01-14 17:36:21,107 INFO L226 Difference]: Without dead ends: 109 [2019-01-14 17:36:21,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-01-14 17:36:21,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-14 17:36:21,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 68. [2019-01-14 17:36:21,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-14 17:36:21,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2019-01-14 17:36:21,115 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 26 [2019-01-14 17:36:21,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:36:21,115 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2019-01-14 17:36:21,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 17:36:21,115 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2019-01-14 17:36:21,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 17:36:21,116 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:36:21,116 INFO L402 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] [2019-01-14 17:36:21,117 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:36:21,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:36:21,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1780382557, now seen corresponding path program 1 times [2019-01-14 17:36:21,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:36:21,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:36:21,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:21,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:36:21,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:21,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:36:21,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:36:21,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:36:21,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 17:36:21,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 17:36:21,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 17:36:21,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-14 17:36:21,234 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 7 states. [2019-01-14 17:36:21,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:36:21,394 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2019-01-14 17:36:21,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 17:36:21,395 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-01-14 17:36:21,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:36:21,396 INFO L225 Difference]: With dead ends: 69 [2019-01-14 17:36:21,396 INFO L226 Difference]: Without dead ends: 67 [2019-01-14 17:36:21,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-14 17:36:21,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-14 17:36:21,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-01-14 17:36:21,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-14 17:36:21,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2019-01-14 17:36:21,404 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 26 [2019-01-14 17:36:21,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:36:21,404 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2019-01-14 17:36:21,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 17:36:21,404 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2019-01-14 17:36:21,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 17:36:21,405 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:36:21,406 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-14 17:36:21,406 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:36:21,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:36:21,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1280139623, now seen corresponding path program 1 times [2019-01-14 17:36:21,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:36:21,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:36:21,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:21,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:36:21,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:36:21,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 17:36:21,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 17:36:21,560 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 17:36:21,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:36:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:36:21,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:36:21,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 17:36:21,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 17:36:21,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-01-14 17:36:21,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 17:36:21,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 17:36:21,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-01-14 17:36:21,768 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 9 states. [2019-01-14 17:36:21,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:36:21,876 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-01-14 17:36:21,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 17:36:21,876 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2019-01-14 17:36:21,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:36:21,877 INFO L225 Difference]: With dead ends: 67 [2019-01-14 17:36:21,877 INFO L226 Difference]: Without dead ends: 65 [2019-01-14 17:36:21,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-01-14 17:36:21,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-14 17:36:21,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2019-01-14 17:36:21,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-14 17:36:21,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-01-14 17:36:21,885 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 27 [2019-01-14 17:36:21,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:36:21,885 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-01-14 17:36:21,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 17:36:21,885 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-01-14 17:36:21,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 17:36:21,887 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:36:21,887 INFO L402 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] [2019-01-14 17:36:21,887 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:36:21,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:36:21,888 INFO L82 PathProgramCache]: Analyzing trace with hash -642711428, now seen corresponding path program 1 times [2019-01-14 17:36:21,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:36:21,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:36:21,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:21,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:36:21,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:36:22,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:36:22,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:36:22,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 17:36:22,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 17:36:22,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 17:36:22,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 17:36:22,110 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 6 states. [2019-01-14 17:36:22,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:36:22,312 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-01-14 17:36:22,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 17:36:22,313 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-01-14 17:36:22,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:36:22,314 INFO L225 Difference]: With dead ends: 60 [2019-01-14 17:36:22,314 INFO L226 Difference]: Without dead ends: 58 [2019-01-14 17:36:22,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-01-14 17:36:22,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-14 17:36:22,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-01-14 17:36:22,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-14 17:36:22,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-01-14 17:36:22,320 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 27 [2019-01-14 17:36:22,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:36:22,321 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-01-14 17:36:22,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 17:36:22,321 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-01-14 17:36:22,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 17:36:22,324 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:36:22,324 INFO L402 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] [2019-01-14 17:36:22,324 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:36:22,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:36:22,326 INFO L82 PathProgramCache]: Analyzing trace with hash -47880409, now seen corresponding path program 1 times [2019-01-14 17:36:22,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:36:22,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:36:22,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:22,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:36:22,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:22,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:36:22,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:36:22,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:36:22,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 17:36:22,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 17:36:22,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 17:36:22,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-14 17:36:22,489 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 7 states. [2019-01-14 17:36:22,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:36:22,819 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2019-01-14 17:36:22,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 17:36:22,820 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-01-14 17:36:22,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:36:22,820 INFO L225 Difference]: With dead ends: 59 [2019-01-14 17:36:22,820 INFO L226 Difference]: Without dead ends: 57 [2019-01-14 17:36:22,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-14 17:36:22,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-14 17:36:22,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-01-14 17:36:22,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-14 17:36:22,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-01-14 17:36:22,825 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 30 [2019-01-14 17:36:22,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:36:22,825 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-01-14 17:36:22,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 17:36:22,825 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-01-14 17:36:22,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-14 17:36:22,826 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:36:22,826 INFO L402 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] [2019-01-14 17:36:22,827 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:36:22,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:36:22,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1484288504, now seen corresponding path program 1 times [2019-01-14 17:36:22,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:36:22,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:36:22,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:22,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:36:22,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:36:23,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:36:23,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:36:23,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 17:36:23,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 17:36:23,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 17:36:23,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-14 17:36:23,133 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 7 states. [2019-01-14 17:36:23,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:36:23,251 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-01-14 17:36:23,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 17:36:23,253 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-01-14 17:36:23,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:36:23,254 INFO L225 Difference]: With dead ends: 67 [2019-01-14 17:36:23,254 INFO L226 Difference]: Without dead ends: 65 [2019-01-14 17:36:23,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-01-14 17:36:23,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-14 17:36:23,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2019-01-14 17:36:23,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-14 17:36:23,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2019-01-14 17:36:23,259 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 31 [2019-01-14 17:36:23,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:36:23,259 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2019-01-14 17:36:23,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 17:36:23,259 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2019-01-14 17:36:23,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-14 17:36:23,260 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:36:23,260 INFO L402 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] [2019-01-14 17:36:23,261 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:36:23,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:36:23,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1746453711, now seen corresponding path program 1 times [2019-01-14 17:36:23,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:36:23,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:36:23,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:23,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:36:23,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:36:23,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:36:23,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:36:23,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 17:36:23,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 17:36:23,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 17:36:23,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 17:36:23,388 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 6 states. [2019-01-14 17:36:23,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:36:23,640 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2019-01-14 17:36:23,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 17:36:23,641 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-01-14 17:36:23,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:36:23,643 INFO L225 Difference]: With dead ends: 87 [2019-01-14 17:36:23,643 INFO L226 Difference]: Without dead ends: 85 [2019-01-14 17:36:23,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-01-14 17:36:23,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-14 17:36:23,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 57. [2019-01-14 17:36:23,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-14 17:36:23,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2019-01-14 17:36:23,649 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 34 [2019-01-14 17:36:23,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:36:23,649 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2019-01-14 17:36:23,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 17:36:23,649 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2019-01-14 17:36:23,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-14 17:36:23,651 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:36:23,651 INFO L402 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] [2019-01-14 17:36:23,653 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:36:23,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:36:23,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1694514003, now seen corresponding path program 1 times [2019-01-14 17:36:23,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:36:23,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:36:23,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:23,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:36:23,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:36:23,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:36:23,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:36:23,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 17:36:23,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 17:36:23,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 17:36:23,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 17:36:23,766 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 6 states. [2019-01-14 17:36:23,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:36:23,945 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2019-01-14 17:36:23,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 17:36:23,946 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-01-14 17:36:23,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:36:23,946 INFO L225 Difference]: With dead ends: 57 [2019-01-14 17:36:23,946 INFO L226 Difference]: Without dead ends: 55 [2019-01-14 17:36:23,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-01-14 17:36:23,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-14 17:36:23,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-01-14 17:36:23,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-14 17:36:23,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2019-01-14 17:36:23,952 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 35 [2019-01-14 17:36:23,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:36:23,952 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2019-01-14 17:36:23,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 17:36:23,952 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2019-01-14 17:36:23,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-14 17:36:23,953 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:36:23,957 INFO L402 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] [2019-01-14 17:36:23,957 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:36:23,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:36:23,958 INFO L82 PathProgramCache]: Analyzing trace with hash 635482230, now seen corresponding path program 1 times [2019-01-14 17:36:23,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:36:23,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:36:23,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:23,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:36:23,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:36:24,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:36:24,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:36:24,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 17:36:24,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 17:36:24,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 17:36:24,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:36:24,150 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 5 states. [2019-01-14 17:36:24,436 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-14 17:36:24,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:36:24,479 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2019-01-14 17:36:24,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 17:36:24,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-01-14 17:36:24,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:36:24,481 INFO L225 Difference]: With dead ends: 66 [2019-01-14 17:36:24,481 INFO L226 Difference]: Without dead ends: 64 [2019-01-14 17:36:24,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-14 17:36:24,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-14 17:36:24,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2019-01-14 17:36:24,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-14 17:36:24,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2019-01-14 17:36:24,489 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 37 [2019-01-14 17:36:24,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:36:24,489 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2019-01-14 17:36:24,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 17:36:24,489 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2019-01-14 17:36:24,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-14 17:36:24,490 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:36:24,490 INFO L402 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] [2019-01-14 17:36:24,491 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:36:24,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:36:24,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1774883137, now seen corresponding path program 1 times [2019-01-14 17:36:24,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:36:24,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:36:24,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:24,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:36:24,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:24,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:36:24,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:36:24,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:36:24,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 17:36:24,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 17:36:24,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 17:36:24,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 17:36:24,615 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 6 states. [2019-01-14 17:36:24,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:36:24,726 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2019-01-14 17:36:24,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 17:36:24,727 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-01-14 17:36:24,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:36:24,728 INFO L225 Difference]: With dead ends: 62 [2019-01-14 17:36:24,728 INFO L226 Difference]: Without dead ends: 60 [2019-01-14 17:36:24,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-14 17:36:24,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-14 17:36:24,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2019-01-14 17:36:24,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-14 17:36:24,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2019-01-14 17:36:24,733 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 38 [2019-01-14 17:36:24,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:36:24,733 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2019-01-14 17:36:24,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 17:36:24,733 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2019-01-14 17:36:24,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-14 17:36:24,733 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:36:24,734 INFO L402 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] [2019-01-14 17:36:24,734 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:36:24,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:36:24,734 INFO L82 PathProgramCache]: Analyzing trace with hash 813201821, now seen corresponding path program 1 times [2019-01-14 17:36:24,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:36:24,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:36:24,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:24,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:36:24,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:36:24,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:36:24,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:36:24,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 17:36:24,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 17:36:24,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 17:36:24,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 17:36:24,857 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 6 states. [2019-01-14 17:36:24,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:36:24,983 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2019-01-14 17:36:24,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 17:36:24,984 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-01-14 17:36:24,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:36:24,986 INFO L225 Difference]: With dead ends: 84 [2019-01-14 17:36:24,986 INFO L226 Difference]: Without dead ends: 82 [2019-01-14 17:36:24,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-01-14 17:36:24,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-14 17:36:24,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 56. [2019-01-14 17:36:24,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-14 17:36:24,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2019-01-14 17:36:24,991 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 39 [2019-01-14 17:36:24,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:36:24,992 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2019-01-14 17:36:24,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 17:36:24,992 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2019-01-14 17:36:24,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-14 17:36:24,992 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:36:24,992 INFO L402 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] [2019-01-14 17:36:24,993 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:36:24,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:36:24,993 INFO L82 PathProgramCache]: Analyzing trace with hash -560543098, now seen corresponding path program 1 times [2019-01-14 17:36:24,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:36:24,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:36:24,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:24,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:36:24,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:36:25,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:36:25,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:36:25,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 17:36:25,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 17:36:25,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 17:36:25,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 17:36:25,425 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 6 states. [2019-01-14 17:36:25,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:36:25,742 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-01-14 17:36:25,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 17:36:25,743 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-01-14 17:36:25,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:36:25,744 INFO L225 Difference]: With dead ends: 69 [2019-01-14 17:36:25,745 INFO L226 Difference]: Without dead ends: 67 [2019-01-14 17:36:25,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-01-14 17:36:25,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-14 17:36:25,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 54. [2019-01-14 17:36:25,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-14 17:36:25,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2019-01-14 17:36:25,752 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 40 [2019-01-14 17:36:25,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:36:25,752 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2019-01-14 17:36:25,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 17:36:25,753 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2019-01-14 17:36:25,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-14 17:36:25,753 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:36:25,753 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-14 17:36:25,758 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:36:25,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:36:25,758 INFO L82 PathProgramCache]: Analyzing trace with hash 375780089, now seen corresponding path program 1 times [2019-01-14 17:36:25,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:36:25,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:36:25,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:25,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:36:25,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:36:26,089 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2019-01-14 17:36:26,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 17:36:26,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 17:36:26,488 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 17:36:26,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:36:26,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:36:26,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 17:36:26,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 17:36:26,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 17:36:26,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-01-14 17:36:26,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 17:36:26,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 17:36:26,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-01-14 17:36:26,602 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 9 states. [2019-01-14 17:36:26,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:36:26,733 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2019-01-14 17:36:26,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 17:36:26,734 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2019-01-14 17:36:26,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:36:26,735 INFO L225 Difference]: With dead ends: 54 [2019-01-14 17:36:26,735 INFO L226 Difference]: Without dead ends: 52 [2019-01-14 17:36:26,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-01-14 17:36:26,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-14 17:36:26,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-01-14 17:36:26,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-14 17:36:26,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2019-01-14 17:36:26,744 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 40 [2019-01-14 17:36:26,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:36:26,744 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2019-01-14 17:36:26,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 17:36:26,746 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2019-01-14 17:36:26,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-14 17:36:26,747 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 17:36:26,747 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 17:36:26,749 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 17:36:26,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 17:36:26,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1394778411, now seen corresponding path program 1 times [2019-01-14 17:36:26,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 17:36:26,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 17:36:26,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:26,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 17:36:26,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 17:36:26,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 17:36:26,948 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-14 17:36:26,982 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 17:36:26,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 17:36:26,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 17:36:26,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 17:36:26,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 17:36:26,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 17:36:26,983 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 5 states. [2019-01-14 17:36:27,388 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-14 17:36:27,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 17:36:27,392 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2019-01-14 17:36:27,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 17:36:27,393 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-01-14 17:36:27,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 17:36:27,393 INFO L225 Difference]: With dead ends: 71 [2019-01-14 17:36:27,393 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 17:36:27,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-14 17:36:27,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 17:36:27,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 17:36:27,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 17:36:27,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 17:36:27,395 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2019-01-14 17:36:27,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 17:36:27,395 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 17:36:27,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 17:36:27,395 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 17:36:27,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 17:36:27,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 17:36:27,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 17:36:27,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 17:36:27,688 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 112 [2019-01-14 17:36:28,316 WARN L181 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 30 [2019-01-14 17:36:28,752 WARN L181 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 66 [2019-01-14 17:36:28,995 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 27 [2019-01-14 17:36:29,509 WARN L181 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 72 [2019-01-14 17:36:29,514 INFO L448 ceAbstractionStarter]: For program point L250(line 250) no Hoare annotation was computed. [2019-01-14 17:36:29,514 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-01-14 17:36:29,514 INFO L448 ceAbstractionStarter]: For program point L118(lines 118 398) no Hoare annotation was computed. [2019-01-14 17:36:29,515 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 92) no Hoare annotation was computed. [2019-01-14 17:36:29,516 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 267) no Hoare annotation was computed. [2019-01-14 17:36:29,516 INFO L448 ceAbstractionStarter]: For program point L267(line 267) no Hoare annotation was computed. [2019-01-14 17:36:29,516 INFO L448 ceAbstractionStarter]: For program point L36(lines 36 430) no Hoare annotation was computed. [2019-01-14 17:36:29,516 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 303) no Hoare annotation was computed. [2019-01-14 17:36:29,516 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 17:36:29,516 INFO L448 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-01-14 17:36:29,516 INFO L448 ceAbstractionStarter]: For program point L367(lines 367 390) no Hoare annotation was computed. [2019-01-14 17:36:29,517 INFO L448 ceAbstractionStarter]: For program point L301(lines 301 311) no Hoare annotation was computed. [2019-01-14 17:36:29,517 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-01-14 17:36:29,517 INFO L448 ceAbstractionStarter]: For program point L219(lines 219 339) no Hoare annotation was computed. [2019-01-14 17:36:29,517 INFO L448 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-01-14 17:36:29,517 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 427) no Hoare annotation was computed. [2019-01-14 17:36:29,517 INFO L448 ceAbstractionStarter]: For program point L236(lines 236 326) no Hoare annotation was computed. [2019-01-14 17:36:29,517 INFO L448 ceAbstractionStarter]: For program point L170(lines 170 352) no Hoare annotation was computed. [2019-01-14 17:36:29,517 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2019-01-14 17:36:29,517 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 291) no Hoare annotation was computed. [2019-01-14 17:36:29,518 INFO L448 ceAbstractionStarter]: For program point L369(line 369) no Hoare annotation was computed. [2019-01-14 17:36:29,519 INFO L448 ceAbstractionStarter]: For program point L303(line 303) no Hoare annotation was computed. [2019-01-14 17:36:29,519 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 357) no Hoare annotation was computed. [2019-01-14 17:36:29,519 INFO L448 ceAbstractionStarter]: For program point L221(line 221) no Hoare annotation was computed. [2019-01-14 17:36:29,519 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 422) no Hoare annotation was computed. [2019-01-14 17:36:29,519 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 369) no Hoare annotation was computed. [2019-01-14 17:36:29,519 INFO L448 ceAbstractionStarter]: For program point L238(line 238) no Hoare annotation was computed. [2019-01-14 17:36:29,519 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-01-14 17:36:29,519 INFO L448 ceAbstractionStarter]: For program point L106(lines 106 400) no Hoare annotation was computed. [2019-01-14 17:36:29,523 INFO L444 ceAbstractionStarter]: At program point L387(lines 124 398) the Hoare annotation is: (and (let ((.cse0 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0))) (.cse1 (< 0 ULTIMATE.start_main_~main__scheme~0)) (.cse2 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~3))) (or (and (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~2) .cse0 .cse1 .cse2) (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~17 0)) .cse0 .cse1 .cse2 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~16) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 0))))) (<= 1 ULTIMATE.start_main_~main__cp~0) (<= (+ ULTIMATE.start_main_~main__cp~0 1) ULTIMATE.start_main_~main__urilen~0) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) [2019-01-14 17:36:29,523 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 349) no Hoare annotation was computed. [2019-01-14 17:36:29,523 INFO L448 ceAbstractionStarter]: For program point L90(lines 90 407) no Hoare annotation was computed. [2019-01-14 17:36:29,523 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 432) no Hoare annotation was computed. [2019-01-14 17:36:29,523 INFO L448 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-01-14 17:36:29,524 INFO L444 ceAbstractionStarter]: At program point L322(lines 257 323) the Hoare annotation is: (and (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~10) (let ((.cse0 (let ((.cse1 (and (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~4) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~8 0)) (<= 2 ULTIMATE.start_main_~main__cp~0) (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~5 0)) (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0)) (< 0 ULTIMATE.start_main_~main__scheme~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 0))) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~3)) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~10 0)) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~7 0)) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~6 0)) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0) (< (+ ULTIMATE.start_main_~main__cp~0 1) ULTIMATE.start_main_~main__urilen~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~9 0)))) (.cse2 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~11 0)))) (or (and .cse1 (<= (+ ULTIMATE.start_main_~main__c~0 2) ULTIMATE.start_main_~main__tokenlen~0) .cse2) (and .cse1 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~12 0)) .cse2))))) (or (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~13 0)) .cse0 (<= 1 ULTIMATE.start_main_~main__c~0)) (and .cse0 (= ULTIMATE.start_main_~main__c~0 0))))) [2019-01-14 17:36:29,524 INFO L448 ceAbstractionStarter]: For program point L289(lines 289 313) no Hoare annotation was computed. [2019-01-14 17:36:29,524 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 17:36:29,524 INFO L448 ceAbstractionStarter]: For program point L157(lines 157 354) no Hoare annotation was computed. [2019-01-14 17:36:29,524 INFO L448 ceAbstractionStarter]: For program point L58(lines 58 417) no Hoare annotation was computed. [2019-01-14 17:36:29,524 INFO L444 ceAbstractionStarter]: At program point L405(lines 99 406) the Hoare annotation is: (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 1) [2019-01-14 17:36:29,524 INFO L448 ceAbstractionStarter]: For program point L207(lines 207 341) no Hoare annotation was computed. [2019-01-14 17:36:29,524 INFO L448 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-01-14 17:36:29,524 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 429) no Hoare annotation was computed. [2019-01-14 17:36:29,525 INFO L448 ceAbstractionStarter]: For program point L257(lines 257 323) no Hoare annotation was computed. [2019-01-14 17:36:29,525 INFO L448 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2019-01-14 17:36:29,525 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 209) no Hoare annotation was computed. [2019-01-14 17:36:29,525 INFO L448 ceAbstractionStarter]: For program point L291(line 291) no Hoare annotation was computed. [2019-01-14 17:36:29,525 INFO L448 ceAbstractionStarter]: For program point L60(lines 60 412) no Hoare annotation was computed. [2019-01-14 17:36:29,525 INFO L448 ceAbstractionStarter]: For program point L209(line 209) no Hoare annotation was computed. [2019-01-14 17:36:29,525 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 17:36:29,525 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 120) no Hoare annotation was computed. [2019-01-14 17:36:29,525 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 238) no Hoare annotation was computed. [2019-01-14 17:36:29,525 INFO L448 ceAbstractionStarter]: For program point L78(lines 78 409) no Hoare annotation was computed. [2019-01-14 17:36:29,529 INFO L444 ceAbstractionStarter]: At program point L310(lines 225 339) the Hoare annotation is: (let ((.cse7 (+ ULTIMATE.start_main_~main__cp~0 1))) (let ((.cse2 (<= 2 ULTIMATE.start_main_~main__cp~0)) (.cse5 (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~8 0)) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~7 0)) (and (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~4) (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~6 0)) (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~5 0)) (and (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 1) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0)) (<= 1 ULTIMATE.start_main_~main__cp~0) (< 0 ULTIMATE.start_main_~main__scheme~0) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 0))) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~3) (<= .cse7 ULTIMATE.start_main_~main__urilen~0)))))) (.cse1 (= ULTIMATE.start_main_~main__c~0 0)) (.cse6 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~9 0)))) (or (and (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~10) (let ((.cse0 (let ((.cse3 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~11 0))) (.cse4 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~10 0)))) (or (and (<= (+ ULTIMATE.start_main_~main__c~0 2) ULTIMATE.start_main_~main__tokenlen~0) .cse2 .cse3 .cse4 .cse5 .cse6) (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~12 0)) .cse2 .cse3 .cse4 .cse5 .cse6))))) (or (and .cse0 .cse1) (and (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~13 0)) .cse0 (<= 1 ULTIMATE.start_main_~main__c~0))))) (and .cse2 .cse5 .cse1 (< .cse7 ULTIMATE.start_main_~main__urilen~0) .cse6)))) [2019-01-14 17:36:29,529 INFO L448 ceAbstractionStarter]: For program point L277(lines 277 315) no Hoare annotation was computed. [2019-01-14 17:36:29,529 INFO L451 ceAbstractionStarter]: At program point L426(lines 8 434) the Hoare annotation is: true [2019-01-14 17:36:29,529 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 431) no Hoare annotation was computed. [2019-01-14 17:36:29,529 INFO L448 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-01-14 17:36:29,531 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 333) no Hoare annotation was computed. [2019-01-14 17:36:29,531 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 392) no Hoare annotation was computed. [2019-01-14 17:36:29,531 INFO L448 ceAbstractionStarter]: For program point L279(line 279) no Hoare annotation was computed. [2019-01-14 17:36:29,531 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 381) no Hoare annotation was computed. [2019-01-14 17:36:29,531 INFO L448 ceAbstractionStarter]: For program point L48(lines 48 428) no Hoare annotation was computed. [2019-01-14 17:36:29,531 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-14 17:36:29,531 INFO L448 ceAbstractionStarter]: For program point L379(lines 379 388) no Hoare annotation was computed. [2019-01-14 17:36:29,531 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 279) no Hoare annotation was computed. [2019-01-14 17:36:29,533 INFO L444 ceAbstractionStarter]: At program point L396(lines 126 397) the Hoare annotation is: (and (< ULTIMATE.start_main_~main__cp~0 ULTIMATE.start_main_~main__urilen~0) (let ((.cse0 (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 1)) (.cse1 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~1 0))) (.cse2 (<= 1 ULTIMATE.start_main_~main__cp~0)) (.cse3 (< 0 ULTIMATE.start_main_~main__scheme~0))) (or (and (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~2) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~16 0)) (not (= ULTIMATE.start_main_~__VERIFIER_assert__cond~2 0))))) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~3)) [2019-01-14 17:36:29,533 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-01-14 17:36:29,533 INFO L448 ceAbstractionStarter]: For program point L99(lines 99 406) no Hoare annotation was computed. [2019-01-14 17:36:29,533 INFO L448 ceAbstractionStarter]: For program point L66(lines 66 411) no Hoare annotation was computed. [2019-01-14 17:36:29,533 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 324) no Hoare annotation was computed. [2019-01-14 17:36:29,533 INFO L448 ceAbstractionStarter]: For program point L182(lines 182 350) no Hoare annotation was computed. [2019-01-14 17:36:29,533 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2019-01-14 17:36:29,533 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 250) no Hoare annotation was computed. [2019-01-14 17:36:29,533 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 317) no Hoare annotation was computed. [2019-01-14 17:36:29,534 INFO L448 ceAbstractionStarter]: For program point L199(lines 199 348) no Hoare annotation was computed. [2019-01-14 17:36:29,534 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 108) no Hoare annotation was computed. [2019-01-14 17:36:29,534 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 221) no Hoare annotation was computed. [2019-01-14 17:36:29,534 INFO L448 ceAbstractionStarter]: For program point L381(line 381) no Hoare annotation was computed. [2019-01-14 17:36:29,534 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 355) no Hoare annotation was computed. [2019-01-14 17:36:29,534 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 433) no Hoare annotation was computed. [2019-01-14 17:36:29,534 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2019-01-14 17:36:29,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 05:36:29 BoogieIcfgContainer [2019-01-14 17:36:29,583 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 17:36:29,587 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 17:36:29,587 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 17:36:29,587 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 17:36:29,588 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 05:36:16" (3/4) ... [2019-01-14 17:36:29,595 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 17:36:29,612 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-14 17:36:29,613 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 17:36:29,708 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 17:36:29,709 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 17:36:29,710 INFO L168 Benchmark]: Toolchain (without parser) took 14420.59 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 272.1 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -101.5 MB). Peak memory consumption was 170.6 MB. Max. memory is 11.5 GB. [2019-01-14 17:36:29,711 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 17:36:29,712 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.95 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 935.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-14 17:36:29,712 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.66 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 17:36:29,712 INFO L168 Benchmark]: Boogie Preprocessor took 87.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -204.4 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2019-01-14 17:36:29,713 INFO L168 Benchmark]: RCFGBuilder took 763.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. [2019-01-14 17:36:29,713 INFO L168 Benchmark]: TraceAbstraction took 13046.09 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 121.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.4 MB). Peak memory consumption was 350.8 MB. Max. memory is 11.5 GB. [2019-01-14 17:36:29,713 INFO L168 Benchmark]: Witness Printer took 122.06 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. [2019-01-14 17:36:29,718 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 326.95 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 935.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.66 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 87.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -204.4 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 763.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13046.09 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 121.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.4 MB). Peak memory consumption was 350.8 MB. Max. memory is 11.5 GB. * Witness Printer took 122.06 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 184]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 209]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 291]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 381]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 238]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 369]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 267]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 92]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 279]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 108]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 140]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 120]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 152]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 221]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 303]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 250]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: ((((((1 == __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 == __VERIFIER_assert__cond) || (((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0))) && 1 <= main__cp) && main__cp + 1 <= main__urilen) && 1 == __VERIFIER_assert__cond - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: 1 == __VERIFIER_assert__cond && (((!(__VERIFIER_assert__cond == 0) && ((((((((((((1 == __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0)) && 2 <= main__cp) && (!(__VERIFIER_assert__cond == 0) && (!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && main__c + 2 <= main__tokenlen) && !(__VERIFIER_assert__cond == 0)) || (((((((((((1 == __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0)) && 2 <= main__cp) && (!(__VERIFIER_assert__cond == 0) && (!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) && 1 <= main__c) || (((((((((((((1 == __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0)) && 2 <= main__cp) && (!(__VERIFIER_assert__cond == 0) && (!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && main__c + 2 <= main__tokenlen) && !(__VERIFIER_assert__cond == 0)) || (((((((((((1 == __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0)) && 2 <= main__cp) && (!(__VERIFIER_assert__cond == 0) && (!(__VERIFIER_assert__cond == 0) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))) && main__c == 0)) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: (main__cp < main__urilen && (((((1 == __VERIFIER_assert__cond && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 0 < main__scheme) || (((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)))) && 1 == __VERIFIER_assert__cond - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: (1 == __VERIFIER_assert__cond && ((((((((main__c + 2 <= main__tokenlen && 2 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0) && ((!(__VERIFIER_assert__cond == 0) && (((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 <= main__urilen) && !(__VERIFIER_assert__cond == 0)) || (((((!(__VERIFIER_assert__cond == 0) && 2 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0) && ((!(__VERIFIER_assert__cond == 0) && (((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 <= main__urilen) && !(__VERIFIER_assert__cond == 0))) && main__c == 0) || ((!(__VERIFIER_assert__cond == 0) && ((((((main__c + 2 <= main__tokenlen && 2 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0) && ((!(__VERIFIER_assert__cond == 0) && (((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 <= main__urilen) && !(__VERIFIER_assert__cond == 0)) || (((((!(__VERIFIER_assert__cond == 0) && 2 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0) && ((!(__VERIFIER_assert__cond == 0) && (((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 <= main__urilen) && !(__VERIFIER_assert__cond == 0)))) && 1 <= main__c))) || ((((2 <= main__cp && (!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond && !(__VERIFIER_assert__cond == 0) && ((!(__VERIFIER_assert__cond == 0) && (((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 == __VERIFIER_assert__cond) && main__cp + 1 <= main__urilen) && main__c == 0) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: __VERIFIER_assert__cond == 1 - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 82 locations, 18 error locations. SAFE Result, 12.9s OverallTime, 23 OverallIterations, 2 TraceHistogramMax, 5.4s AutomataDifference, 0.0s DeadEndRemovalTime, 2.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 1246 SDtfs, 2836 SDslu, 1555 SDs, 0 SdLazy, 1119 SolverSat, 159 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 310 GetRequests, 151 SyntacticMatches, 4 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=0, 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.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 315 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 16 NumberOfFragments, 742 HoareAnnotationTreeSize, 6 FomulaSimplifications, 239048 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 6 FomulaSimplificationsInter, 147118 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 751 NumberOfCodeBlocks, 751 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 725 ConstructedInterpolants, 0 QuantifiedInterpolants, 48258 SizeOfPredicates, 21 NumberOfNonLiveVariables, 311 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 26 InterpolantComputations, 20 PerfectInterpolantSequences, 10/21 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...