./Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/loop-invgen/nested6_true-unreach-call_true-termination.i --full-output --rcfgbuilder.size.of.a.code.block LoopFreeBlock --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0210da8c Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/TaipanReach.xml -i ../../../trunk/examples/svcomp/loop-invgen/nested6_true-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UTaipan-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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 934ee9c856a834ce808d29dea79c6912619f897f --rcfgbuilder.size.of.a.code.block LoopFreeBlock ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0210da8 [2018-10-22 10:17:25,631 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-22 10:17:25,634 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-22 10:17:25,647 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-22 10:17:25,648 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-22 10:17:25,649 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-22 10:17:25,650 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-22 10:17:25,652 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-22 10:17:25,654 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-22 10:17:25,655 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-22 10:17:25,656 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-22 10:17:25,656 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-22 10:17:25,657 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-22 10:17:25,658 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-22 10:17:25,659 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-22 10:17:25,660 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-22 10:17:25,661 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-22 10:17:25,663 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-22 10:17:25,665 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-22 10:17:25,667 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-22 10:17:25,668 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-22 10:17:25,669 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-22 10:17:25,672 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-22 10:17:25,672 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-22 10:17:25,672 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-22 10:17:25,673 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-22 10:17:25,675 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-22 10:17:25,675 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-22 10:17:25,676 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-22 10:17:25,678 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-22 10:17:25,678 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-22 10:17:25,679 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-22 10:17:25,679 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-22 10:17:25,679 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-22 10:17:25,681 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-22 10:17:25,681 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-22 10:17:25,681 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-22 10:17:25,698 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-22 10:17:25,698 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-22 10:17:25,699 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-22 10:17:25,700 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-22 10:17:25,700 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-22 10:17:25,700 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-22 10:17:25,700 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-22 10:17:25,700 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-22 10:17:25,701 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-22 10:17:25,701 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-22 10:17:25,702 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-22 10:17:25,702 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-22 10:17:25,702 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-22 10:17:25,703 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-22 10:17:25,703 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-22 10:17:25,703 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-22 10:17:25,703 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-22 10:17:25,703 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-22 10:17:25,703 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-22 10:17:25,705 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-22 10:17:25,705 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-22 10:17:25,705 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-22 10:17:25,706 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-22 10:17:25,706 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-22 10:17:25,706 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-22 10:17:25,706 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-22 10:17:25,706 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-22 10:17:25,706 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-22 10:17:25,707 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-22 10:17:25,707 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-22 10:17:25,707 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-22 10:17:25,707 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-22 10:17:25,707 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-22 10:17:25,708 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-22 10:17:25,708 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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/UTaipan-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 -> Taipan 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 -> 934ee9c856a834ce808d29dea79c6912619f897f Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock [2018-10-22 10:17:25,756 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-22 10:17:25,770 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-22 10:17:25,774 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-22 10:17:25,775 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-22 10:17:25,775 INFO L276 PluginConnector]: CDTParser initialized [2018-10-22 10:17:25,776 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-invgen/nested6_true-unreach-call_true-termination.i [2018-10-22 10:17:25,833 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/12b44ac37/4f2667cd4519454ca60f1eac25f7e902/FLAGb19ab4076 [2018-10-22 10:17:26,258 INFO L298 CDTParser]: Found 1 translation units. [2018-10-22 10:17:26,261 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested6_true-unreach-call_true-termination.i [2018-10-22 10:17:26,269 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/12b44ac37/4f2667cd4519454ca60f1eac25f7e902/FLAGb19ab4076 [2018-10-22 10:17:26,287 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/12b44ac37/4f2667cd4519454ca60f1eac25f7e902 [2018-10-22 10:17:26,292 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-22 10:17:26,293 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-22 10:17:26,295 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-22 10:17:26,295 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-22 10:17:26,299 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-22 10:17:26,300 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 10:17:26" (1/1) ... [2018-10-22 10:17:26,303 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b791dd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:17:26, skipping insertion in model container [2018-10-22 10:17:26,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 10:17:26" (1/1) ... [2018-10-22 10:17:26,314 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-22 10:17:26,337 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-22 10:17:26,516 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-22 10:17:26,521 INFO L189 MainTranslator]: Completed pre-run [2018-10-22 10:17:26,541 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-22 10:17:26,557 INFO L193 MainTranslator]: Completed translation [2018-10-22 10:17:26,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:17:26 WrapperNode [2018-10-22 10:17:26,558 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-22 10:17:26,559 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-22 10:17:26,559 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-22 10:17:26,559 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-22 10:17:26,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:17:26" (1/1) ... [2018-10-22 10:17:26,577 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:17:26" (1/1) ... [2018-10-22 10:17:26,583 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-22 10:17:26,584 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-22 10:17:26,584 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-22 10:17:26,584 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-22 10:17:26,595 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:17:26" (1/1) ... [2018-10-22 10:17:26,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:17:26" (1/1) ... [2018-10-22 10:17:26,597 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:17:26" (1/1) ... [2018-10-22 10:17:26,597 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:17:26" (1/1) ... [2018-10-22 10:17:26,602 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:17:26" (1/1) ... [2018-10-22 10:17:26,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:17:26" (1/1) ... [2018-10-22 10:17:26,611 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:17:26" (1/1) ... [2018-10-22 10:17:26,619 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-22 10:17:26,621 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-22 10:17:26,621 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-22 10:17:26,621 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-22 10:17:26,625 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:17:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-22 10:17:26,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-22 10:17:26,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-22 10:17:26,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-22 10:17:26,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-22 10:17:26,774 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-22 10:17:26,774 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-22 10:17:26,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-22 10:17:26,774 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-22 10:17:27,181 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-22 10:17:27,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 10:17:27 BoogieIcfgContainer [2018-10-22 10:17:27,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-22 10:17:27,183 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-22 10:17:27,184 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-22 10:17:27,187 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-22 10:17:27,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 10:17:26" (1/3) ... [2018-10-22 10:17:27,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e5db468 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 10:17:27, skipping insertion in model container [2018-10-22 10:17:27,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 10:17:26" (2/3) ... [2018-10-22 10:17:27,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e5db468 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 10:17:27, skipping insertion in model container [2018-10-22 10:17:27,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 10:17:27" (3/3) ... [2018-10-22 10:17:27,192 INFO L112 eAbstractionObserver]: Analyzing ICFG nested6_true-unreach-call_true-termination.i [2018-10-22 10:17:27,202 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-22 10:17:27,209 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-22 10:17:27,226 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-22 10:17:27,259 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-22 10:17:27,260 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-22 10:17:27,260 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-22 10:17:27,260 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-22 10:17:27,260 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-22 10:17:27,260 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-22 10:17:27,260 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-22 10:17:27,261 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-22 10:17:27,261 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-22 10:17:27,278 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-10-22 10:17:27,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-22 10:17:27,284 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 10:17:27,285 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 10:17:27,288 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 10:17:27,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:17:27,293 INFO L82 PathProgramCache]: Analyzing trace with hash -915754692, now seen corresponding path program 1 times [2018-10-22 10:17:27,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 10:17:27,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:17:27,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:17:27,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:17:27,344 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 10:17:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:17:27,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 10:17:27,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 10:17:27,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-22 10:17:27,507 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 10:17:27,510 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-22 10:17:27,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-22 10:17:27,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-22 10:17:27,526 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 5 states. [2018-10-22 10:17:27,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 10:17:27,679 INFO L93 Difference]: Finished difference Result 62 states and 85 transitions. [2018-10-22 10:17:27,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-22 10:17:27,681 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-10-22 10:17:27,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 10:17:27,691 INFO L225 Difference]: With dead ends: 62 [2018-10-22 10:17:27,692 INFO L226 Difference]: Without dead ends: 30 [2018-10-22 10:17:27,695 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-22 10:17:27,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-22 10:17:27,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-10-22 10:17:27,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-22 10:17:27,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-10-22 10:17:27,740 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 16 [2018-10-22 10:17:27,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 10:17:27,740 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-10-22 10:17:27,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-22 10:17:27,741 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-10-22 10:17:27,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-22 10:17:27,742 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 10:17:27,742 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 10:17:27,742 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 10:17:27,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:17:27,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1240698098, now seen corresponding path program 1 times [2018-10-22 10:17:27,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 10:17:27,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:17:27,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:17:27,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:17:27,744 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 10:17:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:17:27,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 10:17:27,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-22 10:17:27,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-22 10:17:27,928 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 10:17:27,930 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-22 10:17:27,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-22 10:17:27,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-22 10:17:27,931 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 6 states. [2018-10-22 10:17:28,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 10:17:28,330 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-10-22 10:17:28,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-22 10:17:28,331 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-10-22 10:17:28,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 10:17:28,333 INFO L225 Difference]: With dead ends: 43 [2018-10-22 10:17:28,333 INFO L226 Difference]: Without dead ends: 41 [2018-10-22 10:17:28,335 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-22 10:17:28,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-22 10:17:28,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2018-10-22 10:17:28,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-22 10:17:28,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-10-22 10:17:28,346 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 18 [2018-10-22 10:17:28,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 10:17:28,346 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-10-22 10:17:28,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-22 10:17:28,347 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-10-22 10:17:28,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-22 10:17:28,348 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 10:17:28,349 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 10:17:28,349 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 10:17:28,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:17:28,350 INFO L82 PathProgramCache]: Analyzing trace with hash 249299368, now seen corresponding path program 1 times [2018-10-22 10:17:28,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 10:17:28,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:17:28,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:17:28,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:17:28,353 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 10:17:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:17:28,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 10:17:28,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 10:17:28,570 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 10:17:28,572 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-10-22 10:17:28,574 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [19], [24], [28], [33], [53], [67], [70], [72], [75], [77], [78], [79], [80], [84], [85], [86], [88] [2018-10-22 10:17:28,620 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 10:17:28,620 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 10:17:28,838 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 10:17:28,840 INFO L272 AbstractInterpreter]: Visited 19 different actions 23 times. Never merged. Never widened. Never found a fixpoint. Largest state had 7 variables. [2018-10-22 10:17:28,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:17:28,891 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 10:17:29,047 INFO L232 lantSequenceWeakener]: Weakened 9 states. On average, predicates are now at 54.44% of their original sizes. [2018-10-22 10:17:29,047 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 10:17:29,469 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 10:17:29,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 10:17:29,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15 [2018-10-22 10:17:29,471 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 10:17:29,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-22 10:17:29,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-22 10:17:29,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-10-22 10:17:29,474 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 10 states. [2018-10-22 10:17:31,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 10:17:31,358 INFO L93 Difference]: Finished difference Result 106 states and 129 transitions. [2018-10-22 10:17:31,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-22 10:17:31,358 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-10-22 10:17:31,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 10:17:31,361 INFO L225 Difference]: With dead ends: 106 [2018-10-22 10:17:31,361 INFO L226 Difference]: Without dead ends: 79 [2018-10-22 10:17:31,363 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-10-22 10:17:31,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-22 10:17:31,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 55. [2018-10-22 10:17:31,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-22 10:17:31,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-10-22 10:17:31,390 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 21 [2018-10-22 10:17:31,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 10:17:31,391 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-10-22 10:17:31,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-22 10:17:31,391 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-10-22 10:17:31,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-22 10:17:31,392 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 10:17:31,394 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 10:17:31,395 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 10:17:31,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:17:31,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1269815647, now seen corresponding path program 1 times [2018-10-22 10:17:31,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 10:17:31,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:17:31,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:17:31,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:17:31,399 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 10:17:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:17:31,520 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-22 10:17:31,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 10:17:31,520 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 10:17:31,520 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-10-22 10:17:31,521 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [19], [24], [28], [33], [36], [40], [43], [53], [57], [67], [70], [72], [75], [77], [78], [79], [80], [84], [85], [86], [88] [2018-10-22 10:17:31,523 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 10:17:31,523 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 10:17:31,547 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 10:17:31,547 INFO L272 AbstractInterpreter]: Visited 22 different actions 26 times. Never merged. Never widened. Never found a fixpoint. Largest state had 8 variables. [2018-10-22 10:17:31,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:17:31,572 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 10:17:31,616 INFO L232 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 46.67% of their original sizes. [2018-10-22 10:17:31,616 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 10:17:32,038 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 10:17:32,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 10:17:32,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [8] total 19 [2018-10-22 10:17:32,039 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 10:17:32,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-22 10:17:32,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-22 10:17:32,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-10-22 10:17:32,040 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 13 states. [2018-10-22 10:17:33,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 10:17:33,793 INFO L93 Difference]: Finished difference Result 138 states and 172 transitions. [2018-10-22 10:17:33,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-22 10:17:33,793 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-10-22 10:17:33,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 10:17:33,795 INFO L225 Difference]: With dead ends: 138 [2018-10-22 10:17:33,795 INFO L226 Difference]: Without dead ends: 111 [2018-10-22 10:17:33,796 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-10-22 10:17:33,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-22 10:17:33,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 58. [2018-10-22 10:17:33,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-22 10:17:33,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2018-10-22 10:17:33,814 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 27 [2018-10-22 10:17:33,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 10:17:33,814 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2018-10-22 10:17:33,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-22 10:17:33,814 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2018-10-22 10:17:33,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-22 10:17:33,816 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 10:17:33,816 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 10:17:33,816 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 10:17:33,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:17:33,816 INFO L82 PathProgramCache]: Analyzing trace with hash -243487574, now seen corresponding path program 1 times [2018-10-22 10:17:33,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 10:17:33,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:17:33,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:17:33,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:17:33,818 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 10:17:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:17:33,954 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-22 10:17:33,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 10:17:33,955 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 10:17:33,955 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-10-22 10:17:33,956 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [19], [24], [28], [33], [36], [40], [43], [45], [48], [53], [57], [67], [70], [72], [75], [77], [78], [79], [80], [82], [83], [84], [85], [86], [88] [2018-10-22 10:17:33,958 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 10:17:33,958 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 10:17:34,129 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-22 10:17:34,129 INFO L272 AbstractInterpreter]: Visited 28 different actions 312 times. Merged at 11 different actions 108 times. Widened at 3 different actions 16 times. Found 15 fixpoints after 4 different actions. Largest state had 9 variables. [2018-10-22 10:17:34,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:17:34,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-22 10:17:34,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 10:17:34,156 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 10:17:34,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:17:34,168 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-22 10:17:34,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:17:34,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 10:17:34,438 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-22 10:17:34,439 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 10:17:34,554 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-22 10:17:34,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 10:17:34,584 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-22 10:17:34,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:17:34,607 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-22 10:17:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:17:34,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 10:17:34,641 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-22 10:17:34,641 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 10:17:34,751 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-22 10:17:34,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-22 10:17:34,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6, 6, 6] total 11 [2018-10-22 10:17:34,752 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-22 10:17:34,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-22 10:17:34,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-22 10:17:34,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-10-22 10:17:34,754 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 11 states. [2018-10-22 10:17:35,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 10:17:35,326 INFO L93 Difference]: Finished difference Result 112 states and 132 transitions. [2018-10-22 10:17:35,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-22 10:17:35,328 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-10-22 10:17:35,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 10:17:35,331 INFO L225 Difference]: With dead ends: 112 [2018-10-22 10:17:35,331 INFO L226 Difference]: Without dead ends: 85 [2018-10-22 10:17:35,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 135 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2018-10-22 10:17:35,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-22 10:17:35,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2018-10-22 10:17:35,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-22 10:17:35,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 93 transitions. [2018-10-22 10:17:35,357 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 93 transitions. Word has length 35 [2018-10-22 10:17:35,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 10:17:35,357 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 93 transitions. [2018-10-22 10:17:35,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-22 10:17:35,357 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2018-10-22 10:17:35,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-22 10:17:35,360 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 10:17:35,360 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 10:17:35,360 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 10:17:35,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:17:35,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1127244897, now seen corresponding path program 1 times [2018-10-22 10:17:35,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 10:17:35,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:17:35,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:17:35,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:17:35,364 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 10:17:35,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:17:35,662 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-22 10:17:35,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 10:17:35,662 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 10:17:35,662 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 47 with the following transitions: [2018-10-22 10:17:35,662 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [19], [24], [28], [31], [33], [36], [40], [43], [53], [57], [61], [67], [70], [72], [75], [77], [78], [79], [80], [84], [85], [86], [87], [88] [2018-10-22 10:17:35,664 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 10:17:35,664 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 10:17:35,807 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-22 10:17:35,807 INFO L272 AbstractInterpreter]: Visited 26 different actions 257 times. Merged at 12 different actions 107 times. Widened at 4 different actions 17 times. Found 11 fixpoints after 3 different actions. Largest state had 9 variables. [2018-10-22 10:17:35,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:17:35,846 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-22 10:17:35,911 INFO L232 lantSequenceWeakener]: Weakened 20 states. On average, predicates are now at 55.5% of their original sizes. [2018-10-22 10:17:35,911 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-22 10:17:36,590 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-22 10:17:36,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-22 10:17:36,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [12] total 28 [2018-10-22 10:17:36,591 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-22 10:17:36,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-22 10:17:36,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-22 10:17:36,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-10-22 10:17:36,593 INFO L87 Difference]: Start difference. First operand 80 states and 93 transitions. Second operand 18 states. [2018-10-22 10:17:38,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 10:17:38,965 INFO L93 Difference]: Finished difference Result 161 states and 198 transitions. [2018-10-22 10:17:38,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-22 10:17:38,966 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 46 [2018-10-22 10:17:38,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 10:17:38,967 INFO L225 Difference]: With dead ends: 161 [2018-10-22 10:17:38,967 INFO L226 Difference]: Without dead ends: 112 [2018-10-22 10:17:38,968 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2018-10-22 10:17:38,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-10-22 10:17:38,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 93. [2018-10-22 10:17:38,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-22 10:17:38,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 113 transitions. [2018-10-22 10:17:38,992 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 113 transitions. Word has length 46 [2018-10-22 10:17:38,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 10:17:38,993 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 113 transitions. [2018-10-22 10:17:38,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-22 10:17:38,993 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 113 transitions. [2018-10-22 10:17:38,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-22 10:17:38,995 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 10:17:38,995 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 10:17:38,995 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 10:17:38,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:17:38,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1340957747, now seen corresponding path program 1 times [2018-10-22 10:17:38,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 10:17:38,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:17:38,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:17:38,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:17:38,997 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 10:17:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:17:39,222 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-22 10:17:39,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 10:17:39,223 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 10:17:39,223 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-10-22 10:17:39,223 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [19], [24], [28], [31], [33], [36], [40], [43], [45], [48], [53], [57], [61], [67], [70], [72], [75], [77], [78], [79], [80], [82], [83], [84], [85], [86], [88] [2018-10-22 10:17:39,225 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 10:17:39,225 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 10:17:39,425 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-22 10:17:39,426 INFO L272 AbstractInterpreter]: Visited 30 different actions 426 times. Merged at 15 different actions 163 times. Widened at 5 different actions 26 times. Found 30 fixpoints after 7 different actions. Largest state had 10 variables. [2018-10-22 10:17:39,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:17:39,467 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-22 10:17:39,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 10:17:39,467 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 10:17:39,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:17:39,478 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-22 10:17:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:17:39,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 10:17:40,071 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-22 10:17:40,072 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 10:17:40,392 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 28 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-22 10:17:40,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 10:17:40,413 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-22 10:17:40,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:17:40,429 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-22 10:17:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:17:40,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 10:17:40,600 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-22 10:17:40,600 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 10:17:40,672 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 28 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-22 10:17:40,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-22 10:17:40,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8, 8, 8] total 14 [2018-10-22 10:17:40,675 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-22 10:17:40,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-22 10:17:40,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-22 10:17:40,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-10-22 10:17:40,676 INFO L87 Difference]: Start difference. First operand 93 states and 113 transitions. Second operand 12 states. [2018-10-22 10:17:41,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 10:17:41,087 INFO L93 Difference]: Finished difference Result 254 states and 326 transitions. [2018-10-22 10:17:41,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-22 10:17:41,087 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-10-22 10:17:41,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 10:17:41,089 INFO L225 Difference]: With dead ends: 254 [2018-10-22 10:17:41,089 INFO L226 Difference]: Without dead ends: 160 [2018-10-22 10:17:41,091 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 190 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2018-10-22 10:17:41,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-22 10:17:41,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 112. [2018-10-22 10:17:41,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-22 10:17:41,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 138 transitions. [2018-10-22 10:17:41,124 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 138 transitions. Word has length 51 [2018-10-22 10:17:41,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 10:17:41,124 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 138 transitions. [2018-10-22 10:17:41,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-22 10:17:41,124 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2018-10-22 10:17:41,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-22 10:17:41,127 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 10:17:41,127 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 10:17:41,128 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 10:17:41,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:17:41,128 INFO L82 PathProgramCache]: Analyzing trace with hash 567522584, now seen corresponding path program 1 times [2018-10-22 10:17:41,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 10:17:41,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:17:41,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:17:41,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:17:41,129 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 10:17:41,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:17:41,266 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 26 proven. 32 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-22 10:17:41,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 10:17:41,267 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 10:17:41,267 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-10-22 10:17:41,267 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [19], [24], [28], [31], [33], [36], [40], [43], [45], [48], [53], [57], [61], [67], [70], [72], [75], [77], [78], [79], [80], [82], [83], [84], [85], [86], [87], [88] [2018-10-22 10:17:41,269 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-22 10:17:41,269 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-22 10:17:41,407 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-22 10:17:41,407 INFO L272 AbstractInterpreter]: Visited 31 different actions 424 times. Merged at 16 different actions 158 times. Widened at 5 different actions 23 times. Found 39 fixpoints after 9 different actions. Largest state had 10 variables. [2018-10-22 10:17:41,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:17:41,445 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-22 10:17:41,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 10:17:41,445 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 10:17:41,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:17:41,460 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-22 10:17:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:17:41,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 10:17:41,903 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 53 proven. 16 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-22 10:17:41,904 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 10:17:42,005 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 43 proven. 16 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-22 10:17:42,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 10:17:42,027 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-22 10:17:42,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:17:42,044 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-22 10:17:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:17:42,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 10:17:43,679 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 53 proven. 16 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-22 10:17:43,679 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 10:17:43,795 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 43 proven. 16 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-10-22 10:17:43,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-22 10:17:43,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9] total 19 [2018-10-22 10:17:43,797 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-22 10:17:43,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-22 10:17:43,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-22 10:17:43,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=291, Unknown=1, NotChecked=0, Total=342 [2018-10-22 10:17:43,799 INFO L87 Difference]: Start difference. First operand 112 states and 138 transitions. Second operand 16 states. [2018-10-22 10:17:45,780 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-22 10:17:47,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 10:17:47,457 INFO L93 Difference]: Finished difference Result 590 states and 783 transitions. [2018-10-22 10:17:47,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-22 10:17:47,457 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 65 [2018-10-22 10:17:47,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 10:17:47,463 INFO L225 Difference]: With dead ends: 590 [2018-10-22 10:17:47,463 INFO L226 Difference]: Without dead ends: 263 [2018-10-22 10:17:47,471 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 252 SyntacticMatches, 11 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1766 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=872, Invalid=4383, Unknown=1, NotChecked=0, Total=5256 [2018-10-22 10:17:47,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-10-22 10:17:47,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 188. [2018-10-22 10:17:47,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-10-22 10:17:47,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 239 transitions. [2018-10-22 10:17:47,550 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 239 transitions. Word has length 65 [2018-10-22 10:17:47,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 10:17:47,550 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 239 transitions. [2018-10-22 10:17:47,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-22 10:17:47,551 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 239 transitions. [2018-10-22 10:17:47,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-22 10:17:47,554 INFO L367 BasicCegarLoop]: Found error trace [2018-10-22 10:17:47,554 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 7, 6, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-22 10:17:47,554 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-22 10:17:47,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-22 10:17:47,554 INFO L82 PathProgramCache]: Analyzing trace with hash -957201421, now seen corresponding path program 2 times [2018-10-22 10:17:47,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-22 10:17:47,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:17:47,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-22 10:17:47,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-22 10:17:47,555 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-22 10:17:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-22 10:17:47,764 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 70 proven. 59 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2018-10-22 10:17:47,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 10:17:47,764 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-22 10:17:47,764 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-22 10:17:47,764 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-22 10:17:47,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 10:17:47,764 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-22 10:17:47,779 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-22 10:17:47,779 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-10-22 10:17:47,830 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-22 10:17:47,830 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 10:17:47,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 10:17:48,558 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 179 proven. 48 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-10-22 10:17:48,559 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 10:17:49,255 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 101 proven. 48 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-10-22 10:17:49,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-22 10:17:49,277 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-10-22 10:17:49,294 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-22 10:17:49,294 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-10-22 10:17:49,353 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-22 10:17:49,353 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-22 10:17:49,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-22 10:17:53,474 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 179 proven. 46 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-10-22 10:17:53,474 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-22 10:17:53,613 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 101 proven. 46 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2018-10-22 10:17:53,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-10-22 10:17:53,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11, 10, 10] total 23 [2018-10-22 10:17:53,615 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-22 10:17:53,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-22 10:17:53,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-22 10:17:53,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=434, Unknown=6, NotChecked=0, Total=506 [2018-10-22 10:17:53,616 INFO L87 Difference]: Start difference. First operand 188 states and 239 transitions. Second operand 17 states. [2018-10-22 10:17:55,119 WARN L179 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2018-10-22 10:17:56,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-22 10:17:56,266 INFO L93 Difference]: Finished difference Result 436 states and 574 transitions. [2018-10-22 10:17:56,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-22 10:17:56,267 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 107 [2018-10-22 10:17:56,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-22 10:17:56,268 INFO L225 Difference]: With dead ends: 436 [2018-10-22 10:17:56,268 INFO L226 Difference]: Without dead ends: 0 [2018-10-22 10:17:56,271 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 403 SyntacticMatches, 12 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=560, Invalid=2856, Unknown=6, NotChecked=0, Total=3422 [2018-10-22 10:17:56,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-22 10:17:56,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-22 10:17:56,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-22 10:17:56,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-22 10:17:56,272 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 107 [2018-10-22 10:17:56,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-22 10:17:56,272 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-22 10:17:56,272 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-22 10:17:56,272 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-22 10:17:56,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-22 10:17:56,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-22 10:17:56,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:17:56,616 WARN L179 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 161 [2018-10-22 10:17:56,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:17:56,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:17:56,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:17:56,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:17:56,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:17:56,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:17:57,046 WARN L179 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 192 [2018-10-22 10:17:57,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:17:57,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:17:57,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:17:57,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:17:57,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:17:57,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:17:57,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:17:57,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:17:57,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:17:57,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:17:57,643 WARN L179 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 196 [2018-10-22 10:17:57,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:17:57,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:17:58,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:17:58,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:17:58,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:17:58,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:17:58,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:17:58,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:17:58,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:17:58,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:17:58,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:17:58,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:17:58,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:17:58,179 WARN L179 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 189 [2018-10-22 10:17:58,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-22 10:17:58,455 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 161 [2018-10-22 10:18:01,161 WARN L179 SmtUtils]: Spent 2.69 s on a formula simplification. DAG size of input: 155 DAG size of output: 18 [2018-10-22 10:18:04,379 WARN L179 SmtUtils]: Spent 3.21 s on a formula simplification. DAG size of input: 187 DAG size of output: 30 [2018-10-22 10:18:05,731 WARN L179 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 196 DAG size of output: 19 [2018-10-22 10:18:09,431 WARN L179 SmtUtils]: Spent 3.69 s on a formula simplification. DAG size of input: 188 DAG size of output: 18 [2018-10-22 10:18:09,591 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 29 [2018-10-22 10:18:10,501 WARN L179 SmtUtils]: Spent 907.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 18 [2018-10-22 10:18:10,505 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-22 10:18:10,505 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-22 10:18:10,505 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-22 10:18:10,505 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-22 10:18:10,505 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-22 10:18:10,505 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-22 10:18:10,506 INFO L421 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (let ((.cse0 (and (and (<= (* 2 main_~i~0) main_~j~0) (<= main_~n~0 main_~k~0)) (<= main_~k~0 main_~n~0)))) (or (and .cse0 (<= main_~j~0 main_~i~0)) (and (<= (+ main_~j~0 1) main_~n~0) .cse0))) [2018-10-22 10:18:10,506 INFO L421 ceAbstractionStarter]: At program point L27-1(line 27) the Hoare annotation is: (let ((.cse0 (and (and (<= (* 2 main_~i~0) main_~j~0) (<= main_~n~0 main_~k~0)) (<= main_~k~0 main_~n~0)))) (or (and .cse0 (<= main_~j~0 main_~i~0)) (and (<= (+ main_~j~0 1) main_~n~0) .cse0))) [2018-10-22 10:18:10,506 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 34) no Hoare annotation was computed. [2018-10-22 10:18:10,506 INFO L421 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (let ((.cse0 (and (let ((.cse1 (* 2 main_~i~0))) (and (<= .cse1 main_~j~0) (<= .cse1 main_~k~0))) (<= (+ main_~k~0 1) main_~n~0)))) (or (and (<= (+ main_~j~0 1) main_~n~0) .cse0) (and .cse0 (<= main_~j~0 main_~i~0)))) [2018-10-22 10:18:10,506 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 22 24) no Hoare annotation was computed. [2018-10-22 10:18:10,506 INFO L425 ceAbstractionStarter]: For program point L19-1(lines 19 31) no Hoare annotation was computed. [2018-10-22 10:18:10,506 INFO L425 ceAbstractionStarter]: For program point L19-3(lines 19 31) no Hoare annotation was computed. [2018-10-22 10:18:10,507 INFO L425 ceAbstractionStarter]: For program point L15(lines 15 18) no Hoare annotation was computed. [2018-10-22 10:18:10,507 INFO L421 ceAbstractionStarter]: At program point L19-4(lines 19 31) the Hoare annotation is: (let ((.cse1 (<= main_~k~0 main_~n~0)) (.cse3 (* 2 main_~i~0)) (.cse0 (<= main_~n~0 main_~k~0)) (.cse2 (<= main_~n~0 main_~j~0))) (or (and .cse0 (<= main_~n~0 (+ main_~i~0 999999)) (<= 0 (+ (* 2 main_~n~0) 4294967296)) .cse1 (= main_~i~0 0)) (and .cse1 .cse0 .cse2) (and (<= main_~k~0 (+ .cse3 1)) .cse0 .cse2) (and (<= main_~j~0 .cse3) .cse0 .cse2) (and (<= main_~j~0 main_~i~0) .cse0 .cse2))) [2018-10-22 10:18:10,507 INFO L425 ceAbstractionStarter]: For program point L15-1(lines 15 18) no Hoare annotation was computed. [2018-10-22 10:18:10,507 INFO L428 ceAbstractionStarter]: At program point L32(lines 10 34) the Hoare annotation is: true [2018-10-22 10:18:10,507 INFO L425 ceAbstractionStarter]: For program point L28(lines 20 30) no Hoare annotation was computed. [2018-10-22 10:18:10,507 INFO L425 ceAbstractionStarter]: For program point L20-1(lines 20 30) no Hoare annotation was computed. [2018-10-22 10:18:10,507 INFO L421 ceAbstractionStarter]: At program point L20-3(lines 20 30) the Hoare annotation is: (let ((.cse1 (* 2 main_~i~0))) (let ((.cse0 (and (<= .cse1 main_~j~0) (<= main_~n~0 main_~k~0))) (.cse2 (<= main_~k~0 main_~j~0))) (or (and .cse0 (<= main_~k~0 main_~n~0)) (and (<= main_~k~0 (+ .cse1 1)) .cse0 .cse2) (and .cse0 (exists ((v_main_~i~0_19 Int) (main_~i~0 Int)) (and (<= main_~n~0 (+ (* 2 v_main_~i~0_19) 2)) (<= (* 2 main_~i~0) main_~j~0) (<= (+ v_main_~i~0_19 1) main_~i~0))) (<= main_~j~0 .cse1)) (and .cse0 (<= main_~j~0 (+ main_~i~0 1)) .cse2)))) [2018-10-22 10:18:10,508 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 29) no Hoare annotation was computed. [2018-10-22 10:18:10,508 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 34) no Hoare annotation was computed. [2018-10-22 10:18:10,508 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 34) the Hoare annotation is: true [2018-10-22 10:18:10,508 INFO L425 ceAbstractionStarter]: For program point L22-1(lines 22 24) no Hoare annotation was computed. [2018-10-22 10:18:10,508 INFO L421 ceAbstractionStarter]: At program point L22-3(lines 22 24) the Hoare annotation is: (let ((.cse0 (let ((.cse1 (* 2 main_~i~0))) (and (<= .cse1 main_~j~0) (<= .cse1 main_~k~0))))) (or (and .cse0 (<= main_~j~0 main_~i~0) (<= main_~k~0 main_~j~0)) (and .cse0 (<= (+ main_~j~0 1) main_~n~0) (<= main_~k~0 main_~n~0)))) [2018-10-22 10:18:10,508 INFO L425 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-10-22 10:18:10,508 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-10-22 10:18:10,521 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-10-22 10:18:10,521 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-10-22 10:18:10,522 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-10-22 10:18:10,522 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-10-22 10:18:10,522 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-10-22 10:18:10,527 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_19,QUANTIFIED] [2018-10-22 10:18:10,527 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-10-22 10:18:10,528 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_19,QUANTIFIED] [2018-10-22 10:18:10,528 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-10-22 10:18:10,533 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_19,QUANTIFIED] [2018-10-22 10:18:10,533 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-10-22 10:18:10,533 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_19,QUANTIFIED] [2018-10-22 10:18:10,534 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-10-22 10:18:10,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 10:18:10 BoogieIcfgContainer [2018-10-22 10:18:10,550 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-22 10:18:10,550 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-22 10:18:10,550 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-22 10:18:10,551 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-22 10:18:10,551 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 10:17:27" (3/4) ... [2018-10-22 10:18:10,556 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-22 10:18:10,562 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-22 10:18:10,562 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-22 10:18:10,562 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-10-22 10:18:10,568 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-10-22 10:18:10,568 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-10-22 10:18:10,568 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-22 10:18:10,568 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-22 10:18:10,593 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((2 * i <= j && n <= k) && k <= n) || ((k <= 2 * i + 1 && 2 * i <= j && n <= k) && k <= j)) || (((2 * i <= j && n <= k) && (\exists v_main_~i~0_19 : int, main_~i~0 : int :: (n <= 2 * v_main_~i~0_19 + 2 && 2 * main_~i~0 <= j) && v_main_~i~0_19 + 1 <= main_~i~0)) && j <= 2 * i)) || (((2 * i <= j && n <= k) && j <= i + 1) && k <= j) [2018-10-22 10:18:10,622 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/witness.graphml [2018-10-22 10:18:10,623 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-22 10:18:10,623 INFO L168 Benchmark]: Toolchain (without parser) took 44331.00 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 399.0 MB). Free memory was 953.2 MB in the beginning and 1.4 GB in the end (delta: -438.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-10-22 10:18:10,627 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-22 10:18:10,628 INFO L168 Benchmark]: CACSL2BoogieTranslator took 263.47 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-22 10:18:10,628 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.69 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-22 10:18:10,629 INFO L168 Benchmark]: Boogie Preprocessor took 35.76 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-22 10:18:10,630 INFO L168 Benchmark]: RCFGBuilder took 560.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -189.5 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2018-10-22 10:18:10,631 INFO L168 Benchmark]: TraceAbstraction took 43366.45 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 242.2 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -259.4 MB). Peak memory consumption was 548.9 MB. Max. memory is 11.5 GB. [2018-10-22 10:18:10,631 INFO L168 Benchmark]: Witness Printer took 72.40 ms. Allocated memory is still 1.4 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-22 10:18:10,637 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.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 263.47 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.69 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.76 ms. Allocated memory is still 1.0 GB. Free memory is still 942.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 560.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -189.5 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 43366.45 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 242.2 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -259.4 MB). Peak memory consumption was 548.9 MB. Max. memory is 11.5 GB. * Witness Printer took 72.40 ms. Allocated memory is still 1.4 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant [2018-10-22 10:18:10,655 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_19,QUANTIFIED] [2018-10-22 10:18:10,655 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-10-22 10:18:10,655 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_19,QUANTIFIED] [2018-10-22 10:18:10,655 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-10-22 10:18:10,660 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_19,QUANTIFIED] [2018-10-22 10:18:10,660 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-10-22 10:18:10,660 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~0_19,QUANTIFIED] [2018-10-22 10:18:10,661 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] Derived loop invariant: ((((2 * i <= j && n <= k) && k <= n) || ((k <= 2 * i + 1 && 2 * i <= j && n <= k) && k <= j)) || (((2 * i <= j && n <= k) && (\exists v_main_~i~0_19 : int, main_~i~0 : int :: (n <= 2 * v_main_~i~0_19 + 2 && 2 * main_~i~0 <= j) && v_main_~i~0_19 + 1 <= main_~i~0)) && j <= 2 * i)) || (((2 * i <= j && n <= k) && j <= i + 1) && k <= j) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((2 * i <= j && 2 * i <= k) && j <= i) && k <= j) || (((2 * i <= j && 2 * i <= k) && j + 1 <= n) && k <= n) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (((((((n <= k && n <= i + 999999) && 0 <= 2 * n + 4294967296) && k <= n) && i == 0) || ((k <= n && n <= k) && n <= j)) || ((k <= 2 * i + 1 && n <= k) && n <= j)) || ((j <= 2 * i && n <= k) && n <= j)) || ((j <= i && n <= k) && n <= j) - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 32 locations, 1 error locations. SAFE Result, 43.2s OverallTime, 9 OverallIterations, 11 TraceHistogramMax, 13.9s AutomataDifference, 0.0s DeadEndRemovalTime, 14.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 297 SDtfs, 743 SDslu, 1409 SDs, 0 SdLazy, 1580 SolverSat, 577 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 1303 GetRequests, 1043 SyntacticMatches, 36 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 2989 ImplicationChecksByTransitivity, 15.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=188occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.1s AbstIntTime, 6 AbstIntIterations, 3 AbstIntStrong, 0.929465375893947 AbsIntWeakeningRatio, 0.45054945054945056 AbsIntAvgWeakeningVarsNumRemoved, 7.417582417582418 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 231 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 173 PreInvPairs, 411 NumberOfFragments, 319 HoareAnnotationTreeSize, 173 FomulaSimplifications, 578696 FormulaSimplificationTreeSizeReduction, 2.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 303872 FormulaSimplificationTreeSizeReductionInter, 12.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 10.9s InterpolantComputationTime, 902 NumberOfCodeBlocks, 902 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1393 ConstructedInterpolants, 28 QuantifiedInterpolants, 282521 SizeOfPredicates, 41 NumberOfNonLiveVariables, 1022 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 25 InterpolantComputations, 2 PerfectInterpolantSequences, 2058/2470 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...