./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/sum01_bug02_sum01_bug02_base.case.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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 ../sv-benchmarks/c/loops/sum01_bug02_sum01_bug02_base.case.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 1b149b3cef099476d14a8b122afb66552d0406eb ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 18:12:18,356 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 18:12:18,358 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 18:12:18,376 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 18:12:18,376 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 18:12:18,377 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 18:12:18,379 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 18:12:18,381 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 18:12:18,383 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 18:12:18,384 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 18:12:18,385 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 18:12:18,386 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 18:12:18,387 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 18:12:18,388 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 18:12:18,389 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 18:12:18,390 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 18:12:18,391 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 18:12:18,392 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 18:12:18,394 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 18:12:18,397 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 18:12:18,398 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 18:12:18,400 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 18:12:18,401 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 18:12:18,402 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 18:12:18,405 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 18:12:18,405 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 18:12:18,406 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 18:12:18,407 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 18:12:18,407 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 18:12:18,408 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 18:12:18,409 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 18:12:18,409 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 18:12:18,410 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 18:12:18,411 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 18:12:18,412 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 18:12:18,413 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 18:12:18,413 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 18:12:18,414 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 18:12:18,414 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 18:12:18,415 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 18:12:18,416 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 18:12:18,416 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 18:12:18,432 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 18:12:18,433 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 18:12:18,434 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 18:12:18,434 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 18:12:18,434 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 18:12:18,435 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 18:12:18,435 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 18:12:18,435 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 18:12:18,435 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 18:12:18,435 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 18:12:18,436 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 18:12:18,436 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 18:12:18,436 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 18:12:18,436 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 18:12:18,437 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 18:12:18,437 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 18:12:18,437 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 18:12:18,437 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 18:12:18,437 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 18:12:18,438 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 18:12:18,438 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 18:12:18,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:12:18,438 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 18:12:18,439 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 18:12:18,439 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 18:12:18,439 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 18:12:18,439 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 18:12:18,439 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 18:12:18,440 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 18:12:18,440 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 1b149b3cef099476d14a8b122afb66552d0406eb [2020-07-28 18:12:18,794 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 18:12:18,818 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 18:12:18,821 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 18:12:18,823 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 18:12:18,825 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 18:12:18,826 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/sum01_bug02_sum01_bug02_base.case.i [2020-07-28 18:12:18,887 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a9767ee4/6c84aa2ae7c7411fa3393cd1047f664c/FLAG646586aca [2020-07-28 18:12:19,315 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 18:12:19,316 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/sum01_bug02_sum01_bug02_base.case.i [2020-07-28 18:12:19,322 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a9767ee4/6c84aa2ae7c7411fa3393cd1047f664c/FLAG646586aca [2020-07-28 18:12:19,737 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a9767ee4/6c84aa2ae7c7411fa3393cd1047f664c [2020-07-28 18:12:19,741 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 18:12:19,744 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 18:12:19,745 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 18:12:19,746 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 18:12:19,749 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 18:12:19,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:12:19" (1/1) ... [2020-07-28 18:12:19,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12513874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:19, skipping insertion in model container [2020-07-28 18:12:19,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:12:19" (1/1) ... [2020-07-28 18:12:19,762 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 18:12:19,779 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 18:12:19,945 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:12:19,950 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 18:12:19,968 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:12:19,983 INFO L208 MainTranslator]: Completed translation [2020-07-28 18:12:19,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:19 WrapperNode [2020-07-28 18:12:19,984 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 18:12:19,985 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 18:12:19,985 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 18:12:19,985 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 18:12:19,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:19" (1/1) ... [2020-07-28 18:12:20,001 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:19" (1/1) ... [2020-07-28 18:12:20,097 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 18:12:20,097 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 18:12:20,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 18:12:20,098 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 18:12:20,108 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:19" (1/1) ... [2020-07-28 18:12:20,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:19" (1/1) ... [2020-07-28 18:12:20,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:19" (1/1) ... [2020-07-28 18:12:20,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:19" (1/1) ... [2020-07-28 18:12:20,114 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:19" (1/1) ... [2020-07-28 18:12:20,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:19" (1/1) ... [2020-07-28 18:12:20,126 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:19" (1/1) ... [2020-07-28 18:12:20,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 18:12:20,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 18:12:20,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 18:12:20,134 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 18:12:20,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:19" (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 [2020-07-28 18:12:20,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 18:12:20,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 18:12:20,463 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 18:12:20,463 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-28 18:12:20,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:12:20 BoogieIcfgContainer [2020-07-28 18:12:20,467 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 18:12:20,468 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 18:12:20,469 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 18:12:20,472 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 18:12:20,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 06:12:19" (1/3) ... [2020-07-28 18:12:20,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cbb5b6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:12:20, skipping insertion in model container [2020-07-28 18:12:20,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:19" (2/3) ... [2020-07-28 18:12:20,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cbb5b6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:12:20, skipping insertion in model container [2020-07-28 18:12:20,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:12:20" (3/3) ... [2020-07-28 18:12:20,477 INFO L109 eAbstractionObserver]: Analyzing ICFG sum01_bug02_sum01_bug02_base.case.i [2020-07-28 18:12:20,488 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 18:12:20,496 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 18:12:20,512 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 18:12:20,538 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 18:12:20,539 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 18:12:20,539 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 18:12:20,539 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 18:12:20,539 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 18:12:20,539 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 18:12:20,539 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 18:12:20,539 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 18:12:20,556 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2020-07-28 18:12:20,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-28 18:12:20,563 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:20,564 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-28 18:12:20,565 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:20,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:20,572 INFO L82 PathProgramCache]: Analyzing trace with hash 30108868, now seen corresponding path program 1 times [2020-07-28 18:12:20,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:20,584 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195524891] [2020-07-28 18:12:20,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:20,747 INFO L280 TraceCheckUtils]: 0: Hoare triple {14#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~i~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~n~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;main_~sn~0 := 0;main_~i~0 := 1; {14#true} is VALID [2020-07-28 18:12:20,749 INFO L280 TraceCheckUtils]: 1: Hoare triple {14#true} assume !true; {15#false} is VALID [2020-07-28 18:12:20,750 INFO L280 TraceCheckUtils]: 2: Hoare triple {15#false} __VERIFIER_assert_#in~cond := (if main_~sn~0 == 2 * main_~n~0 || 0 == main_~sn~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {15#false} is VALID [2020-07-28 18:12:20,750 INFO L280 TraceCheckUtils]: 3: Hoare triple {15#false} assume 0 == __VERIFIER_assert_~cond; {15#false} is VALID [2020-07-28 18:12:20,750 INFO L280 TraceCheckUtils]: 4: Hoare triple {15#false} assume !false; {15#false} is VALID [2020-07-28 18:12:20,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:20,753 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195524891] [2020-07-28 18:12:20,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:12:20,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 18:12:20,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572280971] [2020-07-28 18:12:20,763 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2020-07-28 18:12:20,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:20,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 18:12:20,783 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:20,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 18:12:20,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:20,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 18:12:20,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 18:12:20,797 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 2 states. [2020-07-28 18:12:20,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:20,843 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2020-07-28 18:12:20,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 18:12:20,843 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2020-07-28 18:12:20,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:20,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 18:12:20,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 21 transitions. [2020-07-28 18:12:20,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 18:12:20,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 21 transitions. [2020-07-28 18:12:20,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 21 transitions. [2020-07-28 18:12:20,904 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:20,915 INFO L225 Difference]: With dead ends: 18 [2020-07-28 18:12:20,915 INFO L226 Difference]: Without dead ends: 8 [2020-07-28 18:12:20,919 INFO L675 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 [2020-07-28 18:12:20,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-07-28 18:12:20,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-07-28 18:12:20,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:20,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 8 states. [2020-07-28 18:12:20,961 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2020-07-28 18:12:20,962 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2020-07-28 18:12:20,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:20,964 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2020-07-28 18:12:20,965 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2020-07-28 18:12:20,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:20,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:20,966 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2020-07-28 18:12:20,966 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2020-07-28 18:12:20,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:20,970 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2020-07-28 18:12:20,971 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2020-07-28 18:12:20,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:20,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:20,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:20,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:20,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 18:12:20,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2020-07-28 18:12:20,977 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2020-07-28 18:12:20,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:20,978 INFO L479 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2020-07-28 18:12:20,979 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 18:12:20,979 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2020-07-28 18:12:20,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-28 18:12:20,980 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:20,980 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-28 18:12:20,981 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 18:12:20,981 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:20,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:20,983 INFO L82 PathProgramCache]: Analyzing trace with hash 29781167, now seen corresponding path program 1 times [2020-07-28 18:12:20,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:20,983 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521112441] [2020-07-28 18:12:20,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:21,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:21,098 INFO L280 TraceCheckUtils]: 0: Hoare triple {64#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~i~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~n~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;main_~sn~0 := 0;main_~i~0 := 1; {66#(= 0 ULTIMATE.start_main_~sn~0)} is VALID [2020-07-28 18:12:21,100 INFO L280 TraceCheckUtils]: 1: Hoare triple {66#(= 0 ULTIMATE.start_main_~sn~0)} assume !(main_~i~0 <= main_~n~0); {66#(= 0 ULTIMATE.start_main_~sn~0)} is VALID [2020-07-28 18:12:21,102 INFO L280 TraceCheckUtils]: 2: Hoare triple {66#(= 0 ULTIMATE.start_main_~sn~0)} __VERIFIER_assert_#in~cond := (if main_~sn~0 == 2 * main_~n~0 || 0 == main_~sn~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {67#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 18:12:21,103 INFO L280 TraceCheckUtils]: 3: Hoare triple {67#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {65#false} is VALID [2020-07-28 18:12:21,104 INFO L280 TraceCheckUtils]: 4: Hoare triple {65#false} assume !false; {65#false} is VALID [2020-07-28 18:12:21,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:21,105 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521112441] [2020-07-28 18:12:21,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:12:21,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 18:12:21,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750212905] [2020-07-28 18:12:21,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-28 18:12:21,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:21,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 18:12:21,122 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:21,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 18:12:21,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:21,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 18:12:21,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 18:12:21,123 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2020-07-28 18:12:21,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:21,189 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2020-07-28 18:12:21,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 18:12:21,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-28 18:12:21,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:21,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:12:21,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2020-07-28 18:12:21,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:12:21,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2020-07-28 18:12:21,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 14 transitions. [2020-07-28 18:12:21,222 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:21,223 INFO L225 Difference]: With dead ends: 13 [2020-07-28 18:12:21,223 INFO L226 Difference]: Without dead ends: 9 [2020-07-28 18:12:21,224 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-28 18:12:21,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2020-07-28 18:12:21,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-07-28 18:12:21,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:21,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 9 states. [2020-07-28 18:12:21,230 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2020-07-28 18:12:21,230 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2020-07-28 18:12:21,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:21,232 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2020-07-28 18:12:21,233 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2020-07-28 18:12:21,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:21,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:21,234 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2020-07-28 18:12:21,234 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2020-07-28 18:12:21,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:21,236 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2020-07-28 18:12:21,236 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2020-07-28 18:12:21,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:21,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:21,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:21,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:21,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 18:12:21,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2020-07-28 18:12:21,239 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 5 [2020-07-28 18:12:21,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:21,240 INFO L479 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-07-28 18:12:21,240 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 18:12:21,240 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2020-07-28 18:12:21,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-28 18:12:21,241 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:21,241 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:12:21,242 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 18:12:21,242 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:21,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:21,243 INFO L82 PathProgramCache]: Analyzing trace with hash -308490948, now seen corresponding path program 1 times [2020-07-28 18:12:21,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:21,244 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882766460] [2020-07-28 18:12:21,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:21,281 INFO L280 TraceCheckUtils]: 0: Hoare triple {116#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~i~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~n~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;main_~sn~0 := 0;main_~i~0 := 1; {118#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:21,283 INFO L280 TraceCheckUtils]: 1: Hoare triple {118#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 <= main_~n~0);main_~sn~0 := 2 + main_~sn~0; {118#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:21,284 INFO L280 TraceCheckUtils]: 2: Hoare triple {118#(<= ULTIMATE.start_main_~i~0 1)} assume 4 == main_~i~0;main_~sn~0 := -10; {117#false} is VALID [2020-07-28 18:12:21,284 INFO L280 TraceCheckUtils]: 3: Hoare triple {117#false} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {117#false} is VALID [2020-07-28 18:12:21,285 INFO L280 TraceCheckUtils]: 4: Hoare triple {117#false} assume !(main_~i~0 <= main_~n~0); {117#false} is VALID [2020-07-28 18:12:21,285 INFO L280 TraceCheckUtils]: 5: Hoare triple {117#false} __VERIFIER_assert_#in~cond := (if main_~sn~0 == 2 * main_~n~0 || 0 == main_~sn~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {117#false} is VALID [2020-07-28 18:12:21,286 INFO L280 TraceCheckUtils]: 6: Hoare triple {117#false} assume 0 == __VERIFIER_assert_~cond; {117#false} is VALID [2020-07-28 18:12:21,286 INFO L280 TraceCheckUtils]: 7: Hoare triple {117#false} assume !false; {117#false} is VALID [2020-07-28 18:12:21,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:21,288 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882766460] [2020-07-28 18:12:21,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:12:21,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 18:12:21,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630981547] [2020-07-28 18:12:21,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-07-28 18:12:21,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:21,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 18:12:21,304 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:21,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 18:12:21,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:21,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 18:12:21,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 18:12:21,306 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 3 states. [2020-07-28 18:12:21,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:21,342 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2020-07-28 18:12:21,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 18:12:21,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-07-28 18:12:21,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:21,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 18:12:21,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2020-07-28 18:12:21,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 18:12:21,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2020-07-28 18:12:21,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 21 transitions. [2020-07-28 18:12:21,378 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:21,379 INFO L225 Difference]: With dead ends: 18 [2020-07-28 18:12:21,379 INFO L226 Difference]: Without dead ends: 11 [2020-07-28 18:12:21,380 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 18:12:21,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-07-28 18:12:21,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2020-07-28 18:12:21,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:21,385 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 10 states. [2020-07-28 18:12:21,385 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 10 states. [2020-07-28 18:12:21,385 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 10 states. [2020-07-28 18:12:21,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:21,387 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2020-07-28 18:12:21,387 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2020-07-28 18:12:21,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:21,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:21,388 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 11 states. [2020-07-28 18:12:21,388 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 11 states. [2020-07-28 18:12:21,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:21,390 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2020-07-28 18:12:21,391 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2020-07-28 18:12:21,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:21,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:21,391 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:21,392 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:21,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 18:12:21,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2020-07-28 18:12:21,393 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 8 [2020-07-28 18:12:21,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:21,394 INFO L479 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2020-07-28 18:12:21,394 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 18:12:21,394 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2020-07-28 18:12:21,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-28 18:12:21,395 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:21,395 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:12:21,396 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-28 18:12:21,396 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:21,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:21,397 INFO L82 PathProgramCache]: Analyzing trace with hash -251232646, now seen corresponding path program 1 times [2020-07-28 18:12:21,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:21,397 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706347979] [2020-07-28 18:12:21,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:21,703 INFO L280 TraceCheckUtils]: 0: Hoare triple {176#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~i~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~n~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;main_~sn~0 := 0;main_~i~0 := 1; {178#(and (<= (+ ULTIMATE.start_main_~sn~0 2) (* 2 ULTIMATE.start_main_~i~0)) (<= (* 2 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~sn~0 2)))} is VALID [2020-07-28 18:12:21,705 INFO L280 TraceCheckUtils]: 1: Hoare triple {178#(and (<= (+ ULTIMATE.start_main_~sn~0 2) (* 2 ULTIMATE.start_main_~i~0)) (<= (* 2 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~sn~0 2)))} assume !!(main_~i~0 <= main_~n~0);main_~sn~0 := 2 + main_~sn~0; {179#(and (or (<= (* 2 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~sn~0) (< (* 2 ULTIMATE.start_main_~n~0) (+ ULTIMATE.start_main_~sn~0 1))) (<= ULTIMATE.start_main_~sn~0 (* 2 ULTIMATE.start_main_~n~0)))} is VALID [2020-07-28 18:12:21,707 INFO L280 TraceCheckUtils]: 2: Hoare triple {179#(and (or (<= (* 2 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~sn~0) (< (* 2 ULTIMATE.start_main_~n~0) (+ ULTIMATE.start_main_~sn~0 1))) (<= ULTIMATE.start_main_~sn~0 (* 2 ULTIMATE.start_main_~n~0)))} assume !(4 == main_~i~0); {179#(and (or (<= (* 2 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~sn~0) (< (* 2 ULTIMATE.start_main_~n~0) (+ ULTIMATE.start_main_~sn~0 1))) (<= ULTIMATE.start_main_~sn~0 (* 2 ULTIMATE.start_main_~n~0)))} is VALID [2020-07-28 18:12:21,709 INFO L280 TraceCheckUtils]: 3: Hoare triple {179#(and (or (<= (* 2 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~sn~0) (< (* 2 ULTIMATE.start_main_~n~0) (+ ULTIMATE.start_main_~sn~0 1))) (<= ULTIMATE.start_main_~sn~0 (* 2 ULTIMATE.start_main_~n~0)))} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {180#(and (or (<= (* 2 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~sn~0 2)) (< (* 2 ULTIMATE.start_main_~n~0) (+ ULTIMATE.start_main_~sn~0 1))) (<= ULTIMATE.start_main_~sn~0 (* 2 ULTIMATE.start_main_~n~0)))} is VALID [2020-07-28 18:12:21,710 INFO L280 TraceCheckUtils]: 4: Hoare triple {180#(and (or (<= (* 2 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~sn~0 2)) (< (* 2 ULTIMATE.start_main_~n~0) (+ ULTIMATE.start_main_~sn~0 1))) (<= ULTIMATE.start_main_~sn~0 (* 2 ULTIMATE.start_main_~n~0)))} assume !(main_~i~0 <= main_~n~0); {181#(and (< (* 2 ULTIMATE.start_main_~n~0) (+ ULTIMATE.start_main_~sn~0 1)) (<= ULTIMATE.start_main_~sn~0 (* 2 ULTIMATE.start_main_~n~0)))} is VALID [2020-07-28 18:12:21,713 INFO L280 TraceCheckUtils]: 5: Hoare triple {181#(and (< (* 2 ULTIMATE.start_main_~n~0) (+ ULTIMATE.start_main_~sn~0 1)) (<= ULTIMATE.start_main_~sn~0 (* 2 ULTIMATE.start_main_~n~0)))} __VERIFIER_assert_#in~cond := (if main_~sn~0 == 2 * main_~n~0 || 0 == main_~sn~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {182#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 18:12:21,714 INFO L280 TraceCheckUtils]: 6: Hoare triple {182#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {177#false} is VALID [2020-07-28 18:12:21,714 INFO L280 TraceCheckUtils]: 7: Hoare triple {177#false} assume !false; {177#false} is VALID [2020-07-28 18:12:21,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:21,716 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706347979] [2020-07-28 18:12:21,716 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034531748] [2020-07-28 18:12:21,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:21,760 WARN L261 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-28 18:12:21,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:21,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:12:22,180 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 18:12:22,217 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-28 18:12:22,279 INFO L280 TraceCheckUtils]: 0: Hoare triple {176#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~i~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~n~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;main_~sn~0 := 0;main_~i~0 := 1; {186#(and (= 1 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~sn~0))} is VALID [2020-07-28 18:12:22,280 INFO L280 TraceCheckUtils]: 1: Hoare triple {186#(and (= 1 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~sn~0))} assume !!(main_~i~0 <= main_~n~0);main_~sn~0 := 2 + main_~sn~0; {190#(and (= ULTIMATE.start_main_~sn~0 2) (= 1 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-28 18:12:22,281 INFO L280 TraceCheckUtils]: 2: Hoare triple {190#(and (= ULTIMATE.start_main_~sn~0 2) (= 1 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0))} assume !(4 == main_~i~0); {190#(and (= ULTIMATE.start_main_~sn~0 2) (= 1 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-28 18:12:22,282 INFO L280 TraceCheckUtils]: 3: Hoare triple {190#(and (= ULTIMATE.start_main_~sn~0 2) (= 1 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0))} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {197#(and (<= 1 ULTIMATE.start_main_~n~0) (<= ULTIMATE.start_main_~i~0 2) (= ULTIMATE.start_main_~sn~0 2))} is VALID [2020-07-28 18:12:22,284 INFO L280 TraceCheckUtils]: 4: Hoare triple {197#(and (<= 1 ULTIMATE.start_main_~n~0) (<= ULTIMATE.start_main_~i~0 2) (= ULTIMATE.start_main_~sn~0 2))} assume !(main_~i~0 <= main_~n~0); {201#(and (<= 1 ULTIMATE.start_main_~n~0) (= ULTIMATE.start_main_~sn~0 2) (<= ULTIMATE.start_main_~n~0 1))} is VALID [2020-07-28 18:12:22,285 INFO L280 TraceCheckUtils]: 5: Hoare triple {201#(and (<= 1 ULTIMATE.start_main_~n~0) (= ULTIMATE.start_main_~sn~0 2) (<= ULTIMATE.start_main_~n~0 1))} __VERIFIER_assert_#in~cond := (if main_~sn~0 == 2 * main_~n~0 || 0 == main_~sn~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {205#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2020-07-28 18:12:22,286 INFO L280 TraceCheckUtils]: 6: Hoare triple {205#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {177#false} is VALID [2020-07-28 18:12:22,286 INFO L280 TraceCheckUtils]: 7: Hoare triple {177#false} assume !false; {177#false} is VALID [2020-07-28 18:12:22,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:22,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:12:22,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2020-07-28 18:12:22,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470225805] [2020-07-28 18:12:22,289 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2020-07-28 18:12:22,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:22,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-28 18:12:22,313 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:22,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-28 18:12:22,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:22,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-28 18:12:22,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-07-28 18:12:22,315 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 12 states. [2020-07-28 18:12:22,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:22,677 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2020-07-28 18:12:22,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-28 18:12:22,677 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2020-07-28 18:12:22,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:22,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-28 18:12:22,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 24 transitions. [2020-07-28 18:12:22,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-28 18:12:22,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 24 transitions. [2020-07-28 18:12:22,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 24 transitions. [2020-07-28 18:12:22,714 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:22,715 INFO L225 Difference]: With dead ends: 21 [2020-07-28 18:12:22,715 INFO L226 Difference]: Without dead ends: 15 [2020-07-28 18:12:22,716 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2020-07-28 18:12:22,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-07-28 18:12:22,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-28 18:12:22,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:22,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2020-07-28 18:12:22,727 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-28 18:12:22,728 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-28 18:12:22,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:22,729 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2020-07-28 18:12:22,729 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2020-07-28 18:12:22,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:22,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:22,730 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-28 18:12:22,730 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-28 18:12:22,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:22,732 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2020-07-28 18:12:22,732 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2020-07-28 18:12:22,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:22,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:22,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:22,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:22,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-28 18:12:22,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2020-07-28 18:12:22,735 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 8 [2020-07-28 18:12:22,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:22,735 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2020-07-28 18:12:22,735 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-28 18:12:22,735 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2020-07-28 18:12:22,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 18:12:22,736 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:22,736 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:12:22,949 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:22,950 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:22,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:22,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1099734127, now seen corresponding path program 1 times [2020-07-28 18:12:22,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:22,952 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277883774] [2020-07-28 18:12:22,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:23,016 INFO L280 TraceCheckUtils]: 0: Hoare triple {293#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~i~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~n~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;main_~sn~0 := 0;main_~i~0 := 1; {295#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:23,017 INFO L280 TraceCheckUtils]: 1: Hoare triple {295#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 <= main_~n~0);main_~sn~0 := 2 + main_~sn~0; {295#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:23,018 INFO L280 TraceCheckUtils]: 2: Hoare triple {295#(<= ULTIMATE.start_main_~i~0 1)} assume !(4 == main_~i~0); {295#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:23,019 INFO L280 TraceCheckUtils]: 3: Hoare triple {295#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {296#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:23,020 INFO L280 TraceCheckUtils]: 4: Hoare triple {296#(<= ULTIMATE.start_main_~i~0 2)} assume !!(main_~i~0 <= main_~n~0);main_~sn~0 := 2 + main_~sn~0; {296#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:23,021 INFO L280 TraceCheckUtils]: 5: Hoare triple {296#(<= ULTIMATE.start_main_~i~0 2)} assume 4 == main_~i~0;main_~sn~0 := -10; {294#false} is VALID [2020-07-28 18:12:23,021 INFO L280 TraceCheckUtils]: 6: Hoare triple {294#false} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {294#false} is VALID [2020-07-28 18:12:23,022 INFO L280 TraceCheckUtils]: 7: Hoare triple {294#false} assume !(main_~i~0 <= main_~n~0); {294#false} is VALID [2020-07-28 18:12:23,022 INFO L280 TraceCheckUtils]: 8: Hoare triple {294#false} __VERIFIER_assert_#in~cond := (if main_~sn~0 == 2 * main_~n~0 || 0 == main_~sn~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {294#false} is VALID [2020-07-28 18:12:23,023 INFO L280 TraceCheckUtils]: 9: Hoare triple {294#false} assume 0 == __VERIFIER_assert_~cond; {294#false} is VALID [2020-07-28 18:12:23,023 INFO L280 TraceCheckUtils]: 10: Hoare triple {294#false} assume !false; {294#false} is VALID [2020-07-28 18:12:23,024 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:23,024 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277883774] [2020-07-28 18:12:23,024 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965790447] [2020-07-28 18:12:23,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-28 18:12:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:23,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:23,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:23,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:12:23,119 INFO L280 TraceCheckUtils]: 0: Hoare triple {293#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~i~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~n~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;main_~sn~0 := 0;main_~i~0 := 1; {295#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:23,120 INFO L280 TraceCheckUtils]: 1: Hoare triple {295#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 <= main_~n~0);main_~sn~0 := 2 + main_~sn~0; {295#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:23,121 INFO L280 TraceCheckUtils]: 2: Hoare triple {295#(<= ULTIMATE.start_main_~i~0 1)} assume !(4 == main_~i~0); {295#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:23,122 INFO L280 TraceCheckUtils]: 3: Hoare triple {295#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {296#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:23,123 INFO L280 TraceCheckUtils]: 4: Hoare triple {296#(<= ULTIMATE.start_main_~i~0 2)} assume !!(main_~i~0 <= main_~n~0);main_~sn~0 := 2 + main_~sn~0; {296#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:23,124 INFO L280 TraceCheckUtils]: 5: Hoare triple {296#(<= ULTIMATE.start_main_~i~0 2)} assume 4 == main_~i~0;main_~sn~0 := -10; {294#false} is VALID [2020-07-28 18:12:23,124 INFO L280 TraceCheckUtils]: 6: Hoare triple {294#false} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {294#false} is VALID [2020-07-28 18:12:23,124 INFO L280 TraceCheckUtils]: 7: Hoare triple {294#false} assume !(main_~i~0 <= main_~n~0); {294#false} is VALID [2020-07-28 18:12:23,125 INFO L280 TraceCheckUtils]: 8: Hoare triple {294#false} __VERIFIER_assert_#in~cond := (if main_~sn~0 == 2 * main_~n~0 || 0 == main_~sn~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {294#false} is VALID [2020-07-28 18:12:23,125 INFO L280 TraceCheckUtils]: 9: Hoare triple {294#false} assume 0 == __VERIFIER_assert_~cond; {294#false} is VALID [2020-07-28 18:12:23,126 INFO L280 TraceCheckUtils]: 10: Hoare triple {294#false} assume !false; {294#false} is VALID [2020-07-28 18:12:23,126 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:23,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:12:23,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2020-07-28 18:12:23,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731711835] [2020-07-28 18:12:23,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-28 18:12:23,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:23,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 18:12:23,143 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:23,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 18:12:23,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:23,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 18:12:23,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 18:12:23,144 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 4 states. [2020-07-28 18:12:23,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:23,200 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2020-07-28 18:12:23,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 18:12:23,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-28 18:12:23,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:23,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:12:23,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2020-07-28 18:12:23,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:12:23,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2020-07-28 18:12:23,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 24 transitions. [2020-07-28 18:12:23,231 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:23,232 INFO L225 Difference]: With dead ends: 22 [2020-07-28 18:12:23,233 INFO L226 Difference]: Without dead ends: 15 [2020-07-28 18:12:23,233 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 18:12:23,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-07-28 18:12:23,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-28 18:12:23,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:23,243 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2020-07-28 18:12:23,244 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-28 18:12:23,244 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-28 18:12:23,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:23,245 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2020-07-28 18:12:23,245 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-28 18:12:23,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:23,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:23,246 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-28 18:12:23,246 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-28 18:12:23,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:23,247 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2020-07-28 18:12:23,248 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-28 18:12:23,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:23,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:23,249 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:23,249 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:23,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-28 18:12:23,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2020-07-28 18:12:23,251 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2020-07-28 18:12:23,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:23,251 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-07-28 18:12:23,251 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 18:12:23,251 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-28 18:12:23,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-28 18:12:23,252 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:23,252 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1] [2020-07-28 18:12:23,464 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:23,464 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:23,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:23,466 INFO L82 PathProgramCache]: Analyzing trace with hash 2050208028, now seen corresponding path program 2 times [2020-07-28 18:12:23,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:23,467 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543302020] [2020-07-28 18:12:23,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:23,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:23,518 INFO L280 TraceCheckUtils]: 0: Hoare triple {405#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~i~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~n~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;main_~sn~0 := 0;main_~i~0 := 1; {407#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:23,519 INFO L280 TraceCheckUtils]: 1: Hoare triple {407#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 <= main_~n~0);main_~sn~0 := 2 + main_~sn~0; {407#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:23,519 INFO L280 TraceCheckUtils]: 2: Hoare triple {407#(<= ULTIMATE.start_main_~i~0 1)} assume !(4 == main_~i~0); {407#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:23,520 INFO L280 TraceCheckUtils]: 3: Hoare triple {407#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {408#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:23,521 INFO L280 TraceCheckUtils]: 4: Hoare triple {408#(<= ULTIMATE.start_main_~i~0 2)} assume !!(main_~i~0 <= main_~n~0);main_~sn~0 := 2 + main_~sn~0; {408#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:23,522 INFO L280 TraceCheckUtils]: 5: Hoare triple {408#(<= ULTIMATE.start_main_~i~0 2)} assume !(4 == main_~i~0); {408#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:23,523 INFO L280 TraceCheckUtils]: 6: Hoare triple {408#(<= ULTIMATE.start_main_~i~0 2)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {409#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-28 18:12:23,524 INFO L280 TraceCheckUtils]: 7: Hoare triple {409#(<= ULTIMATE.start_main_~i~0 3)} assume !!(main_~i~0 <= main_~n~0);main_~sn~0 := 2 + main_~sn~0; {409#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-28 18:12:23,525 INFO L280 TraceCheckUtils]: 8: Hoare triple {409#(<= ULTIMATE.start_main_~i~0 3)} assume 4 == main_~i~0;main_~sn~0 := -10; {406#false} is VALID [2020-07-28 18:12:23,525 INFO L280 TraceCheckUtils]: 9: Hoare triple {406#false} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {406#false} is VALID [2020-07-28 18:12:23,525 INFO L280 TraceCheckUtils]: 10: Hoare triple {406#false} assume !(main_~i~0 <= main_~n~0); {406#false} is VALID [2020-07-28 18:12:23,526 INFO L280 TraceCheckUtils]: 11: Hoare triple {406#false} __VERIFIER_assert_#in~cond := (if main_~sn~0 == 2 * main_~n~0 || 0 == main_~sn~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {406#false} is VALID [2020-07-28 18:12:23,526 INFO L280 TraceCheckUtils]: 12: Hoare triple {406#false} assume 0 == __VERIFIER_assert_~cond; {406#false} is VALID [2020-07-28 18:12:23,526 INFO L280 TraceCheckUtils]: 13: Hoare triple {406#false} assume !false; {406#false} is VALID [2020-07-28 18:12:23,527 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:23,528 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543302020] [2020-07-28 18:12:23,528 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824602259] [2020-07-28 18:12:23,528 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:23,553 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-28 18:12:23,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 18:12:23,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-28 18:12:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:23,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:12:23,655 INFO L280 TraceCheckUtils]: 0: Hoare triple {405#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~i~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~n~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;main_~sn~0 := 0;main_~i~0 := 1; {407#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:23,656 INFO L280 TraceCheckUtils]: 1: Hoare triple {407#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 <= main_~n~0);main_~sn~0 := 2 + main_~sn~0; {407#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:23,657 INFO L280 TraceCheckUtils]: 2: Hoare triple {407#(<= ULTIMATE.start_main_~i~0 1)} assume !(4 == main_~i~0); {407#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-28 18:12:23,658 INFO L280 TraceCheckUtils]: 3: Hoare triple {407#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {408#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:23,658 INFO L280 TraceCheckUtils]: 4: Hoare triple {408#(<= ULTIMATE.start_main_~i~0 2)} assume !!(main_~i~0 <= main_~n~0);main_~sn~0 := 2 + main_~sn~0; {408#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:23,659 INFO L280 TraceCheckUtils]: 5: Hoare triple {408#(<= ULTIMATE.start_main_~i~0 2)} assume !(4 == main_~i~0); {408#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-28 18:12:23,659 INFO L280 TraceCheckUtils]: 6: Hoare triple {408#(<= ULTIMATE.start_main_~i~0 2)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {409#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-28 18:12:23,660 INFO L280 TraceCheckUtils]: 7: Hoare triple {409#(<= ULTIMATE.start_main_~i~0 3)} assume !!(main_~i~0 <= main_~n~0);main_~sn~0 := 2 + main_~sn~0; {409#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-28 18:12:23,661 INFO L280 TraceCheckUtils]: 8: Hoare triple {409#(<= ULTIMATE.start_main_~i~0 3)} assume 4 == main_~i~0;main_~sn~0 := -10; {406#false} is VALID [2020-07-28 18:12:23,661 INFO L280 TraceCheckUtils]: 9: Hoare triple {406#false} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {406#false} is VALID [2020-07-28 18:12:23,661 INFO L280 TraceCheckUtils]: 10: Hoare triple {406#false} assume !(main_~i~0 <= main_~n~0); {406#false} is VALID [2020-07-28 18:12:23,662 INFO L280 TraceCheckUtils]: 11: Hoare triple {406#false} __VERIFIER_assert_#in~cond := (if main_~sn~0 == 2 * main_~n~0 || 0 == main_~sn~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {406#false} is VALID [2020-07-28 18:12:23,662 INFO L280 TraceCheckUtils]: 12: Hoare triple {406#false} assume 0 == __VERIFIER_assert_~cond; {406#false} is VALID [2020-07-28 18:12:23,662 INFO L280 TraceCheckUtils]: 13: Hoare triple {406#false} assume !false; {406#false} is VALID [2020-07-28 18:12:23,663 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:23,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:12:23,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-07-28 18:12:23,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336231472] [2020-07-28 18:12:23,664 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-28 18:12:23,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:23,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 18:12:23,687 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:23,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 18:12:23,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:23,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 18:12:23,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-28 18:12:23,688 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 5 states. [2020-07-28 18:12:23,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:23,764 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2020-07-28 18:12:23,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 18:12:23,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-28 18:12:23,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:23,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:12:23,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2020-07-28 18:12:23,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:12:23,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2020-07-28 18:12:23,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2020-07-28 18:12:23,818 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:23,819 INFO L225 Difference]: With dead ends: 24 [2020-07-28 18:12:23,819 INFO L226 Difference]: Without dead ends: 17 [2020-07-28 18:12:23,821 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-28 18:12:23,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-07-28 18:12:23,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2020-07-28 18:12:23,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:23,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 16 states. [2020-07-28 18:12:23,838 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 16 states. [2020-07-28 18:12:23,838 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 16 states. [2020-07-28 18:12:23,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:23,840 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2020-07-28 18:12:23,840 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2020-07-28 18:12:23,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:23,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:23,841 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 17 states. [2020-07-28 18:12:23,841 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 17 states. [2020-07-28 18:12:23,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:23,843 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2020-07-28 18:12:23,843 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2020-07-28 18:12:23,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:23,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:23,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:23,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:23,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-28 18:12:23,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2020-07-28 18:12:23,846 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2020-07-28 18:12:23,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:23,846 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2020-07-28 18:12:23,846 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 18:12:23,847 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2020-07-28 18:12:23,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-28 18:12:23,847 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:23,847 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1] [2020-07-28 18:12:24,054 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:24,055 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:24,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:24,055 INFO L82 PathProgramCache]: Analyzing trace with hash 2107466330, now seen corresponding path program 2 times [2020-07-28 18:12:24,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:24,056 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987098852] [2020-07-28 18:12:24,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:24,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:24,326 INFO L280 TraceCheckUtils]: 0: Hoare triple {534#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~i~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~n~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;main_~sn~0 := 0;main_~i~0 := 1; {536#(and (<= (+ ULTIMATE.start_main_~sn~0 2) (* 2 ULTIMATE.start_main_~i~0)) (<= (* 2 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~sn~0 2)))} is VALID [2020-07-28 18:12:24,328 INFO L280 TraceCheckUtils]: 1: Hoare triple {536#(and (<= (+ ULTIMATE.start_main_~sn~0 2) (* 2 ULTIMATE.start_main_~i~0)) (<= (* 2 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~sn~0 2)))} assume !!(main_~i~0 <= main_~n~0);main_~sn~0 := 2 + main_~sn~0; {537#(and (<= (* 2 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~sn~0) (<= ULTIMATE.start_main_~sn~0 (* 2 ULTIMATE.start_main_~i~0)))} is VALID [2020-07-28 18:12:24,329 INFO L280 TraceCheckUtils]: 2: Hoare triple {537#(and (<= (* 2 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~sn~0) (<= ULTIMATE.start_main_~sn~0 (* 2 ULTIMATE.start_main_~i~0)))} assume !(4 == main_~i~0); {537#(and (<= (* 2 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~sn~0) (<= ULTIMATE.start_main_~sn~0 (* 2 ULTIMATE.start_main_~i~0)))} is VALID [2020-07-28 18:12:24,330 INFO L280 TraceCheckUtils]: 3: Hoare triple {537#(and (<= (* 2 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~sn~0) (<= ULTIMATE.start_main_~sn~0 (* 2 ULTIMATE.start_main_~i~0)))} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {536#(and (<= (+ ULTIMATE.start_main_~sn~0 2) (* 2 ULTIMATE.start_main_~i~0)) (<= (* 2 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~sn~0 2)))} is VALID [2020-07-28 18:12:24,331 INFO L280 TraceCheckUtils]: 4: Hoare triple {536#(and (<= (+ ULTIMATE.start_main_~sn~0 2) (* 2 ULTIMATE.start_main_~i~0)) (<= (* 2 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~sn~0 2)))} assume !!(main_~i~0 <= main_~n~0);main_~sn~0 := 2 + main_~sn~0; {537#(and (<= (* 2 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~sn~0) (<= ULTIMATE.start_main_~sn~0 (* 2 ULTIMATE.start_main_~i~0)))} is VALID [2020-07-28 18:12:24,331 INFO L280 TraceCheckUtils]: 5: Hoare triple {537#(and (<= (* 2 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~sn~0) (<= ULTIMATE.start_main_~sn~0 (* 2 ULTIMATE.start_main_~i~0)))} assume !(4 == main_~i~0); {537#(and (<= (* 2 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~sn~0) (<= ULTIMATE.start_main_~sn~0 (* 2 ULTIMATE.start_main_~i~0)))} is VALID [2020-07-28 18:12:24,332 INFO L280 TraceCheckUtils]: 6: Hoare triple {537#(and (<= (* 2 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~sn~0) (<= ULTIMATE.start_main_~sn~0 (* 2 ULTIMATE.start_main_~i~0)))} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {536#(and (<= (+ ULTIMATE.start_main_~sn~0 2) (* 2 ULTIMATE.start_main_~i~0)) (<= (* 2 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~sn~0 2)))} is VALID [2020-07-28 18:12:24,333 INFO L280 TraceCheckUtils]: 7: Hoare triple {536#(and (<= (+ ULTIMATE.start_main_~sn~0 2) (* 2 ULTIMATE.start_main_~i~0)) (<= (* 2 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~sn~0 2)))} assume !!(main_~i~0 <= main_~n~0);main_~sn~0 := 2 + main_~sn~0; {538#(and (or (<= (* 2 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~sn~0) (<= (* 2 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~sn~0)) (<= ULTIMATE.start_main_~sn~0 (* 2 ULTIMATE.start_main_~n~0)))} is VALID [2020-07-28 18:12:24,339 INFO L280 TraceCheckUtils]: 8: Hoare triple {538#(and (or (<= (* 2 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~sn~0) (<= (* 2 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~sn~0)) (<= ULTIMATE.start_main_~sn~0 (* 2 ULTIMATE.start_main_~n~0)))} assume !(4 == main_~i~0); {538#(and (or (<= (* 2 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~sn~0) (<= (* 2 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~sn~0)) (<= ULTIMATE.start_main_~sn~0 (* 2 ULTIMATE.start_main_~n~0)))} is VALID [2020-07-28 18:12:24,340 INFO L280 TraceCheckUtils]: 9: Hoare triple {538#(and (or (<= (* 2 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~sn~0) (<= (* 2 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~sn~0)) (<= ULTIMATE.start_main_~sn~0 (* 2 ULTIMATE.start_main_~n~0)))} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {539#(and (or (<= (* 2 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~sn~0 2)) (<= (* 2 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~sn~0)) (<= ULTIMATE.start_main_~sn~0 (* 2 ULTIMATE.start_main_~n~0)))} is VALID [2020-07-28 18:12:24,341 INFO L280 TraceCheckUtils]: 10: Hoare triple {539#(and (or (<= (* 2 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~sn~0 2)) (<= (* 2 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~sn~0)) (<= ULTIMATE.start_main_~sn~0 (* 2 ULTIMATE.start_main_~n~0)))} assume !(main_~i~0 <= main_~n~0); {540#(and (<= (* 2 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~sn~0) (<= ULTIMATE.start_main_~sn~0 (* 2 ULTIMATE.start_main_~n~0)))} is VALID [2020-07-28 18:12:24,342 INFO L280 TraceCheckUtils]: 11: Hoare triple {540#(and (<= (* 2 ULTIMATE.start_main_~n~0) ULTIMATE.start_main_~sn~0) (<= ULTIMATE.start_main_~sn~0 (* 2 ULTIMATE.start_main_~n~0)))} __VERIFIER_assert_#in~cond := (if main_~sn~0 == 2 * main_~n~0 || 0 == main_~sn~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {541#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 18:12:24,343 INFO L280 TraceCheckUtils]: 12: Hoare triple {541#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {535#false} is VALID [2020-07-28 18:12:24,343 INFO L280 TraceCheckUtils]: 13: Hoare triple {535#false} assume !false; {535#false} is VALID [2020-07-28 18:12:24,344 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-28 18:12:24,344 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987098852] [2020-07-28 18:12:24,344 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274826090] [2020-07-28 18:12:24,344 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-28 18:12:24,367 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-28 18:12:24,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 18:12:24,368 WARN L261 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 20 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:24,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:24,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:12:24,671 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 18:12:24,713 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-28 18:12:24,773 INFO L280 TraceCheckUtils]: 0: Hoare triple {534#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~i~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~n~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;main_~sn~0 := 0;main_~i~0 := 1; {545#(and (= 1 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~sn~0))} is VALID [2020-07-28 18:12:24,774 INFO L280 TraceCheckUtils]: 1: Hoare triple {545#(and (= 1 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~sn~0))} assume !!(main_~i~0 <= main_~n~0);main_~sn~0 := 2 + main_~sn~0; {549#(and (= 2 ULTIMATE.start_main_~sn~0) (= 1 ULTIMATE.start_main_~i~0))} is VALID [2020-07-28 18:12:24,775 INFO L280 TraceCheckUtils]: 2: Hoare triple {549#(and (= 2 ULTIMATE.start_main_~sn~0) (= 1 ULTIMATE.start_main_~i~0))} assume !(4 == main_~i~0); {549#(and (= 2 ULTIMATE.start_main_~sn~0) (= 1 ULTIMATE.start_main_~i~0))} is VALID [2020-07-28 18:12:24,775 INFO L280 TraceCheckUtils]: 3: Hoare triple {549#(and (= 2 ULTIMATE.start_main_~sn~0) (= 1 ULTIMATE.start_main_~i~0))} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {556#(and (= 2 ULTIMATE.start_main_~i~0) (= 2 ULTIMATE.start_main_~sn~0))} is VALID [2020-07-28 18:12:24,777 INFO L280 TraceCheckUtils]: 4: Hoare triple {556#(and (= 2 ULTIMATE.start_main_~i~0) (= 2 ULTIMATE.start_main_~sn~0))} assume !!(main_~i~0 <= main_~n~0);main_~sn~0 := 2 + main_~sn~0; {560#(and (= 2 ULTIMATE.start_main_~i~0) (= ULTIMATE.start_main_~sn~0 4))} is VALID [2020-07-28 18:12:24,778 INFO L280 TraceCheckUtils]: 5: Hoare triple {560#(and (= 2 ULTIMATE.start_main_~i~0) (= ULTIMATE.start_main_~sn~0 4))} assume !(4 == main_~i~0); {560#(and (= 2 ULTIMATE.start_main_~i~0) (= ULTIMATE.start_main_~sn~0 4))} is VALID [2020-07-28 18:12:24,779 INFO L280 TraceCheckUtils]: 6: Hoare triple {560#(and (= 2 ULTIMATE.start_main_~i~0) (= ULTIMATE.start_main_~sn~0 4))} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {567#(and (= ULTIMATE.start_main_~sn~0 4) (= 3 ULTIMATE.start_main_~i~0))} is VALID [2020-07-28 18:12:24,780 INFO L280 TraceCheckUtils]: 7: Hoare triple {567#(and (= ULTIMATE.start_main_~sn~0 4) (= 3 ULTIMATE.start_main_~i~0))} assume !!(main_~i~0 <= main_~n~0);main_~sn~0 := 2 + main_~sn~0; {571#(and (= 6 ULTIMATE.start_main_~sn~0) (<= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0) (= 3 ULTIMATE.start_main_~i~0))} is VALID [2020-07-28 18:12:24,781 INFO L280 TraceCheckUtils]: 8: Hoare triple {571#(and (= 6 ULTIMATE.start_main_~sn~0) (<= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0) (= 3 ULTIMATE.start_main_~i~0))} assume !(4 == main_~i~0); {571#(and (= 6 ULTIMATE.start_main_~sn~0) (<= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0) (= 3 ULTIMATE.start_main_~i~0))} is VALID [2020-07-28 18:12:24,788 INFO L280 TraceCheckUtils]: 9: Hoare triple {571#(and (= 6 ULTIMATE.start_main_~sn~0) (<= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0) (= 3 ULTIMATE.start_main_~i~0))} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {578#(and (<= ULTIMATE.start_main_~i~0 4) (= 6 ULTIMATE.start_main_~sn~0) (<= 3 ULTIMATE.start_main_~n~0))} is VALID [2020-07-28 18:12:24,789 INFO L280 TraceCheckUtils]: 10: Hoare triple {578#(and (<= ULTIMATE.start_main_~i~0 4) (= 6 ULTIMATE.start_main_~sn~0) (<= 3 ULTIMATE.start_main_~n~0))} assume !(main_~i~0 <= main_~n~0); {582#(and (= 6 ULTIMATE.start_main_~sn~0) (<= 3 ULTIMATE.start_main_~n~0) (<= ULTIMATE.start_main_~n~0 3))} is VALID [2020-07-28 18:12:24,790 INFO L280 TraceCheckUtils]: 11: Hoare triple {582#(and (= 6 ULTIMATE.start_main_~sn~0) (<= 3 ULTIMATE.start_main_~n~0) (<= ULTIMATE.start_main_~n~0 3))} __VERIFIER_assert_#in~cond := (if main_~sn~0 == 2 * main_~n~0 || 0 == main_~sn~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {586#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2020-07-28 18:12:24,791 INFO L280 TraceCheckUtils]: 12: Hoare triple {586#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {535#false} is VALID [2020-07-28 18:12:24,791 INFO L280 TraceCheckUtils]: 13: Hoare triple {535#false} assume !false; {535#false} is VALID [2020-07-28 18:12:24,792 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:24,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:12:24,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 16 [2020-07-28 18:12:24,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106290381] [2020-07-28 18:12:24,795 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 14 [2020-07-28 18:12:24,795 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:24,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-28 18:12:24,829 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:24,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-28 18:12:24,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:24,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-28 18:12:24,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2020-07-28 18:12:24,830 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 17 states. [2020-07-28 18:12:25,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:25,708 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2020-07-28 18:12:25,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-28 18:12:25,709 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 14 [2020-07-28 18:12:25,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:25,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-28 18:12:25,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 30 transitions. [2020-07-28 18:12:25,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-28 18:12:25,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 30 transitions. [2020-07-28 18:12:25,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 30 transitions. [2020-07-28 18:12:25,754 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:25,756 INFO L225 Difference]: With dead ends: 27 [2020-07-28 18:12:25,756 INFO L226 Difference]: Without dead ends: 21 [2020-07-28 18:12:25,758 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2020-07-28 18:12:25,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-28 18:12:25,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2020-07-28 18:12:25,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:25,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 19 states. [2020-07-28 18:12:25,789 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 19 states. [2020-07-28 18:12:25,789 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 19 states. [2020-07-28 18:12:25,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:25,791 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2020-07-28 18:12:25,793 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2020-07-28 18:12:25,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:25,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:25,794 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 21 states. [2020-07-28 18:12:25,794 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 21 states. [2020-07-28 18:12:25,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:25,796 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2020-07-28 18:12:25,796 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2020-07-28 18:12:25,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:25,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:25,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:25,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:25,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-28 18:12:25,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2020-07-28 18:12:25,799 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 14 [2020-07-28 18:12:25,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:25,799 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-07-28 18:12:25,799 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-28 18:12:25,799 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-28 18:12:25,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-28 18:12:25,800 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:25,800 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1] [2020-07-28 18:12:26,004 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:26,004 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:26,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:26,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1236497329, now seen corresponding path program 3 times [2020-07-28 18:12:26,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:26,005 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339134118] [2020-07-28 18:12:26,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 18:12:26,031 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 18:12:26,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 18:12:26,068 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 18:12:26,090 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-28 18:12:26,090 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 18:12:26,091 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-28 18:12:26,121 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 18:12:26,121 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-28 18:12:26,122 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-28 18:12:26,122 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-28 18:12:26,122 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2020-07-28 18:12:26,122 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-28 18:12:26,122 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-28 18:12:26,122 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-28 18:12:26,123 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-28 18:12:26,123 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2020-07-28 18:12:26,123 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-28 18:12:26,123 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-28 18:12:26,123 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-28 18:12:26,124 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:12:26,124 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 18:12:26,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 06:12:26 BoogieIcfgContainer [2020-07-28 18:12:26,128 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 18:12:26,128 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 18:12:26,128 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 18:12:26,129 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 18:12:26,129 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:12:20" (3/4) ... [2020-07-28 18:12:26,134 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-28 18:12:26,217 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 18:12:26,217 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 18:12:26,220 INFO L168 Benchmark]: Toolchain (without parser) took 6477.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 207.1 MB). Free memory was 957.6 MB in the beginning and 937.5 MB in the end (delta: 20.1 MB). Peak memory consumption was 227.2 MB. Max. memory is 11.5 GB. [2020-07-28 18:12:26,221 INFO L168 Benchmark]: CDTParser took 0.84 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:12:26,221 INFO L168 Benchmark]: CACSL2BoogieTranslator took 239.07 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 946.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:12:26,226 INFO L168 Benchmark]: Boogie Procedure Inliner took 112.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -197.1 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:12:26,227 INFO L168 Benchmark]: Boogie Preprocessor took 36.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-28 18:12:26,232 INFO L168 Benchmark]: RCFGBuilder took 333.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 11.5 GB. [2020-07-28 18:12:26,233 INFO L168 Benchmark]: TraceAbstraction took 5659.26 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.8 MB). Free memory was 1.1 GB in the beginning and 944.8 MB in the end (delta: 173.5 MB). Peak memory consumption was 233.3 MB. Max. memory is 11.5 GB. [2020-07-28 18:12:26,233 INFO L168 Benchmark]: Witness Printer took 88.97 ms. Allocated memory is still 1.2 GB. Free memory was 944.8 MB in the beginning and 937.5 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. [2020-07-28 18:12:26,237 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.84 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 239.07 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 946.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 112.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -197.1 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 333.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5659.26 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.8 MB). Free memory was 1.1 GB in the beginning and 944.8 MB in the end (delta: 173.5 MB). Peak memory consumption was 233.3 MB. Max. memory is 11.5 GB. * Witness Printer took 88.97 ms. Allocated memory is still 1.2 GB. Free memory was 944.8 MB in the beginning and 937.5 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L13] i=1 [L13] COND TRUE i<=n [L14] sn = sn + (2) [L15] COND FALSE !(i==4) [L13] i++ [L13] COND TRUE i<=n [L14] sn = sn + (2) [L15] COND FALSE !(i==4) [L13] i++ [L13] COND TRUE i<=n [L14] sn = sn + (2) [L15] COND FALSE !(i==4) [L13] i++ [L13] COND TRUE i<=n [L14] sn = sn + (2) [L15] COND TRUE i==4 [L15] sn=-10 [L13] i++ [L13] COND FALSE !(i<=n) [L4] COND TRUE !(cond) [L5] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.5s, OverallIterations: 8, TraceHistogramMax: 4, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 43 SDtfs, 32 SDslu, 63 SDs, 0 SdLazy, 279 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 101 ConstructedInterpolants, 0 QuantifiedInterpolants, 5555 SizeOfPredicates, 12 NumberOfNonLiveVariables, 124 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 22/61 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...