./Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/loop-invgen/large_const_true-unreach-call_true-termination.i --full-output --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/large_const_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 b03e1cb325e2c3a8ef30197a8e07012b3a728d97 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0210da8 [2018-10-21 12:36:46,979 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-21 12:36:46,981 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-21 12:36:46,994 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-21 12:36:46,994 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-21 12:36:46,995 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-21 12:36:46,997 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-21 12:36:46,999 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-21 12:36:47,000 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-21 12:36:47,002 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-21 12:36:47,002 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-21 12:36:47,003 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-21 12:36:47,004 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-21 12:36:47,005 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-21 12:36:47,006 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-21 12:36:47,008 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-21 12:36:47,008 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-21 12:36:47,010 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-21 12:36:47,013 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-21 12:36:47,014 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-21 12:36:47,016 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-21 12:36:47,017 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-21 12:36:47,020 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-21 12:36:47,020 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-21 12:36:47,020 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-21 12:36:47,021 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-21 12:36:47,022 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-21 12:36:47,024 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-21 12:36:47,024 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-21 12:36:47,026 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-21 12:36:47,026 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-21 12:36:47,027 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-21 12:36:47,027 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-21 12:36:47,027 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-21 12:36:47,028 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-21 12:36:47,030 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-21 12:36:47,030 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-21 12:36:47,045 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-21 12:36:47,046 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-21 12:36:47,047 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-21 12:36:47,047 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-21 12:36:47,047 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-21 12:36:47,048 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-21 12:36:47,048 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-21 12:36:47,048 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-21 12:36:47,048 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-21 12:36:47,048 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-21 12:36:47,048 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-21 12:36:47,050 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-21 12:36:47,050 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-21 12:36:47,050 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-21 12:36:47,050 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-21 12:36:47,051 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-21 12:36:47,051 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-21 12:36:47,051 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-21 12:36:47,051 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-21 12:36:47,051 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-21 12:36:47,052 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-21 12:36:47,053 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-21 12:36:47,053 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-21 12:36:47,053 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-21 12:36:47,053 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-21 12:36:47,053 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-21 12:36:47,053 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-21 12:36:47,054 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-21 12:36:47,055 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-21 12:36:47,055 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-21 12:36:47,055 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-21 12:36:47,055 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-21 12:36:47,055 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-21 12:36:47,055 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-21 12:36:47,056 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 -> b03e1cb325e2c3a8ef30197a8e07012b3a728d97 [2018-10-21 12:36:47,111 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-21 12:36:47,129 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-21 12:36:47,135 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-21 12:36:47,136 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-21 12:36:47,137 INFO L276 PluginConnector]: CDTParser initialized [2018-10-21 12:36:47,137 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-invgen/large_const_true-unreach-call_true-termination.i [2018-10-21 12:36:47,209 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1830da4b8/567199e27e894a25add9ad577e11b9f7/FLAG1de492dfc [2018-10-21 12:36:47,722 INFO L298 CDTParser]: Found 1 translation units. [2018-10-21 12:36:47,723 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/large_const_true-unreach-call_true-termination.i [2018-10-21 12:36:47,730 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1830da4b8/567199e27e894a25add9ad577e11b9f7/FLAG1de492dfc [2018-10-21 12:36:47,748 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/1830da4b8/567199e27e894a25add9ad577e11b9f7 [2018-10-21 12:36:47,753 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-21 12:36:47,755 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-21 12:36:47,756 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-21 12:36:47,756 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-21 12:36:47,760 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-21 12:36:47,761 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 12:36:47" (1/1) ... [2018-10-21 12:36:47,764 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@594b1b3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:36:47, skipping insertion in model container [2018-10-21 12:36:47,765 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 12:36:47" (1/1) ... [2018-10-21 12:36:47,776 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-21 12:36:47,800 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-21 12:36:48,009 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-21 12:36:48,015 INFO L189 MainTranslator]: Completed pre-run [2018-10-21 12:36:48,042 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-21 12:36:48,060 INFO L193 MainTranslator]: Completed translation [2018-10-21 12:36:48,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:36:48 WrapperNode [2018-10-21 12:36:48,061 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-21 12:36:48,062 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-21 12:36:48,062 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-21 12:36:48,062 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-21 12:36:48,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:36:48" (1/1) ... [2018-10-21 12:36:48,080 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:36:48" (1/1) ... [2018-10-21 12:36:48,086 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-21 12:36:48,087 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-21 12:36:48,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-21 12:36:48,087 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-21 12:36:48,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:36:48" (1/1) ... [2018-10-21 12:36:48,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:36:48" (1/1) ... [2018-10-21 12:36:48,098 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:36:48" (1/1) ... [2018-10-21 12:36:48,099 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:36:48" (1/1) ... [2018-10-21 12:36:48,104 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:36:48" (1/1) ... [2018-10-21 12:36:48,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:36:48" (1/1) ... [2018-10-21 12:36:48,115 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:36:48" (1/1) ... [2018-10-21 12:36:48,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-21 12:36:48,124 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-21 12:36:48,124 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-21 12:36:48,124 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-21 12:36:48,125 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:36:48" (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-21 12:36:48,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-21 12:36:48,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-21 12:36:48,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-21 12:36:48,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-21 12:36:48,281 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-21 12:36:48,281 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-21 12:36:48,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-21 12:36:48,282 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-21 12:36:48,728 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-21 12:36:48,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 12:36:48 BoogieIcfgContainer [2018-10-21 12:36:48,729 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-21 12:36:48,730 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-21 12:36:48,730 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-21 12:36:48,733 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-21 12:36:48,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 12:36:47" (1/3) ... [2018-10-21 12:36:48,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c7fe955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 12:36:48, skipping insertion in model container [2018-10-21 12:36:48,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 12:36:48" (2/3) ... [2018-10-21 12:36:48,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c7fe955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 12:36:48, skipping insertion in model container [2018-10-21 12:36:48,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 12:36:48" (3/3) ... [2018-10-21 12:36:48,736 INFO L112 eAbstractionObserver]: Analyzing ICFG large_const_true-unreach-call_true-termination.i [2018-10-21 12:36:48,746 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-21 12:36:48,756 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-21 12:36:48,771 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-21 12:36:48,806 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-21 12:36:48,806 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-21 12:36:48,807 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-21 12:36:48,807 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-21 12:36:48,807 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-21 12:36:48,807 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-21 12:36:48,807 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-21 12:36:48,807 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-21 12:36:48,808 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-21 12:36:48,827 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-10-21 12:36:48,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-21 12:36:48,833 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:36:48,834 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:36:48,836 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:36:48,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:36:48,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1169309281, now seen corresponding path program 1 times [2018-10-21 12:36:48,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:36:48,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:36:48,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:36:48,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:36:48,892 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:36:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:36:48,970 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-21 12:36:48,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-21 12:36:48,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-21 12:36:48,973 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:36:48,978 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-21 12:36:48,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-21 12:36:48,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-21 12:36:48,995 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-10-21 12:36:49,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:36:49,019 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2018-10-21 12:36:49,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-21 12:36:49,022 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-10-21 12:36:49,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:36:49,033 INFO L225 Difference]: With dead ends: 43 [2018-10-21 12:36:49,038 INFO L226 Difference]: Without dead ends: 22 [2018-10-21 12:36:49,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-21 12:36:49,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-21 12:36:49,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-21 12:36:49,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-21 12:36:49,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-10-21 12:36:49,085 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 14 [2018-10-21 12:36:49,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:36:49,085 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-10-21 12:36:49,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-21 12:36:49,086 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-10-21 12:36:49,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-21 12:36:49,087 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:36:49,087 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:36:49,087 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:36:49,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:36:49,089 INFO L82 PathProgramCache]: Analyzing trace with hash -659000362, now seen corresponding path program 1 times [2018-10-21 12:36:49,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:36:49,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:36:49,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:36:49,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:36:49,091 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:36:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:36:49,195 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-21 12:36:49,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-21 12:36:49,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-21 12:36:49,195 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:36:49,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-21 12:36:49,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-21 12:36:49,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-21 12:36:49,198 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 5 states. [2018-10-21 12:36:49,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:36:49,337 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-10-21 12:36:49,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-21 12:36:49,337 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-10-21 12:36:49,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:36:49,339 INFO L225 Difference]: With dead ends: 37 [2018-10-21 12:36:49,339 INFO L226 Difference]: Without dead ends: 24 [2018-10-21 12:36:49,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-21 12:36:49,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-21 12:36:49,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-10-21 12:36:49,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-21 12:36:49,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-10-21 12:36:49,347 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 15 [2018-10-21 12:36:49,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:36:49,347 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-10-21 12:36:49,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-21 12:36:49,348 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-10-21 12:36:49,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-21 12:36:49,348 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:36:49,349 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:36:49,349 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:36:49,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:36:49,349 INFO L82 PathProgramCache]: Analyzing trace with hash 701537581, now seen corresponding path program 1 times [2018-10-21 12:36:49,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:36:49,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:36:49,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:36:49,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:36:49,351 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:36:49,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:36:49,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:36:49,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:36:49,603 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:36:49,604 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-10-21 12:36:49,606 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [18], [22], [25], [37], [41], [47], [55], [58], [60], [66], [67], [68], [70] [2018-10-21 12:36:49,671 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-21 12:36:49,672 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-21 12:36:49,956 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-21 12:36:49,958 INFO L272 AbstractInterpreter]: Visited 17 different actions 23 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 17 variables. [2018-10-21 12:36:49,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:36:49,975 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-21 12:36:50,174 INFO L232 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 73.33% of their original sizes. [2018-10-21 12:36:50,175 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-21 12:36:51,149 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-21 12:36:51,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-21 12:36:51,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [7] total 17 [2018-10-21 12:36:51,151 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:36:51,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-21 12:36:51,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-21 12:36:51,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-10-21 12:36:51,153 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 12 states. [2018-10-21 12:36:52,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:36:52,898 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2018-10-21 12:36:52,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-21 12:36:52,899 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-10-21 12:36:52,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:36:52,901 INFO L225 Difference]: With dead ends: 54 [2018-10-21 12:36:52,901 INFO L226 Difference]: Without dead ends: 38 [2018-10-21 12:36:52,902 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-10-21 12:36:52,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-21 12:36:52,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-10-21 12:36:52,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-21 12:36:52,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-10-21 12:36:52,916 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 19 [2018-10-21 12:36:52,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:36:52,917 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-10-21 12:36:52,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-21 12:36:52,917 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-10-21 12:36:52,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-21 12:36:52,919 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:36:52,919 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:36:52,920 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:36:52,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:36:52,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1708424439, now seen corresponding path program 1 times [2018-10-21 12:36:52,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:36:52,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:36:52,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:36:52,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:36:52,923 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:36:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:36:53,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:36:53,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:36:53,362 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:36:53,363 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-10-21 12:36:53,363 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [18], [22], [27], [32], [37], [41], [47], [55], [58], [60], [66], [67], [68], [70] [2018-10-21 12:36:53,365 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-21 12:36:53,365 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-21 12:36:53,403 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-21 12:36:53,403 INFO L272 AbstractInterpreter]: Visited 18 different actions 24 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 17 variables. [2018-10-21 12:36:53,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:36:53,413 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-21 12:36:53,478 INFO L232 lantSequenceWeakener]: Weakened 13 states. On average, predicates are now at 72.43% of their original sizes. [2018-10-21 12:36:53,478 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-21 12:36:54,011 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-21 12:36:54,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-21 12:36:54,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 18 [2018-10-21 12:36:54,012 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:36:54,013 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-21 12:36:54,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-21 12:36:54,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-10-21 12:36:54,014 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 13 states. [2018-10-21 12:36:55,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:36:55,376 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2018-10-21 12:36:55,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-21 12:36:55,377 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-10-21 12:36:55,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:36:55,380 INFO L225 Difference]: With dead ends: 64 [2018-10-21 12:36:55,380 INFO L226 Difference]: Without dead ends: 48 [2018-10-21 12:36:55,381 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-10-21 12:36:55,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-21 12:36:55,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2018-10-21 12:36:55,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-21 12:36:55,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-10-21 12:36:55,395 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 20 [2018-10-21 12:36:55,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:36:55,396 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-10-21 12:36:55,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-21 12:36:55,396 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-10-21 12:36:55,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-21 12:36:55,397 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:36:55,397 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:36:55,397 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:36:55,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:36:55,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1315397429, now seen corresponding path program 1 times [2018-10-21 12:36:55,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:36:55,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:36:55,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:36:55,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:36:55,399 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:36:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:36:55,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:36:55,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-21 12:36:55,510 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-21 12:36:55,510 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-10-21 12:36:55,510 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [12], [16], [18], [22], [27], [30], [37], [41], [47], [55], [58], [60], [66], [67], [68], [70] [2018-10-21 12:36:55,512 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-21 12:36:55,512 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-21 12:36:55,538 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-21 12:36:55,538 INFO L272 AbstractInterpreter]: Visited 18 different actions 24 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 17 variables. [2018-10-21 12:36:55,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:36:55,550 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-21 12:36:55,605 INFO L232 lantSequenceWeakener]: Weakened 13 states. On average, predicates are now at 72.43% of their original sizes. [2018-10-21 12:36:55,606 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-21 12:36:56,133 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-21 12:36:56,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-21 12:36:56,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [7] total 18 [2018-10-21 12:36:56,134 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:36:56,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-21 12:36:56,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-21 12:36:56,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-10-21 12:36:56,136 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 13 states. [2018-10-21 12:36:57,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:36:57,144 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-10-21 12:36:57,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-21 12:36:57,145 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-10-21 12:36:57,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:36:57,146 INFO L225 Difference]: With dead ends: 58 [2018-10-21 12:36:57,146 INFO L226 Difference]: Without dead ends: 42 [2018-10-21 12:36:57,147 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-10-21 12:36:57,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-21 12:36:57,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2018-10-21 12:36:57,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-21 12:36:57,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-10-21 12:36:57,159 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 20 [2018-10-21 12:36:57,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:36:57,159 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-10-21 12:36:57,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-21 12:36:57,159 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-10-21 12:36:57,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-21 12:36:57,160 INFO L367 BasicCegarLoop]: Found error trace [2018-10-21 12:36:57,160 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-21 12:36:57,161 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-21 12:36:57,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-21 12:36:57,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1155724272, now seen corresponding path program 1 times [2018-10-21 12:36:57,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-21 12:36:57,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:36:57,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-21 12:36:57,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-21 12:36:57,162 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-21 12:36:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-21 12:36:57,385 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-21 12:36:57,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-21 12:36:57,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-21 12:36:57,385 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-21 12:36:57,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-21 12:36:57,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-21 12:36:57,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-21 12:36:57,388 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 5 states. [2018-10-21 12:36:57,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-21 12:36:57,463 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-10-21 12:36:57,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-21 12:36:57,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-10-21 12:36:57,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-21 12:36:57,465 INFO L225 Difference]: With dead ends: 34 [2018-10-21 12:36:57,465 INFO L226 Difference]: Without dead ends: 0 [2018-10-21 12:36:57,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-21 12:36:57,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-21 12:36:57,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-21 12:36:57,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-21 12:36:57,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-21 12:36:57,466 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-10-21 12:36:57,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-21 12:36:57,467 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-21 12:36:57,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-21 12:36:57,467 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-21 12:36:57,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-21 12:36:57,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-21 12:36:57,720 WARN L179 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 310 DAG size of output: 310 [2018-10-21 12:36:57,867 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 315 DAG size of output: 315 [2018-10-21 12:36:57,988 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 278 DAG size of output: 278 [2018-10-21 12:36:59,615 WARN L179 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 310 DAG size of output: 55 [2018-10-21 12:37:00,515 WARN L179 SmtUtils]: Spent 895.00 ms on a formula simplification. DAG size of input: 315 DAG size of output: 63 [2018-10-21 12:37:01,692 WARN L179 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 278 DAG size of output: 61 [2018-10-21 12:37:01,698 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-21 12:37:01,698 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-21 12:37:01,698 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-21 12:37:01,698 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-21 12:37:01,698 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-21 12:37:01,698 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-21 12:37:01,699 INFO L421 ceAbstractionStarter]: At program point L33(line 33) the Hoare annotation is: (and (let ((.cse1 (= main_~c1~0 4000)) (.cse0 (<= main_~n~0 main_~i~0)) (.cse2 (= main_~c3~0 10000))) (or (and (and (<= main_~c2~0 main_~k~0) (<= (+ main_~i~0 1999) main_~k~0) .cse0 (<= 4000 (* 2 main_~c2~0))) (and (<= main_~k~0 (+ main_~n~0 1999)) (= main_~j~0 0)) .cse1 .cse2) (and (let ((.cse3 (+ main_~j~0 main_~k~0))) (or (and (<= .cse3 10000) .cse1 (and (<= main_~i~0 main_~n~0) (<= main_~k~0 (+ main_~i~0 9999)) .cse2) (= main_~k~0 10000)) (and (<= .cse3 4000) (<= 8000 (* 2 main_~k~0)) (and (<= (+ main_~c1~0 main_~i~0) 4001) .cse1 (<= 4001 (+ main_~c1~0 main_~n~0)) .cse0) .cse2))) (= main_~c2~0 2000)))) (<= main_~n~0 (+ main_~j~0 1))) [2018-10-21 12:37:01,699 INFO L425 ceAbstractionStarter]: For program point L33-1(line 33) no Hoare annotation was computed. [2018-10-21 12:37:01,699 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 38) no Hoare annotation was computed. [2018-10-21 12:37:01,699 INFO L425 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2018-10-21 12:37:01,699 INFO L425 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-10-21 12:37:01,700 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 38) no Hoare annotation was computed. [2018-10-21 12:37:01,700 INFO L425 ceAbstractionStarter]: For program point L32-1(lines 32 36) no Hoare annotation was computed. [2018-10-21 12:37:01,700 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 38) the Hoare annotation is: true [2018-10-21 12:37:01,700 INFO L421 ceAbstractionStarter]: At program point L32-3(lines 32 36) the Hoare annotation is: (let ((.cse8 (* 2 main_~c2~0))) (let ((.cse3 (= main_~c1~0 4000)) (.cse7 (<= main_~n~0 1)) (.cse4 (<= 0 (+ main_~c1~0 main_~n~0 2147479648))) (.cse2 (<= 4000 .cse8)) (.cse5 (= main_~c3~0 10000)) (.cse0 (<= main_~n~0 main_~j~0))) (or (and (<= main_~n~0 0) (<= main_~i~0 0) .cse0) (and (let ((.cse1 (<= main_~n~0 main_~i~0))) (or (and (and (<= main_~c2~0 main_~k~0) (<= (+ main_~i~0 1999) main_~k~0) .cse1 .cse2) (<= main_~k~0 (+ main_~j~0 2000)) .cse3 .cse4 (= main_~k~0 2000) .cse5) (and (or (and .cse3 (and (<= main_~i~0 main_~n~0) (<= main_~k~0 (+ main_~i~0 9999)) .cse5) (= main_~k~0 10000)) (let ((.cse6 (* 2 main_~k~0))) (and (<= 8000 .cse6) (and (<= (+ main_~c1~0 main_~i~0) 4001) .cse3 (<= 4001 (+ main_~c1~0 main_~n~0)) .cse1) (<= .cse6 8000) .cse5))) (= main_~c2~0 2000)))) .cse7 (<= main_~n~0 (+ main_~j~0 1))) (and (<= .cse8 4000) .cse3 .cse7 .cse4 .cse2 .cse5 .cse0)))) [2018-10-21 12:37:01,700 INFO L425 ceAbstractionStarter]: For program point L32-4(lines 32 36) no Hoare annotation was computed. [2018-10-21 12:37:01,700 INFO L425 ceAbstractionStarter]: For program point L26(lines 26 29) no Hoare annotation was computed. [2018-10-21 12:37:01,701 INFO L425 ceAbstractionStarter]: For program point L24(lines 24 29) no Hoare annotation was computed. [2018-10-21 12:37:01,705 INFO L421 ceAbstractionStarter]: At program point L26-2(lines 20 30) the Hoare annotation is: (let ((.cse1 (<= main_~n~0 main_~i~0)) (.cse3 (= main_~c1~0 4000)) (.cse2 (= main_~c3~0 10000))) (or (and (or (and (let ((.cse0 (+ main_~i~0 9999))) (and (<= main_~i~0 main_~n~0) (<= main_~k~0 .cse0) (= main_~k~0 10000) .cse1 (<= .cse0 main_~c3~0) .cse2)) .cse3) (and (and (<= (+ main_~c1~0 main_~i~0) 4001) .cse3 (<= (+ main_~n~0 3999) main_~k~0) (<= 4001 (+ main_~c1~0 main_~n~0)) .cse1 (<= (* 2 main_~k~0) 8000)) .cse2)) (= main_~c2~0 2000)) (and (or (and (<= (* 2 main_~c2~0) 4000) (<= (+ main_~k~0 2000) main_~c2~0) (<= (+ main_~n~0 1991) main_~c2~0) (<= main_~i~0 main_~k~0) (<= main_~k~0 main_~n~0) (= main_~i~0 0)) (and (<= 2001 (+ main_~c2~0 main_~n~0)) (<= main_~c2~0 main_~k~0) (= main_~k~0 2000) (<= (+ main_~i~0 1999) main_~k~0) .cse1)) .cse3 .cse2))) [2018-10-21 12:37:01,705 INFO L425 ceAbstractionStarter]: For program point L20-1(lines 20 30) no Hoare annotation was computed. [2018-10-21 12:37:01,705 INFO L425 ceAbstractionStarter]: For program point L20-3(lines 20 30) no Hoare annotation was computed. [2018-10-21 12:37:01,705 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-10-21 12:37:01,705 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-10-21 12:37:01,705 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-10-21 12:37:01,705 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-10-21 12:37:01,705 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-10-21 12:37:01,706 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-10-21 12:37:01,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 12:37:01 BoogieIcfgContainer [2018-10-21 12:37:01,723 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-21 12:37:01,724 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-21 12:37:01,724 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-21 12:37:01,724 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-21 12:37:01,724 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 12:36:48" (3/4) ... [2018-10-21 12:37:01,730 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-21 12:37:01,737 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-21 12:37:01,738 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-21 12:37:01,738 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-10-21 12:37:01,744 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-10-21 12:37:01,744 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-10-21 12:37:01,744 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-21 12:37:01,801 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/witness.graphml [2018-10-21 12:37:01,801 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-21 12:37:01,802 INFO L168 Benchmark]: Toolchain (without parser) took 14048.57 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 309.3 MB). Free memory was 950.5 MB in the beginning and 893.9 MB in the end (delta: 56.6 MB). Peak memory consumption was 366.0 MB. Max. memory is 11.5 GB. [2018-10-21 12:37:01,804 INFO L168 Benchmark]: CDTParser took 0.18 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-21 12:37:01,804 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.68 ms. Allocated memory is still 1.0 GB. Free memory was 950.5 MB in the beginning and 939.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-21 12:37:01,805 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.78 ms. Allocated memory is still 1.0 GB. Free memory is still 939.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-21 12:37:01,806 INFO L168 Benchmark]: Boogie Preprocessor took 36.90 ms. Allocated memory is still 1.0 GB. Free memory is still 939.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-21 12:37:01,806 INFO L168 Benchmark]: RCFGBuilder took 604.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -174.9 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2018-10-21 12:37:01,808 INFO L168 Benchmark]: TraceAbstraction took 12993.54 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 164.6 MB). Free memory was 1.1 GB in the beginning and 893.9 MB in the end (delta: 220.8 MB). Peak memory consumption was 392.6 MB. Max. memory is 11.5 GB. [2018-10-21 12:37:01,809 INFO L168 Benchmark]: Witness Printer took 77.73 ms. Allocated memory is still 1.3 GB. Free memory is still 893.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-21 12:37:01,813 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.18 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 305.68 ms. Allocated memory is still 1.0 GB. Free memory was 950.5 MB in the beginning and 939.8 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.78 ms. Allocated memory is still 1.0 GB. Free memory is still 939.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.90 ms. Allocated memory is still 1.0 GB. Free memory is still 939.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 604.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -174.9 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12993.54 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 164.6 MB). Free memory was 1.1 GB in the beginning and 893.9 MB in the end (delta: 220.8 MB). Peak memory consumption was 392.6 MB. Max. memory is 11.5 GB. * Witness Printer took 77.73 ms. Allocated memory is still 1.3 GB. Free memory is still 893.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * 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: 32]: Loop Invariant Derived loop invariant: (((n <= 0 && i <= 0) && n <= j) || (((((((((((c2 <= k && i + 1999 <= k) && n <= i) && 4000 <= 2 * c2) && k <= j + 2000) && c1 == 4000) && 0 <= c1 + n + 2147479648) && k == 2000) && c3 == 10000) || ((((c1 == 4000 && (i <= n && k <= i + 9999) && c3 == 10000) && k == 10000) || (((8000 <= 2 * k && ((c1 + i <= 4001 && c1 == 4000) && 4001 <= c1 + n) && n <= i) && 2 * k <= 8000) && c3 == 10000)) && c2 == 2000)) && n <= 1) && n <= j + 1)) || ((((((2 * c2 <= 4000 && c1 == 4000) && n <= 1) && 0 <= c1 + n + 2147479648) && 4000 <= 2 * c2) && c3 == 10000) && n <= j) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((((((i <= n && k <= i + 9999) && k == 10000) && n <= i) && i + 9999 <= c3) && c3 == 10000) && c1 == 4000) || ((((((c1 + i <= 4001 && c1 == 4000) && n + 3999 <= k) && 4001 <= c1 + n) && n <= i) && 2 * k <= 8000) && c3 == 10000)) && c2 == 2000) || ((((((((2 * c2 <= 4000 && k + 2000 <= c2) && n + 1991 <= c2) && i <= k) && k <= n) && i == 0) || ((((2001 <= c2 + n && c2 <= k) && k == 2000) && i + 1999 <= k) && n <= i)) && c1 == 4000) && c3 == 10000) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. SAFE Result, 12.9s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 4.4s AutomataDifference, 0.0s DeadEndRemovalTime, 4.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 133 SDtfs, 120 SDslu, 384 SDs, 0 SdLazy, 139 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 81 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 3 AbstIntIterations, 3 AbstIntStrong, 0.8660714285714285 AbsIntWeakeningRatio, 1.125 AbsIntAvgWeakeningVarsNumRemoved, 17.482142857142858 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 24 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 14 PreInvPairs, 20 NumberOfFragments, 365 HoareAnnotationTreeSize, 14 FomulaSimplifications, 268 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 8 FomulaSimplificationsInter, 5657 FormulaSimplificationTreeSizeReductionInter, 3.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 115 NumberOfCodeBlocks, 115 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 109 ConstructedInterpolants, 0 QuantifiedInterpolants, 5011 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 7/13 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...