./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loops/sum04_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/loops/sum04_true-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1dbb3ffac91b20f4dd3e7b4eb671e84b2870fc33 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 18:17:56,468 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 18:17:56,470 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 18:17:56,488 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 18:17:56,488 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 18:17:56,489 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 18:17:56,493 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 18:17:56,506 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 18:17:56,508 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 18:17:56,509 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 18:17:56,513 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 18:17:56,514 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 18:17:56,515 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 18:17:56,516 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 18:17:56,526 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 18:17:56,527 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 18:17:56,528 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 18:17:56,532 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 18:17:56,537 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 18:17:56,539 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 18:17:56,540 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 18:17:56,542 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 18:17:56,548 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 18:17:56,548 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 18:17:56,548 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 18:17:56,549 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 18:17:56,552 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 18:17:56,553 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 18:17:56,554 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 18:17:56,555 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 18:17:56,555 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 18:17:56,559 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 18:17:56,560 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 18:17:56,560 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 18:17:56,561 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 18:17:56,561 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 18:17:56,562 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 18:17:56,577 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 18:17:56,577 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 18:17:56,578 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 18:17:56,578 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 18:17:56,578 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 18:17:56,579 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 18:17:56,579 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 18:17:56,579 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 18:17:56,579 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 18:17:56,579 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 18:17:56,579 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 18:17:56,580 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 18:17:56,580 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 18:17:56,580 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 18:17:56,580 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 18:17:56,580 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 18:17:56,580 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 18:17:56,581 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 18:17:56,581 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 18:17:56,581 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 18:17:56,581 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 18:17:56,581 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 18:17:56,582 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 18:17:56,582 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:17:56,582 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 18:17:56,582 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 18:17:56,582 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 18:17:56,582 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 18:17:56,583 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 18:17:56,583 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 18:17:56,583 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1dbb3ffac91b20f4dd3e7b4eb671e84b2870fc33 [2018-11-28 18:17:56,618 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 18:17:56,632 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 18:17:56,638 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 18:17:56,640 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 18:17:56,640 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 18:17:56,641 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/sum04_true-unreach-call_true-termination.i [2018-11-28 18:17:56,703 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ca3baabd/5da2897921364fc491dcdac4273140a3/FLAGcc5ec348b [2018-11-28 18:17:57,141 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 18:17:57,142 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/sum04_true-unreach-call_true-termination.i [2018-11-28 18:17:57,147 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ca3baabd/5da2897921364fc491dcdac4273140a3/FLAGcc5ec348b [2018-11-28 18:17:57,529 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ca3baabd/5da2897921364fc491dcdac4273140a3 [2018-11-28 18:17:57,532 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 18:17:57,533 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 18:17:57,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 18:17:57,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 18:17:57,538 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 18:17:57,539 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:17:57" (1/1) ... [2018-11-28 18:17:57,542 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3926fb05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:17:57, skipping insertion in model container [2018-11-28 18:17:57,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:17:57" (1/1) ... [2018-11-28 18:17:57,551 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 18:17:57,572 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 18:17:57,774 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:17:57,779 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 18:17:57,795 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:17:57,812 INFO L195 MainTranslator]: Completed translation [2018-11-28 18:17:57,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:17:57 WrapperNode [2018-11-28 18:17:57,813 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 18:17:57,814 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 18:17:57,814 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 18:17:57,815 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 18:17:57,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:17:57" (1/1) ... [2018-11-28 18:17:57,831 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:17:57" (1/1) ... [2018-11-28 18:17:57,839 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 18:17:57,839 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 18:17:57,839 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 18:17:57,840 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 18:17:57,849 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:17:57" (1/1) ... [2018-11-28 18:17:57,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:17:57" (1/1) ... [2018-11-28 18:17:57,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:17:57" (1/1) ... [2018-11-28 18:17:57,850 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:17:57" (1/1) ... [2018-11-28 18:17:57,854 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:17:57" (1/1) ... [2018-11-28 18:17:57,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:17:57" (1/1) ... [2018-11-28 18:17:57,859 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:17:57" (1/1) ... [2018-11-28 18:17:57,861 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 18:17:57,861 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 18:17:57,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 18:17:57,862 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 18:17:57,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:17:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:17:57,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 18:17:57,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 18:17:57,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 18:17:57,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 18:17:57,993 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 18:17:57,993 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 18:17:57,993 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-28 18:17:57,993 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-28 18:17:58,185 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 18:17:58,185 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 18:17:58,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:17:58 BoogieIcfgContainer [2018-11-28 18:17:58,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 18:17:58,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 18:17:58,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 18:17:58,190 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 18:17:58,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:17:57" (1/3) ... [2018-11-28 18:17:58,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c46f3ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:17:58, skipping insertion in model container [2018-11-28 18:17:58,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:17:57" (2/3) ... [2018-11-28 18:17:58,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c46f3ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:17:58, skipping insertion in model container [2018-11-28 18:17:58,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:17:58" (3/3) ... [2018-11-28 18:17:58,194 INFO L112 eAbstractionObserver]: Analyzing ICFG sum04_true-unreach-call_true-termination.i [2018-11-28 18:17:58,204 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 18:17:58,211 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 18:17:58,226 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 18:17:58,260 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 18:17:58,261 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 18:17:58,261 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 18:17:58,261 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 18:17:58,261 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 18:17:58,261 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 18:17:58,261 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 18:17:58,262 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 18:17:58,262 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 18:17:58,283 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-28 18:17:58,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 18:17:58,289 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:17:58,290 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:17:58,292 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:17:58,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:17:58,303 INFO L82 PathProgramCache]: Analyzing trace with hash -10373566, now seen corresponding path program 1 times [2018-11-28 18:17:58,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:17:58,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:17:58,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:17:58,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:17:58,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:17:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:17:58,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:17:58,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:17:58,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 18:17:58,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 18:17:58,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 18:17:58,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 18:17:58,436 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-28 18:17:58,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:17:58,458 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-28 18:17:58,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 18:17:58,459 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-28 18:17:58,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:17:58,468 INFO L225 Difference]: With dead ends: 29 [2018-11-28 18:17:58,468 INFO L226 Difference]: Without dead ends: 12 [2018-11-28 18:17:58,472 INFO L631 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-11-28 18:17:58,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-28 18:17:58,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-28 18:17:58,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-28 18:17:58,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-28 18:17:58,512 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-28 18:17:58,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:17:58,512 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-28 18:17:58,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 18:17:58,512 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-28 18:17:58,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 18:17:58,513 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:17:58,513 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:17:58,514 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:17:58,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:17:58,514 INFO L82 PathProgramCache]: Analyzing trace with hash -15914692, now seen corresponding path program 1 times [2018-11-28 18:17:58,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:17:58,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:17:58,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:17:58,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:17:58,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:17:58,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:17:58,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:17:58,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:17:58,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 18:17:58,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 18:17:58,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 18:17:58,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:17:58,582 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2018-11-28 18:17:58,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:17:58,661 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-28 18:17:58,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 18:17:58,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 18:17:58,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:17:58,663 INFO L225 Difference]: With dead ends: 19 [2018-11-28 18:17:58,663 INFO L226 Difference]: Without dead ends: 14 [2018-11-28 18:17:58,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:17:58,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-28 18:17:58,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-11-28 18:17:58,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-28 18:17:58,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-28 18:17:58,670 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-11-28 18:17:58,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:17:58,672 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-28 18:17:58,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 18:17:58,672 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-28 18:17:58,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-28 18:17:58,673 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:17:58,673 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:17:58,673 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:17:58,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:17:58,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1244203718, now seen corresponding path program 1 times [2018-11-28 18:17:58,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:17:58,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:17:58,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:17:58,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:17:58,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:17:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:17:58,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:17:58,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:17:58,765 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:17:58,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:17:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:17:58,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:17:58,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:17:58,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:17:58,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-28 18:17:58,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 18:17:58,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 18:17:58,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 18:17:58,866 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 4 states. [2018-11-28 18:17:58,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:17:58,964 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-28 18:17:58,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 18:17:58,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-28 18:17:58,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:17:58,966 INFO L225 Difference]: With dead ends: 21 [2018-11-28 18:17:58,966 INFO L226 Difference]: Without dead ends: 16 [2018-11-28 18:17:58,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 18:17:58,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-28 18:17:58,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-28 18:17:58,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 18:17:58,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-28 18:17:58,971 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-11-28 18:17:58,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:17:58,971 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-28 18:17:58,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 18:17:58,972 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-28 18:17:58,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 18:17:58,972 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:17:58,972 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:17:58,973 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:17:58,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:17:58,973 INFO L82 PathProgramCache]: Analyzing trace with hash -513951304, now seen corresponding path program 2 times [2018-11-28 18:17:58,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:17:58,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:17:58,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:17:58,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:17:58,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:17:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:17:59,095 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:17:59,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:17:59,096 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:17:59,119 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 18:17:59,149 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 18:17:59,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:17:59,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:17:59,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:17:59,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:17:59,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-28 18:17:59,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:17:59,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:17:59,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:17:59,179 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2018-11-28 18:17:59,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:17:59,254 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-28 18:17:59,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:17:59,255 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-28 18:17:59,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:17:59,256 INFO L225 Difference]: With dead ends: 23 [2018-11-28 18:17:59,256 INFO L226 Difference]: Without dead ends: 18 [2018-11-28 18:17:59,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:17:59,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-28 18:17:59,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-28 18:17:59,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-28 18:17:59,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-28 18:17:59,261 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-11-28 18:17:59,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:17:59,262 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-28 18:17:59,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:17:59,262 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-28 18:17:59,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-28 18:17:59,263 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:17:59,263 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:17:59,263 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:17:59,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:17:59,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1178949302, now seen corresponding path program 3 times [2018-11-28 18:17:59,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:17:59,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:17:59,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:17:59,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:17:59,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:17:59,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:17:59,442 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:17:59,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:17:59,443 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:17:59,461 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 18:17:59,505 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 18:17:59,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:17:59,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:17:59,514 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:17:59,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:17:59,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-28 18:17:59,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 18:17:59,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 18:17:59,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:17:59,536 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 6 states. [2018-11-28 18:17:59,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:17:59,701 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-28 18:17:59,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 18:17:59,702 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-28 18:17:59,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:17:59,703 INFO L225 Difference]: With dead ends: 25 [2018-11-28 18:17:59,703 INFO L226 Difference]: Without dead ends: 20 [2018-11-28 18:17:59,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:17:59,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-28 18:17:59,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-11-28 18:17:59,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-28 18:17:59,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-11-28 18:17:59,709 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-11-28 18:17:59,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:17:59,709 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-11-28 18:17:59,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 18:17:59,709 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-28 18:17:59,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 18:17:59,710 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:17:59,710 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:17:59,710 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:17:59,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:17:59,711 INFO L82 PathProgramCache]: Analyzing trace with hash 263826484, now seen corresponding path program 4 times [2018-11-28 18:17:59,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:17:59,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:17:59,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:17:59,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:17:59,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:17:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:17:59,850 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:17:59,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:17:59,850 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:17:59,872 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 18:17:59,888 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 18:17:59,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:17:59,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:17:59,899 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:17:59,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:17:59,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-28 18:17:59,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 18:17:59,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 18:17:59,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-28 18:17:59,921 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 7 states. [2018-11-28 18:17:59,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:17:59,989 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-28 18:17:59,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 18:17:59,991 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-28 18:17:59,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:17:59,992 INFO L225 Difference]: With dead ends: 27 [2018-11-28 18:17:59,993 INFO L226 Difference]: Without dead ends: 22 [2018-11-28 18:17:59,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-28 18:17:59,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-28 18:17:59,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-28 18:17:59,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 18:17:59,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-28 18:17:59,998 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-11-28 18:17:59,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:17:59,999 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-28 18:17:59,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 18:17:59,999 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-28 18:17:59,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 18:18:00,000 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:18:00,000 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:18:00,000 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:18:00,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:18:00,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1299094066, now seen corresponding path program 5 times [2018-11-28 18:18:00,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:18:00,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:18:00,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:18:00,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:18:00,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:18:00,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:18:00,135 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:18:00,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:18:00,136 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-28 18:18:00,154 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 18:18:00,217 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-28 18:18:00,217 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:18:00,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:18:00,229 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:18:00,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:18:00,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-28 18:18:00,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 18:18:00,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 18:18:00,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-28 18:18:00,255 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 8 states. [2018-11-28 18:18:00,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:18:00,315 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-28 18:18:00,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 18:18:00,317 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-28 18:18:00,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:18:00,318 INFO L225 Difference]: With dead ends: 29 [2018-11-28 18:18:00,318 INFO L226 Difference]: Without dead ends: 24 [2018-11-28 18:18:00,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-28 18:18:00,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-28 18:18:00,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-28 18:18:00,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-28 18:18:00,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-11-28 18:18:00,324 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-11-28 18:18:00,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:18:00,324 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-11-28 18:18:00,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 18:18:00,325 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-28 18:18:00,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 18:18:00,325 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:18:00,326 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:18:00,326 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:18:00,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:18:00,326 INFO L82 PathProgramCache]: Analyzing trace with hash -241172304, now seen corresponding path program 6 times [2018-11-28 18:18:00,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:18:00,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:18:00,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:18:00,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:18:00,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:18:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:18:00,455 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:18:00,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:18:00,456 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:18:00,476 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-28 18:18:00,490 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-28 18:18:00,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:18:00,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:18:00,503 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:18:00,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:18:00,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-28 18:18:00,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 18:18:00,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 18:18:00,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-28 18:18:00,531 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 9 states. [2018-11-28 18:18:00,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:18:00,668 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-28 18:18:00,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 18:18:00,669 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-28 18:18:00,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:18:00,670 INFO L225 Difference]: With dead ends: 31 [2018-11-28 18:18:00,670 INFO L226 Difference]: Without dead ends: 26 [2018-11-28 18:18:00,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-28 18:18:00,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-28 18:18:00,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-28 18:18:00,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-28 18:18:00,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-11-28 18:18:00,675 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-11-28 18:18:00,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:18:00,676 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-11-28 18:18:00,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 18:18:00,676 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-28 18:18:00,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 18:18:00,677 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:18:00,677 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:18:00,677 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:18:00,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:18:00,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1326563246, now seen corresponding path program 7 times [2018-11-28 18:18:00,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:18:00,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:18:00,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:18:00,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:18:00,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:18:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:18:00,990 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:18:00,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:18:00,991 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-28 18:18:01,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:18:01,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:18:01,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:18:01,029 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:18:01,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:18:01,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-28 18:18:01,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 18:18:01,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 18:18:01,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-28 18:18:01,050 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 10 states. [2018-11-28 18:18:01,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:18:01,099 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-28 18:18:01,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 18:18:01,101 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-11-28 18:18:01,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:18:01,101 INFO L225 Difference]: With dead ends: 32 [2018-11-28 18:18:01,102 INFO L226 Difference]: Without dead ends: 27 [2018-11-28 18:18:01,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-28 18:18:01,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-28 18:18:01,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-28 18:18:01,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 18:18:01,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-28 18:18:01,107 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-11-28 18:18:01,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:18:01,107 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-28 18:18:01,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 18:18:01,107 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-28 18:18:01,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 18:18:01,108 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:18:01,108 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:18:01,109 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:18:01,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:18:01,109 INFO L82 PathProgramCache]: Analyzing trace with hash 386905900, now seen corresponding path program 8 times [2018-11-28 18:18:01,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:18:01,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:18:01,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:18:01,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:18:01,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:18:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:18:01,666 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:18:01,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:18:01,666 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:18:01,678 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 18:18:01,707 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 18:18:01,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 18:18:01,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:18:01,814 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:18:01,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:18:01,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-11-28 18:18:01,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 18:18:01,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 18:18:01,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-28 18:18:01,844 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 13 states. [2018-11-28 18:18:02,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:18:02,073 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-28 18:18:02,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 18:18:02,074 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2018-11-28 18:18:02,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:18:02,076 INFO L225 Difference]: With dead ends: 34 [2018-11-28 18:18:02,076 INFO L226 Difference]: Without dead ends: 29 [2018-11-28 18:18:02,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-11-28 18:18:02,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-28 18:18:02,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-28 18:18:02,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-28 18:18:02,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-11-28 18:18:02,082 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-11-28 18:18:02,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:18:02,083 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-11-28 18:18:02,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 18:18:02,083 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-28 18:18:02,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 18:18:02,084 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:18:02,084 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:18:02,084 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:18:02,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:18:02,085 INFO L82 PathProgramCache]: Analyzing trace with hash -680671446, now seen corresponding path program 9 times [2018-11-28 18:18:02,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:18:02,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:18:02,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:18:02,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 18:18:02,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:18:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:18:02,296 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:18:02,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:18:02,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 18:18:02,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 18:18:02,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 18:18:02,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-28 18:18:02,298 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 11 states. [2018-11-28 18:18:02,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:18:02,501 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-28 18:18:02,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 18:18:02,503 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-11-28 18:18:02,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:18:02,503 INFO L225 Difference]: With dead ends: 29 [2018-11-28 18:18:02,504 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 18:18:02,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-28 18:18:02,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 18:18:02,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 18:18:02,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 18:18:02,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 18:18:02,506 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-11-28 18:18:02,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:18:02,506 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 18:18:02,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 18:18:02,507 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 18:18:02,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 18:18:02,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 18:18:02,670 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 18:18:02,670 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 18:18:02,670 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 18:18:02,670 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 18:18:02,670 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 18:18:02,670 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 18:18:02,670 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 11 17) the Hoare annotation is: true [2018-11-28 18:18:02,671 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 11 17) no Hoare annotation was computed. [2018-11-28 18:18:02,671 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 11 17) no Hoare annotation was computed. [2018-11-28 18:18:02,671 INFO L448 ceAbstractionStarter]: For program point L13-2(lines 13 15) no Hoare annotation was computed. [2018-11-28 18:18:02,673 INFO L444 ceAbstractionStarter]: At program point L13-3(lines 13 15) the Hoare annotation is: (or (and (<= 10 main_~sn~0) (<= 6 main_~i~0) (<= main_~i~0 6) (<= main_~sn~0 10)) (and (<= 1 main_~i~0) (<= main_~i~0 1) (<= main_~sn~0 0) (<= 0 main_~sn~0)) (and (<= 2 main_~i~0) (<= main_~i~0 2) (<= main_~sn~0 2) (<= 2 main_~sn~0)) (and (<= 7 main_~i~0) (<= 12 main_~sn~0) (<= main_~sn~0 12) (<= main_~i~0 7)) (and (<= 6 main_~sn~0) (<= main_~sn~0 6) (<= 4 main_~i~0) (<= main_~i~0 4)) (and (<= 9 main_~i~0) (<= main_~sn~0 16) (< 15 main_~sn~0)) (and (<= main_~i~0 3) (<= main_~sn~0 4) (<= 3 main_~i~0) (<= 4 main_~sn~0)) (and (<= 14 main_~sn~0) (<= 8 main_~i~0) (<= main_~i~0 8) (<= main_~sn~0 14)) (and (<= main_~sn~0 8) (<= 5 main_~i~0) (<= main_~i~0 5) (<= 8 main_~sn~0))) [2018-11-28 18:18:02,673 INFO L444 ceAbstractionStarter]: At program point L13-4(lines 13 15) the Hoare annotation is: (and (<= main_~sn~0 16) (< 15 main_~sn~0)) [2018-11-28 18:18:02,673 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-28 18:18:02,674 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-28 18:18:02,675 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-28 18:18:02,675 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-28 18:18:02,675 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-28 18:18:02,675 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-28 18:18:02,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:18:02 BoogieIcfgContainer [2018-11-28 18:18:02,693 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 18:18:02,694 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 18:18:02,694 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 18:18:02,695 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 18:18:02,696 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:17:58" (3/4) ... [2018-11-28 18:18:02,700 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 18:18:02,707 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 18:18:02,707 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 18:18:02,708 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-28 18:18:02,711 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-28 18:18:02,711 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-28 18:18:02,712 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 18:18:02,752 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 18:18:02,752 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 18:18:02,753 INFO L168 Benchmark]: Toolchain (without parser) took 5220.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 943.3 MB in the beginning and 869.6 MB in the end (delta: 73.7 MB). Peak memory consumption was 202.6 MB. Max. memory is 11.5 GB. [2018-11-28 18:18:02,755 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:18:02,755 INFO L168 Benchmark]: CACSL2BoogieTranslator took 279.36 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 932.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 18:18:02,756 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.72 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:18:02,758 INFO L168 Benchmark]: Boogie Preprocessor took 21.81 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:18:02,758 INFO L168 Benchmark]: RCFGBuilder took 324.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-11-28 18:18:02,760 INFO L168 Benchmark]: TraceAbstraction took 4506.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 869.6 MB in the end (delta: 232.3 MB). Peak memory consumption was 232.3 MB. Max. memory is 11.5 GB. [2018-11-28 18:18:02,760 INFO L168 Benchmark]: Witness Printer took 57.89 ms. Allocated memory is still 1.2 GB. Free memory is still 869.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:18:02,766 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 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 279.36 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 932.6 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.72 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.81 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 324.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4506.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 869.6 MB in the end (delta: 232.3 MB). Peak memory consumption was 232.3 MB. Max. memory is 11.5 GB. * Witness Printer took 57.89 ms. Allocated memory is still 1.2 GB. Free memory is still 869.6 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: 13]: Loop Invariant Derived loop invariant: ((((((((((10 <= sn && 6 <= i) && i <= 6) && sn <= 10) || (((1 <= i && i <= 1) && sn <= 0) && 0 <= sn)) || (((2 <= i && i <= 2) && sn <= 2) && 2 <= sn)) || (((7 <= i && 12 <= sn) && sn <= 12) && i <= 7)) || (((6 <= sn && sn <= 6) && 4 <= i) && i <= 4)) || ((9 <= i && sn <= 16) && 15 < sn)) || (((i <= 3 && sn <= 4) && 3 <= i) && 4 <= sn)) || (((14 <= sn && 8 <= i) && i <= 8) && sn <= 14)) || (((sn <= 8 && 5 <= i) && i <= 5) && 8 <= sn) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 18 locations, 1 error locations. SAFE Result, 4.4s OverallTime, 11 OverallIterations, 9 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 120 SDtfs, 37 SDslu, 400 SDs, 0 SdLazy, 273 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 223 GetRequests, 163 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 7 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 17 PreInvPairs, 27 NumberOfFragments, 127 HoareAnnotationTreeSize, 17 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 352 NumberOfCodeBlocks, 351 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 333 ConstructedInterpolants, 0 QuantifiedInterpolants, 17679 SizeOfPredicates, 8 NumberOfNonLiveVariables, 368 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 19 InterpolantComputations, 3 PerfectInterpolantSequences, 81/489 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...