./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-12 11:22:04,316 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 11:22:04,318 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 11:22:04,332 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 11:22:04,333 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 11:22:04,335 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 11:22:04,338 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 11:22:04,341 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 11:22:04,344 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 11:22:04,346 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 11:22:04,349 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 11:22:04,350 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 11:22:04,351 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 11:22:04,352 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 11:22:04,355 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 11:22:04,361 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 11:22:04,362 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 11:22:04,364 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 11:22:04,369 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 11:22:04,370 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 11:22:04,371 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 11:22:04,375 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 11:22:04,377 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 11:22:04,378 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 11:22:04,378 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 11:22:04,378 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 11:22:04,379 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 11:22:04,380 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 11:22:04,381 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 11:22:04,381 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 11:22:04,382 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 11:22:04,382 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 11:22:04,382 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 11:22:04,383 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 11:22:04,384 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 11:22:04,384 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 11:22:04,384 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 11:22:04,399 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 11:22:04,399 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 11:22:04,400 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 11:22:04,400 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 11:22:04,400 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 11:22:04,401 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 11:22:04,401 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 11:22:04,401 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 11:22:04,401 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 11:22:04,401 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 11:22:04,401 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 11:22:04,402 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 11:22:04,402 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 11:22:04,402 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 11:22:04,402 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 11:22:04,402 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 11:22:04,403 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 11:22:04,403 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 11:22:04,403 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 11:22:04,403 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 11:22:04,403 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 11:22:04,403 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 11:22:04,404 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 11:22:04,404 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 11:22:04,404 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 11:22:04,404 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 11:22:04,404 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 11:22:04,404 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 11:22:04,405 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-12 11:22:04,449 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 11:22:04,470 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 11:22:04,474 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 11:22:04,476 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 11:22:04,476 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 11:22:04,477 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-12 11:22:04,529 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ecfcdf02/b9a87709df9848a4b3e43c8247db3203/FLAG937c1854d [2019-01-12 11:22:04,951 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 11:22:04,952 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-invgen/apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c [2019-01-12 11:22:04,960 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ecfcdf02/b9a87709df9848a4b3e43c8247db3203/FLAG937c1854d [2019-01-12 11:22:05,329 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ecfcdf02/b9a87709df9848a4b3e43c8247db3203 [2019-01-12 11:22:05,333 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 11:22:05,334 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 11:22:05,336 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 11:22:05,336 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 11:22:05,341 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 11:22:05,342 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:22:05" (1/1) ... [2019-01-12 11:22:05,344 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@263f7525 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:22:05, skipping insertion in model container [2019-01-12 11:22:05,346 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:22:05" (1/1) ... [2019-01-12 11:22:05,354 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 11:22:05,400 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 11:22:05,692 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 11:22:05,702 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 11:22:05,770 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 11:22:05,788 INFO L195 MainTranslator]: Completed translation [2019-01-12 11:22:05,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:22:05 WrapperNode [2019-01-12 11:22:05,789 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 11:22:05,790 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 11:22:05,790 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 11:22:05,790 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 11:22:05,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:22:05" (1/1) ... [2019-01-12 11:22:05,810 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:22:05" (1/1) ... [2019-01-12 11:22:05,859 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 11:22:05,859 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 11:22:05,859 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 11:22:05,859 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 11:22:05,936 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:22:05" (1/1) ... [2019-01-12 11:22:05,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:22:05" (1/1) ... [2019-01-12 11:22:05,939 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:22:05" (1/1) ... [2019-01-12 11:22:05,947 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:22:05" (1/1) ... [2019-01-12 11:22:05,957 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:22:05" (1/1) ... [2019-01-12 11:22:05,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:22:05" (1/1) ... [2019-01-12 11:22:05,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:22:05" (1/1) ... [2019-01-12 11:22:05,974 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 11:22:05,976 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 11:22:05,976 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 11:22:05,976 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 11:22:05,980 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:22:05" (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-12 11:22:06,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 11:22:06,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 11:22:06,793 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 11:22:06,793 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 11:22:06,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:22:06 BoogieIcfgContainer [2019-01-12 11:22:06,795 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 11:22:06,796 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 11:22:06,796 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 11:22:06,799 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 11:22:06,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 11:22:05" (1/3) ... [2019-01-12 11:22:06,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c75fa3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:22:06, skipping insertion in model container [2019-01-12 11:22:06,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:22:05" (2/3) ... [2019-01-12 11:22:06,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c75fa3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:22:06, skipping insertion in model container [2019-01-12 11:22:06,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:22:06" (3/3) ... [2019-01-12 11:22:06,803 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c [2019-01-12 11:22:06,813 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 11:22:06,821 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-01-12 11:22:06,838 INFO L257 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-01-12 11:22:06,870 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 11:22:06,871 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 11:22:06,871 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 11:22:06,871 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 11:22:06,872 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 11:22:06,872 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 11:22:06,872 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 11:22:06,872 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 11:22:06,872 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 11:22:06,895 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2019-01-12 11:22:06,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 11:22:06,906 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:06,907 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:22:06,910 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:06,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:06,920 INFO L82 PathProgramCache]: Analyzing trace with hash -2034435078, now seen corresponding path program 1 times [2019-01-12 11:22:06,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:06,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:06,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:06,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:06,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:07,101 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-12 11:22:07,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:07,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 11:22:07,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 11:22:07,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 11:22:07,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 11:22:07,120 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2019-01-12 11:22:07,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:07,171 INFO L93 Difference]: Finished difference Result 88 states and 123 transitions. [2019-01-12 11:22:07,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 11:22:07,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-01-12 11:22:07,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:07,184 INFO L225 Difference]: With dead ends: 88 [2019-01-12 11:22:07,184 INFO L226 Difference]: Without dead ends: 76 [2019-01-12 11:22:07,187 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-12 11:22:07,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-12 11:22:07,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-01-12 11:22:07,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-12 11:22:07,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2019-01-12 11:22:07,228 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 15 [2019-01-12 11:22:07,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:07,229 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2019-01-12 11:22:07,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 11:22:07,229 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2019-01-12 11:22:07,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 11:22:07,230 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:07,230 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:22:07,231 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:07,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:07,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1357026114, now seen corresponding path program 1 times [2019-01-12 11:22:07,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:07,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:07,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:07,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:07,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:07,428 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-12 11:22:07,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:07,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:22:07,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:22:07,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:22:07,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:22:07,432 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 6 states. [2019-01-12 11:22:07,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:07,607 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-01-12 11:22:07,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:22:07,608 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-01-12 11:22:07,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:07,609 INFO L225 Difference]: With dead ends: 76 [2019-01-12 11:22:07,610 INFO L226 Difference]: Without dead ends: 74 [2019-01-12 11:22:07,611 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-12 11:22:07,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-12 11:22:07,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-01-12 11:22:07,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-12 11:22:07,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2019-01-12 11:22:07,620 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 16 [2019-01-12 11:22:07,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:07,620 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2019-01-12 11:22:07,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:22:07,621 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2019-01-12 11:22:07,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 11:22:07,622 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:07,622 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-12 11:22:07,622 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:07,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:07,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1567835227, now seen corresponding path program 1 times [2019-01-12 11:22:07,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:07,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:07,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:07,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:07,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:07,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:07,842 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-12 11:22:07,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:07,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 11:22:07,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 11:22:07,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 11:22:07,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 11:22:07,844 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 5 states. [2019-01-12 11:22:08,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:08,158 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2019-01-12 11:22:08,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:22:08,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-01-12 11:22:08,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:08,160 INFO L225 Difference]: With dead ends: 112 [2019-01-12 11:22:08,160 INFO L226 Difference]: Without dead ends: 110 [2019-01-12 11:22:08,161 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-12 11:22:08,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-12 11:22:08,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 72. [2019-01-12 11:22:08,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-12 11:22:08,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2019-01-12 11:22:08,171 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 18 [2019-01-12 11:22:08,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:08,171 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2019-01-12 11:22:08,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 11:22:08,171 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2019-01-12 11:22:08,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 11:22:08,172 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:08,172 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-12 11:22:08,173 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:08,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:08,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1358247672, now seen corresponding path program 1 times [2019-01-12 11:22:08,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:08,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:08,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:08,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:08,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:08,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:08,399 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-12 11:22:08,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:08,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:22:08,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:22:08,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:22:08,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:22:08,401 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 6 states. [2019-01-12 11:22:08,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:08,756 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2019-01-12 11:22:08,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:22:08,757 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-01-12 11:22:08,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:08,758 INFO L225 Difference]: With dead ends: 72 [2019-01-12 11:22:08,759 INFO L226 Difference]: Without dead ends: 70 [2019-01-12 11:22:08,760 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-12 11:22:08,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-12 11:22:08,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-01-12 11:22:08,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-12 11:22:08,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2019-01-12 11:22:08,767 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 19 [2019-01-12 11:22:08,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:08,768 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2019-01-12 11:22:08,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:22:08,768 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2019-01-12 11:22:08,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 11:22:08,769 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:08,769 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-12 11:22:08,770 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:08,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:08,770 INFO L82 PathProgramCache]: Analyzing trace with hash -665385716, now seen corresponding path program 1 times [2019-01-12 11:22:08,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:08,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:08,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:08,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:08,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:08,853 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-12 11:22:08,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:08,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 11:22:08,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 11:22:08,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 11:22:08,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 11:22:08,856 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 5 states. [2019-01-12 11:22:09,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:09,363 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2019-01-12 11:22:09,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:22:09,364 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-01-12 11:22:09,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:09,366 INFO L225 Difference]: With dead ends: 137 [2019-01-12 11:22:09,367 INFO L226 Difference]: Without dead ends: 135 [2019-01-12 11:22:09,367 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-12 11:22:09,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-12 11:22:09,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 73. [2019-01-12 11:22:09,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-12 11:22:09,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2019-01-12 11:22:09,392 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 22 [2019-01-12 11:22:09,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:09,392 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2019-01-12 11:22:09,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 11:22:09,393 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2019-01-12 11:22:09,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 11:22:09,394 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:09,394 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-12 11:22:09,395 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:09,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:09,401 INFO L82 PathProgramCache]: Analyzing trace with hash -661217951, now seen corresponding path program 1 times [2019-01-12 11:22:09,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:09,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:09,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:09,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:09,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:09,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:09,517 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-12 11:22:09,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:09,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 11:22:09,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 11:22:09,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 11:22:09,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 11:22:09,520 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 5 states. [2019-01-12 11:22:09,817 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 7 [2019-01-12 11:22:09,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:09,983 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2019-01-12 11:22:09,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:22:09,987 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-01-12 11:22:09,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:09,988 INFO L225 Difference]: With dead ends: 104 [2019-01-12 11:22:09,989 INFO L226 Difference]: Without dead ends: 102 [2019-01-12 11:22:09,989 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-12 11:22:09,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-12 11:22:10,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 75. [2019-01-12 11:22:10,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-12 11:22:10,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2019-01-12 11:22:10,012 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 22 [2019-01-12 11:22:10,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:10,012 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2019-01-12 11:22:10,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 11:22:10,013 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2019-01-12 11:22:10,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 11:22:10,016 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:10,017 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-12 11:22:10,017 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:10,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:10,018 INFO L82 PathProgramCache]: Analyzing trace with hash 847883539, now seen corresponding path program 1 times [2019-01-12 11:22:10,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:10,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:10,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:10,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:10,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:10,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:10,128 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-12 11:22:10,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:10,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 11:22:10,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 11:22:10,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 11:22:10,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 11:22:10,130 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 5 states. [2019-01-12 11:22:10,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:10,280 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2019-01-12 11:22:10,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 11:22:10,281 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-01-12 11:22:10,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:10,282 INFO L225 Difference]: With dead ends: 117 [2019-01-12 11:22:10,282 INFO L226 Difference]: Without dead ends: 115 [2019-01-12 11:22:10,283 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-12 11:22:10,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-12 11:22:10,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 73. [2019-01-12 11:22:10,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-12 11:22:10,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2019-01-12 11:22:10,299 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 23 [2019-01-12 11:22:10,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:10,303 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2019-01-12 11:22:10,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 11:22:10,303 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2019-01-12 11:22:10,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 11:22:10,304 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:10,304 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-12 11:22:10,305 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:10,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:10,306 INFO L82 PathProgramCache]: Analyzing trace with hash 977084131, now seen corresponding path program 1 times [2019-01-12 11:22:10,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:10,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:10,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:10,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:10,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:10,383 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-12 11:22:10,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:10,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 11:22:10,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 11:22:10,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 11:22:10,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 11:22:10,385 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 5 states. [2019-01-12 11:22:10,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:10,507 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2019-01-12 11:22:10,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 11:22:10,508 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-01-12 11:22:10,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:10,509 INFO L225 Difference]: With dead ends: 73 [2019-01-12 11:22:10,509 INFO L226 Difference]: Without dead ends: 71 [2019-01-12 11:22:10,510 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-12 11:22:10,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-12 11:22:10,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-12 11:22:10,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-12 11:22:10,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2019-01-12 11:22:10,517 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 23 [2019-01-12 11:22:10,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:10,517 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2019-01-12 11:22:10,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 11:22:10,517 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2019-01-12 11:22:10,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-12 11:22:10,518 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:10,518 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-12 11:22:10,519 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:10,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:10,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1619855478, now seen corresponding path program 1 times [2019-01-12 11:22:10,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:10,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:10,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:10,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:10,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:10,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:10,591 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-12 11:22:10,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:10,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 11:22:10,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 11:22:10,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 11:22:10,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 11:22:10,593 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 3 states. [2019-01-12 11:22:10,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:10,752 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2019-01-12 11:22:10,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 11:22:10,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-01-12 11:22:10,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:10,753 INFO L225 Difference]: With dead ends: 111 [2019-01-12 11:22:10,754 INFO L226 Difference]: Without dead ends: 71 [2019-01-12 11:22:10,755 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-12 11:22:10,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-12 11:22:10,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-12 11:22:10,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-12 11:22:10,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2019-01-12 11:22:10,761 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 25 [2019-01-12 11:22:10,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:10,763 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2019-01-12 11:22:10,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 11:22:10,763 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2019-01-12 11:22:10,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-12 11:22:10,764 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:10,764 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-12 11:22:10,766 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:10,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:10,767 INFO L82 PathProgramCache]: Analyzing trace with hash 595608307, now seen corresponding path program 1 times [2019-01-12 11:22:10,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:10,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:10,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:10,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:10,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:10,891 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-12 11:22:10,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:22:10,892 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-12 11:22:10,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:10,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:22:11,039 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-12 11:22:11,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:22:11,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-01-12 11:22:11,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 11:22:11,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 11:22:11,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-01-12 11:22:11,074 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand 9 states. [2019-01-12 11:22:11,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:11,266 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2019-01-12 11:22:11,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:22:11,267 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-01-12 11:22:11,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:11,269 INFO L225 Difference]: With dead ends: 111 [2019-01-12 11:22:11,269 INFO L226 Difference]: Without dead ends: 109 [2019-01-12 11:22:11,270 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-12 11:22:11,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-12 11:22:11,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 68. [2019-01-12 11:22:11,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-12 11:22:11,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2019-01-12 11:22:11,277 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 26 [2019-01-12 11:22:11,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:11,278 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2019-01-12 11:22:11,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 11:22:11,278 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2019-01-12 11:22:11,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-12 11:22:11,280 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:11,281 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-12 11:22:11,281 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:11,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:11,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1780382557, now seen corresponding path program 1 times [2019-01-12 11:22:11,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:11,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:11,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:11,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:11,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:11,390 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-12 11:22:11,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:11,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 11:22:11,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 11:22:11,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 11:22:11,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 11:22:11,392 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 7 states. [2019-01-12 11:22:11,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:11,563 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2019-01-12 11:22:11,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:22:11,565 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-01-12 11:22:11,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:11,566 INFO L225 Difference]: With dead ends: 69 [2019-01-12 11:22:11,566 INFO L226 Difference]: Without dead ends: 67 [2019-01-12 11:22:11,567 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-12 11:22:11,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-12 11:22:11,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-01-12 11:22:11,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-12 11:22:11,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2019-01-12 11:22:11,573 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 26 [2019-01-12 11:22:11,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:11,573 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2019-01-12 11:22:11,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 11:22:11,573 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2019-01-12 11:22:11,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 11:22:11,574 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:11,574 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-12 11:22:11,575 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:11,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:11,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1280139623, now seen corresponding path program 1 times [2019-01-12 11:22:11,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:11,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:11,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:11,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:11,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:11,721 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-12 11:22:11,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:22:11,721 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-12 11:22:11,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:11,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:22:11,874 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-12 11:22:11,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:22:11,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-01-12 11:22:11,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 11:22:11,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 11:22:11,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-01-12 11:22:11,893 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 9 states. [2019-01-12 11:22:12,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:12,102 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-01-12 11:22:12,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:22:12,103 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2019-01-12 11:22:12,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:12,104 INFO L225 Difference]: With dead ends: 67 [2019-01-12 11:22:12,104 INFO L226 Difference]: Without dead ends: 65 [2019-01-12 11:22:12,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-01-12 11:22:12,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-12 11:22:12,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2019-01-12 11:22:12,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-12 11:22:12,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-01-12 11:22:12,110 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 27 [2019-01-12 11:22:12,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:12,110 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-01-12 11:22:12,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 11:22:12,111 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-01-12 11:22:12,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 11:22:12,111 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:12,111 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-12 11:22:12,115 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:12,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:12,116 INFO L82 PathProgramCache]: Analyzing trace with hash -642711428, now seen corresponding path program 1 times [2019-01-12 11:22:12,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:12,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:12,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:12,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:12,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:12,324 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-12 11:22:12,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:12,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:22:12,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:22:12,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:22:12,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:22:12,325 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 6 states. [2019-01-12 11:22:12,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:12,533 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-01-12 11:22:12,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:22:12,534 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-01-12 11:22:12,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:12,535 INFO L225 Difference]: With dead ends: 60 [2019-01-12 11:22:12,535 INFO L226 Difference]: Without dead ends: 58 [2019-01-12 11:22:12,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-01-12 11:22:12,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-12 11:22:12,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-01-12 11:22:12,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-12 11:22:12,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-01-12 11:22:12,540 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 27 [2019-01-12 11:22:12,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:12,541 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-01-12 11:22:12,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:22:12,541 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-01-12 11:22:12,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-12 11:22:12,542 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:12,544 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-12 11:22:12,544 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:12,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:12,546 INFO L82 PathProgramCache]: Analyzing trace with hash -47880409, now seen corresponding path program 1 times [2019-01-12 11:22:12,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:12,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:12,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:12,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:12,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:12,645 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-12 11:22:12,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:12,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 11:22:12,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 11:22:12,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 11:22:12,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 11:22:12,647 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 7 states. [2019-01-12 11:22:12,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:12,958 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2019-01-12 11:22:12,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:22:12,959 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-01-12 11:22:12,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:12,959 INFO L225 Difference]: With dead ends: 59 [2019-01-12 11:22:12,960 INFO L226 Difference]: Without dead ends: 57 [2019-01-12 11:22:12,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 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-12 11:22:12,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-12 11:22:12,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-01-12 11:22:12,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-12 11:22:12,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-01-12 11:22:12,964 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 30 [2019-01-12 11:22:12,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:12,964 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-01-12 11:22:12,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 11:22:12,965 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-01-12 11:22:12,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 11:22:12,966 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:12,966 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-12 11:22:12,968 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:12,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:12,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1484288504, now seen corresponding path program 1 times [2019-01-12 11:22:12,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:12,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:12,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:12,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:12,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:13,393 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-12 11:22:13,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:13,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 11:22:13,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 11:22:13,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 11:22:13,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 11:22:13,394 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 7 states. [2019-01-12 11:22:13,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:13,612 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-01-12 11:22:13,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:22:13,613 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-01-12 11:22:13,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:13,614 INFO L225 Difference]: With dead ends: 67 [2019-01-12 11:22:13,614 INFO L226 Difference]: Without dead ends: 65 [2019-01-12 11:22:13,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-01-12 11:22:13,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-12 11:22:13,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2019-01-12 11:22:13,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-12 11:22:13,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2019-01-12 11:22:13,624 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 31 [2019-01-12 11:22:13,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:13,624 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2019-01-12 11:22:13,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 11:22:13,625 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2019-01-12 11:22:13,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-12 11:22:13,630 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:13,630 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-12 11:22:13,631 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:13,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:13,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1746453711, now seen corresponding path program 1 times [2019-01-12 11:22:13,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:13,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:13,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:13,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:13,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:13,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:13,867 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-12 11:22:13,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:13,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:22:13,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:22:13,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:22:13,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:22:13,868 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 6 states. [2019-01-12 11:22:14,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:14,079 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2019-01-12 11:22:14,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:22:14,080 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-01-12 11:22:14,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:14,081 INFO L225 Difference]: With dead ends: 87 [2019-01-12 11:22:14,081 INFO L226 Difference]: Without dead ends: 85 [2019-01-12 11:22:14,081 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-12 11:22:14,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-12 11:22:14,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 57. [2019-01-12 11:22:14,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-12 11:22:14,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2019-01-12 11:22:14,086 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 34 [2019-01-12 11:22:14,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:14,087 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2019-01-12 11:22:14,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:22:14,087 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2019-01-12 11:22:14,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-12 11:22:14,088 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:14,088 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-12 11:22:14,088 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:14,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:14,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1694514003, now seen corresponding path program 1 times [2019-01-12 11:22:14,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:14,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:14,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:14,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:14,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:14,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:14,529 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-12 11:22:14,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:14,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:22:14,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:22:14,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:22:14,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:22:14,532 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 6 states. [2019-01-12 11:22:14,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:14,918 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2019-01-12 11:22:14,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:22:14,921 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-01-12 11:22:14,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:14,922 INFO L225 Difference]: With dead ends: 57 [2019-01-12 11:22:14,922 INFO L226 Difference]: Without dead ends: 55 [2019-01-12 11:22:14,922 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-12 11:22:14,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-12 11:22:14,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-01-12 11:22:14,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-12 11:22:14,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2019-01-12 11:22:14,930 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 35 [2019-01-12 11:22:14,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:14,930 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2019-01-12 11:22:14,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:22:14,930 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2019-01-12 11:22:14,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-12 11:22:14,933 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:14,933 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-12 11:22:14,933 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:14,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:14,935 INFO L82 PathProgramCache]: Analyzing trace with hash 635482230, now seen corresponding path program 1 times [2019-01-12 11:22:14,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:14,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:14,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:14,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:14,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:15,114 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-12 11:22:15,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:15,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 11:22:15,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 11:22:15,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 11:22:15,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 11:22:15,115 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 5 states. [2019-01-12 11:22:15,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:15,174 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2019-01-12 11:22:15,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:22:15,176 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-01-12 11:22:15,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:15,178 INFO L225 Difference]: With dead ends: 66 [2019-01-12 11:22:15,178 INFO L226 Difference]: Without dead ends: 64 [2019-01-12 11:22:15,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:22:15,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-12 11:22:15,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2019-01-12 11:22:15,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-12 11:22:15,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2019-01-12 11:22:15,186 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 37 [2019-01-12 11:22:15,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:15,186 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2019-01-12 11:22:15,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 11:22:15,186 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2019-01-12 11:22:15,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-12 11:22:15,187 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:15,187 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-12 11:22:15,190 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:15,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:15,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1774883137, now seen corresponding path program 1 times [2019-01-12 11:22:15,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:15,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:15,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:15,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:15,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:15,305 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-12 11:22:15,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:15,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:22:15,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:22:15,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:22:15,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:22:15,307 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 6 states. [2019-01-12 11:22:15,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:15,534 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2019-01-12 11:22:15,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:22:15,536 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-01-12 11:22:15,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:15,536 INFO L225 Difference]: With dead ends: 62 [2019-01-12 11:22:15,536 INFO L226 Difference]: Without dead ends: 60 [2019-01-12 11:22:15,537 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-12 11:22:15,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-12 11:22:15,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2019-01-12 11:22:15,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-12 11:22:15,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2019-01-12 11:22:15,544 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 38 [2019-01-12 11:22:15,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:15,544 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2019-01-12 11:22:15,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:22:15,544 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2019-01-12 11:22:15,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 11:22:15,545 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:15,545 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-12 11:22:15,546 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:15,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:15,546 INFO L82 PathProgramCache]: Analyzing trace with hash 813201821, now seen corresponding path program 1 times [2019-01-12 11:22:15,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:15,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:15,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:15,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:15,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:15,656 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-12 11:22:15,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:15,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:22:15,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:22:15,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:22:15,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:22:15,657 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 6 states. [2019-01-12 11:22:15,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:15,785 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2019-01-12 11:22:15,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:22:15,787 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-01-12 11:22:15,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:15,788 INFO L225 Difference]: With dead ends: 84 [2019-01-12 11:22:15,788 INFO L226 Difference]: Without dead ends: 82 [2019-01-12 11:22:15,789 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-12 11:22:15,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-12 11:22:15,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 56. [2019-01-12 11:22:15,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-12 11:22:15,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2019-01-12 11:22:15,794 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 39 [2019-01-12 11:22:15,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:15,794 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2019-01-12 11:22:15,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:22:15,794 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2019-01-12 11:22:15,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-12 11:22:15,796 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:15,796 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-12 11:22:15,797 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:15,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:15,797 INFO L82 PathProgramCache]: Analyzing trace with hash -560543098, now seen corresponding path program 1 times [2019-01-12 11:22:15,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:15,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:15,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:15,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:15,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:15,970 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-12 11:22:15,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:15,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:22:15,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:22:15,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:22:15,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:22:15,971 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 6 states. [2019-01-12 11:22:16,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:16,125 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-01-12 11:22:16,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:22:16,127 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-01-12 11:22:16,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:16,128 INFO L225 Difference]: With dead ends: 69 [2019-01-12 11:22:16,128 INFO L226 Difference]: Without dead ends: 67 [2019-01-12 11:22:16,128 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-12 11:22:16,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-12 11:22:16,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 54. [2019-01-12 11:22:16,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-12 11:22:16,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2019-01-12 11:22:16,134 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 40 [2019-01-12 11:22:16,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:16,134 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2019-01-12 11:22:16,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:22:16,134 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2019-01-12 11:22:16,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-12 11:22:16,134 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:16,135 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-12 11:22:16,135 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:16,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:16,135 INFO L82 PathProgramCache]: Analyzing trace with hash 375780089, now seen corresponding path program 1 times [2019-01-12 11:22:16,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:16,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:16,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:16,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:16,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:16,463 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2019-01-12 11:22:16,894 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-12 11:22:16,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:22:16,894 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-12 11:22:16,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:16,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:22:17,009 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-12 11:22:17,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:22:17,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-01-12 11:22:17,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 11:22:17,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 11:22:17,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-01-12 11:22:17,030 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 9 states. [2019-01-12 11:22:17,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:17,160 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2019-01-12 11:22:17,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:22:17,163 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2019-01-12 11:22:17,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:17,164 INFO L225 Difference]: With dead ends: 54 [2019-01-12 11:22:17,164 INFO L226 Difference]: Without dead ends: 52 [2019-01-12 11:22:17,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-01-12 11:22:17,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-12 11:22:17,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-01-12 11:22:17,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-12 11:22:17,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2019-01-12 11:22:17,172 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 40 [2019-01-12 11:22:17,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:17,172 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2019-01-12 11:22:17,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 11:22:17,172 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2019-01-12 11:22:17,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-12 11:22:17,173 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:22:17,173 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-12 11:22:17,173 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:22:17,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:22:17,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1394778411, now seen corresponding path program 1 times [2019-01-12 11:22:17,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:22:17,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:22:17,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:17,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:22:17,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:22:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:22:17,377 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 11:22:17,427 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-12 11:22:17,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:22:17,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 11:22:17,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 11:22:17,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 11:22:17,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 11:22:17,428 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 5 states. [2019-01-12 11:22:17,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:22:17,587 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2019-01-12 11:22:17,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 11:22:17,588 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-01-12 11:22:17,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:22:17,589 INFO L225 Difference]: With dead ends: 71 [2019-01-12 11:22:17,589 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 11:22:17,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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-12 11:22:17,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 11:22:17,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 11:22:17,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 11:22:17,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 11:22:17,592 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2019-01-12 11:22:17,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:22:17,592 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 11:22:17,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 11:22:17,593 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 11:22:17,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 11:22:17,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 11:22:17,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:22:17,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:22:17,905 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 112 [2019-01-12 11:22:18,506 WARN L181 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 30 [2019-01-12 11:22:18,932 WARN L181 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 66 [2019-01-12 11:22:19,218 WARN L181 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 27 [2019-01-12 11:22:19,727 WARN L181 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 72 [2019-01-12 11:22:19,731 INFO L448 ceAbstractionStarter]: For program point L250(line 250) no Hoare annotation was computed. [2019-01-12 11:22:19,731 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-01-12 11:22:19,731 INFO L448 ceAbstractionStarter]: For program point L118(lines 118 398) no Hoare annotation was computed. [2019-01-12 11:22:19,731 INFO L448 ceAbstractionStarter]: For program point L267(line 267) no Hoare annotation was computed. [2019-01-12 11:22:19,731 INFO L448 ceAbstractionStarter]: For program point L36(lines 36 430) no Hoare annotation was computed. [2019-01-12 11:22:19,731 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 11:22:19,732 INFO L448 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-01-12 11:22:19,732 INFO L448 ceAbstractionStarter]: For program point L367(lines 367 390) no Hoare annotation was computed. [2019-01-12 11:22:19,732 INFO L448 ceAbstractionStarter]: For program point L301(lines 301 311) no Hoare annotation was computed. [2019-01-12 11:22:19,732 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 303) no Hoare annotation was computed. [2019-01-12 11:22:19,732 INFO L448 ceAbstractionStarter]: For program point L219(lines 219 339) no Hoare annotation was computed. [2019-01-12 11:22:19,732 INFO L448 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-01-12 11:22:19,732 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 427) no Hoare annotation was computed. [2019-01-12 11:22:19,732 INFO L448 ceAbstractionStarter]: For program point L236(lines 236 326) no Hoare annotation was computed. [2019-01-12 11:22:19,732 INFO L448 ceAbstractionStarter]: For program point L170(lines 170 352) no Hoare annotation was computed. [2019-01-12 11:22:19,732 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 369) no Hoare annotation was computed. [2019-01-12 11:22:19,733 INFO L448 ceAbstractionStarter]: For program point L369(line 369) no Hoare annotation was computed. [2019-01-12 11:22:19,733 INFO L448 ceAbstractionStarter]: For program point L303(line 303) no Hoare annotation was computed. [2019-01-12 11:22:19,733 INFO L448 ceAbstractionStarter]: For program point L138(lines 138 357) no Hoare annotation was computed. [2019-01-12 11:22:19,733 INFO L448 ceAbstractionStarter]: For program point L221(line 221) no Hoare annotation was computed. [2019-01-12 11:22:19,733 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 422) no Hoare annotation was computed. [2019-01-12 11:22:19,733 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 267) no Hoare annotation was computed. [2019-01-12 11:22:19,733 INFO L448 ceAbstractionStarter]: For program point L238(line 238) no Hoare annotation was computed. [2019-01-12 11:22:19,733 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-01-12 11:22:19,733 INFO L448 ceAbstractionStarter]: For program point L106(lines 106 400) no Hoare annotation was computed. [2019-01-12 11:22:19,733 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 108) no Hoare annotation was computed. [2019-01-12 11:22:19,734 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2019-01-12 11:22:19,736 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-12 11:22:19,736 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 349) no Hoare annotation was computed. [2019-01-12 11:22:19,736 INFO L448 ceAbstractionStarter]: For program point L90(lines 90 407) no Hoare annotation was computed. [2019-01-12 11:22:19,737 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 432) no Hoare annotation was computed. [2019-01-12 11:22:19,737 INFO L448 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-01-12 11:22:19,737 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-12 11:22:19,737 INFO L448 ceAbstractionStarter]: For program point L289(lines 289 313) no Hoare annotation was computed. [2019-01-12 11:22:19,737 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 11:22:19,737 INFO L448 ceAbstractionStarter]: For program point L157(lines 157 354) no Hoare annotation was computed. [2019-01-12 11:22:19,737 INFO L448 ceAbstractionStarter]: For program point L58(lines 58 417) no Hoare annotation was computed. [2019-01-12 11:22:19,737 INFO L444 ceAbstractionStarter]: At program point L405(lines 99 406) the Hoare annotation is: (= ULTIMATE.start_main_~__VERIFIER_assert__cond~0 1) [2019-01-12 11:22:19,738 INFO L448 ceAbstractionStarter]: For program point L207(lines 207 341) no Hoare annotation was computed. [2019-01-12 11:22:19,738 INFO L448 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-01-12 11:22:19,738 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 429) no Hoare annotation was computed. [2019-01-12 11:22:19,738 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 140) no Hoare annotation was computed. [2019-01-12 11:22:19,738 INFO L448 ceAbstractionStarter]: For program point L257(lines 257 323) no Hoare annotation was computed. [2019-01-12 11:22:19,738 INFO L448 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2019-01-12 11:22:19,738 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 291) no Hoare annotation was computed. [2019-01-12 11:22:19,738 INFO L448 ceAbstractionStarter]: For program point L291(line 291) no Hoare annotation was computed. [2019-01-12 11:22:19,738 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-01-12 11:22:19,738 INFO L448 ceAbstractionStarter]: For program point L60(lines 60 412) no Hoare annotation was computed. [2019-01-12 11:22:19,739 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 279) no Hoare annotation was computed. [2019-01-12 11:22:19,741 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-01-12 11:22:19,741 INFO L448 ceAbstractionStarter]: For program point L209(line 209) no Hoare annotation was computed. [2019-01-12 11:22:19,742 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 11:22:19,742 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 381) no Hoare annotation was computed. [2019-01-12 11:22:19,742 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 221) no Hoare annotation was computed. [2019-01-12 11:22:19,742 INFO L448 ceAbstractionStarter]: For program point L78(lines 78 409) no Hoare annotation was computed. [2019-01-12 11:22:19,742 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 250) no Hoare annotation was computed. [2019-01-12 11:22:19,742 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-12 11:22:19,742 INFO L448 ceAbstractionStarter]: For program point L277(lines 277 315) no Hoare annotation was computed. [2019-01-12 11:22:19,743 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2019-01-12 11:22:19,743 INFO L451 ceAbstractionStarter]: At program point L426(lines 8 434) the Hoare annotation is: true [2019-01-12 11:22:19,743 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 431) no Hoare annotation was computed. [2019-01-12 11:22:19,743 INFO L448 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-01-12 11:22:19,743 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 333) no Hoare annotation was computed. [2019-01-12 11:22:19,743 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 392) no Hoare annotation was computed. [2019-01-12 11:22:19,743 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 120) no Hoare annotation was computed. [2019-01-12 11:22:19,743 INFO L448 ceAbstractionStarter]: For program point L279(line 279) no Hoare annotation was computed. [2019-01-12 11:22:19,743 INFO L448 ceAbstractionStarter]: For program point L48(lines 48 428) no Hoare annotation was computed. [2019-01-12 11:22:19,743 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 11:22:19,743 INFO L448 ceAbstractionStarter]: For program point L379(lines 379 388) no Hoare annotation was computed. [2019-01-12 11:22:19,744 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-12 11:22:19,744 INFO L448 ceAbstractionStarter]: For program point L99(lines 99 406) no Hoare annotation was computed. [2019-01-12 11:22:19,744 INFO L448 ceAbstractionStarter]: For program point L66(lines 66 411) no Hoare annotation was computed. [2019-01-12 11:22:19,744 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 238) no Hoare annotation was computed. [2019-01-12 11:22:19,744 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 324) no Hoare annotation was computed. [2019-01-12 11:22:19,744 INFO L448 ceAbstractionStarter]: For program point L182(lines 182 350) no Hoare annotation was computed. [2019-01-12 11:22:19,744 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 209) no Hoare annotation was computed. [2019-01-12 11:22:19,744 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 92) no Hoare annotation was computed. [2019-01-12 11:22:19,744 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 317) no Hoare annotation was computed. [2019-01-12 11:22:19,745 INFO L448 ceAbstractionStarter]: For program point L199(lines 199 348) no Hoare annotation was computed. [2019-01-12 11:22:19,745 INFO L448 ceAbstractionStarter]: For program point L381(line 381) no Hoare annotation was computed. [2019-01-12 11:22:19,745 INFO L448 ceAbstractionStarter]: For program point L150(lines 150 355) no Hoare annotation was computed. [2019-01-12 11:22:19,745 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 433) no Hoare annotation was computed. [2019-01-12 11:22:19,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 11:22:19 BoogieIcfgContainer [2019-01-12 11:22:19,775 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 11:22:19,776 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 11:22:19,776 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 11:22:19,776 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 11:22:19,778 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:22:06" (3/4) ... [2019-01-12 11:22:19,782 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 11:22:19,798 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-12 11:22:19,799 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 11:22:19,897 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 11:22:19,897 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 11:22:19,898 INFO L168 Benchmark]: Toolchain (without parser) took 14564.98 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 259.5 MB). Free memory was 948.7 MB in the beginning and 1.0 GB in the end (delta: -83.8 MB). Peak memory consumption was 175.7 MB. Max. memory is 11.5 GB. [2019-01-12 11:22:19,899 INFO L168 Benchmark]: CDTParser took 0.17 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-12 11:22:19,899 INFO L168 Benchmark]: CACSL2BoogieTranslator took 453.91 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 932.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-12 11:22:19,899 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.93 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 11:22:19,901 INFO L168 Benchmark]: Boogie Preprocessor took 116.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -197.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-12 11:22:19,901 INFO L168 Benchmark]: RCFGBuilder took 819.08 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: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-01-12 11:22:19,902 INFO L168 Benchmark]: TraceAbstraction took 12979.54 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 112.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.9 MB). Peak memory consumption was 344.5 MB. Max. memory is 11.5 GB. [2019-01-12 11:22:19,903 INFO L168 Benchmark]: Witness Printer took 121.57 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. [2019-01-12 11:22:19,907 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.17 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 453.91 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 932.6 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 68.93 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 116.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -197.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 819.08 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: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12979.54 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 112.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.9 MB). Peak memory consumption was 344.5 MB. Max. memory is 11.5 GB. * Witness Printer took 121.57 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 152]: 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: 291]: 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 - PositiveResult [Line: 120]: 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: 184]: 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: 267]: 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: 279]: 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: 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: 238]: 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: 80]: 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 - 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.8s OverallTime, 23 OverallIterations, 2 TraceHistogramMax, 5.1s AutomataDifference, 0.0s DeadEndRemovalTime, 2.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 1246 SDtfs, 2836 SDslu, 1555 SDs, 0 SdLazy, 1119 SolverSat, 159 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 310 GetRequests, 151 SyntacticMatches, 4 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 5.2s 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.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 315 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 16 NumberOfFragments, 742 HoareAnnotationTreeSize, 6 FomulaSimplifications, 239048 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 6 FomulaSimplificationsInter, 147118 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.4s 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...