./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/sum01_bug02.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.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 c5465a084053aead702161d951dd339bfa1665d5 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:12,085 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 18:12:12,088 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 18:12:12,106 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 18:12:12,106 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 18:12:12,108 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 18:12:12,111 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 18:12:12,121 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 18:12:12,126 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 18:12:12,130 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 18:12:12,132 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 18:12:12,134 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 18:12:12,134 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 18:12:12,138 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 18:12:12,139 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 18:12:12,140 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 18:12:12,142 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 18:12:12,143 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 18:12:12,146 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 18:12:12,150 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 18:12:12,155 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 18:12:12,158 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 18:12:12,161 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 18:12:12,162 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 18:12:12,165 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 18:12:12,165 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 18:12:12,165 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 18:12:12,167 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 18:12:12,168 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 18:12:12,169 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 18:12:12,169 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 18:12:12,170 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 18:12:12,171 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 18:12:12,172 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 18:12:12,174 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 18:12:12,174 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 18:12:12,175 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 18:12:12,175 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 18:12:12,175 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 18:12:12,176 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 18:12:12,177 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 18:12:12,178 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:12,202 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 18:12:12,203 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 18:12:12,204 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 18:12:12,209 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 18:12:12,209 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 18:12:12,209 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 18:12:12,210 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 18:12:12,210 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 18:12:12,210 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 18:12:12,210 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 18:12:12,210 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 18:12:12,211 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 18:12:12,211 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 18:12:12,211 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 18:12:12,211 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 18:12:12,213 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 18:12:12,214 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 18:12:12,214 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 18:12:12,214 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 18:12:12,215 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 18:12:12,216 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 18:12:12,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:12:12,216 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 18:12:12,217 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 18:12:12,217 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 18:12:12,217 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 18:12:12,217 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 18:12:12,218 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 18:12:12,218 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 18:12:12,218 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 -> c5465a084053aead702161d951dd339bfa1665d5 [2020-07-28 18:12:12,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 18:12:12,529 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 18:12:12,533 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 18:12:12,534 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 18:12:12,535 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 18:12:12,535 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/sum01_bug02.i [2020-07-28 18:12:12,591 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a108eb48f/917dc0482d0941828de8f7b87068bfd8/FLAG8bd858b53 [2020-07-28 18:12:12,970 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 18:12:12,971 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/sum01_bug02.i [2020-07-28 18:12:12,976 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a108eb48f/917dc0482d0941828de8f7b87068bfd8/FLAG8bd858b53 [2020-07-28 18:12:13,339 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a108eb48f/917dc0482d0941828de8f7b87068bfd8 [2020-07-28 18:12:13,342 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 18:12:13,346 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 18:12:13,348 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 18:12:13,348 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 18:12:13,352 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 18:12:13,353 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:12:13" (1/1) ... [2020-07-28 18:12:13,357 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71c4e9fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:13, skipping insertion in model container [2020-07-28 18:12:13,357 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:12:13" (1/1) ... [2020-07-28 18:12:13,366 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 18:12:13,386 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 18:12:13,543 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:12:13,547 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 18:12:13,564 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:12:13,579 INFO L208 MainTranslator]: Completed translation [2020-07-28 18:12:13,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:13 WrapperNode [2020-07-28 18:12:13,580 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 18:12:13,581 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 18:12:13,581 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 18:12:13,581 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 18:12:13,590 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:13" (1/1) ... [2020-07-28 18:12:13,596 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:13" (1/1) ... [2020-07-28 18:12:13,618 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 18:12:13,619 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 18:12:13,619 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 18:12:13,619 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 18:12:13,688 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:13" (1/1) ... [2020-07-28 18:12:13,689 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:13" (1/1) ... [2020-07-28 18:12:13,690 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:13" (1/1) ... [2020-07-28 18:12:13,690 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:13" (1/1) ... [2020-07-28 18:12:13,697 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:13" (1/1) ... [2020-07-28 18:12:13,706 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:13" (1/1) ... [2020-07-28 18:12:13,712 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:13" (1/1) ... [2020-07-28 18:12:13,714 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 18:12:13,714 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 18:12:13,715 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 18:12:13,715 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 18:12:13,716 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:13" (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:13,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 18:12:13,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 18:12:14,058 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 18:12:14,059 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-28 18:12:14,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:12:14 BoogieIcfgContainer [2020-07-28 18:12:14,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 18:12:14,064 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 18:12:14,064 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 18:12:14,067 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 18:12:14,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 06:12:13" (1/3) ... [2020-07-28 18:12:14,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e7eb27a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:12:14, skipping insertion in model container [2020-07-28 18:12:14,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:13" (2/3) ... [2020-07-28 18:12:14,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e7eb27a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:12:14, skipping insertion in model container [2020-07-28 18:12:14,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:12:14" (3/3) ... [2020-07-28 18:12:14,072 INFO L109 eAbstractionObserver]: Analyzing ICFG sum01_bug02.i [2020-07-28 18:12:14,084 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 18:12:14,091 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 18:12:14,108 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 18:12:14,134 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 18:12:14,134 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 18:12:14,134 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 18:12:14,135 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 18:12:14,135 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 18:12:14,135 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 18:12:14,135 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 18:12:14,135 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 18:12:14,152 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2020-07-28 18:12:14,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-28 18:12:14,159 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:14,160 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-28 18:12:14,160 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:14,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:14,167 INFO L82 PathProgramCache]: Analyzing trace with hash 30170436, now seen corresponding path program 1 times [2020-07-28 18:12:14,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:14,178 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026473359] [2020-07-28 18:12:14,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:14,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:14,335 INFO L280 TraceCheckUtils]: 0: Hoare triple {15#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post2, main_#t~post1, main_~i~0, main_~j~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~j~0 := 10;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; {15#true} is VALID [2020-07-28 18:12:14,346 INFO L280 TraceCheckUtils]: 1: Hoare triple {15#true} assume !true; {16#false} is VALID [2020-07-28 18:12:14,347 INFO L280 TraceCheckUtils]: 2: Hoare triple {16#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; {16#false} is VALID [2020-07-28 18:12:14,347 INFO L280 TraceCheckUtils]: 3: Hoare triple {16#false} assume 0 == __VERIFIER_assert_~cond; {16#false} is VALID [2020-07-28 18:12:14,347 INFO L280 TraceCheckUtils]: 4: Hoare triple {16#false} assume !false; {16#false} is VALID [2020-07-28 18:12:14,351 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:14,352 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026473359] [2020-07-28 18:12:14,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:12:14,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 18:12:14,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446474897] [2020-07-28 18:12:14,362 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2020-07-28 18:12:14,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:14,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 18:12:14,414 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:14,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 18:12:14,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:14,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 18:12:14,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 18:12:14,428 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2020-07-28 18:12:14,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:14,474 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2020-07-28 18:12:14,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 18:12:14,475 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2020-07-28 18:12:14,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:14,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 18:12:14,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 22 transitions. [2020-07-28 18:12:14,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 18:12:14,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 22 transitions. [2020-07-28 18:12:14,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 22 transitions. [2020-07-28 18:12:14,544 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:14,554 INFO L225 Difference]: With dead ends: 19 [2020-07-28 18:12:14,555 INFO L226 Difference]: Without dead ends: 9 [2020-07-28 18:12:14,559 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:14,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2020-07-28 18:12:14,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-07-28 18:12:14,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:14,598 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 9 states. [2020-07-28 18:12:14,599 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2020-07-28 18:12:14,599 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2020-07-28 18:12:14,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:14,602 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2020-07-28 18:12:14,602 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2020-07-28 18:12:14,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:14,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:14,603 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2020-07-28 18:12:14,604 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2020-07-28 18:12:14,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:14,606 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2020-07-28 18:12:14,607 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2020-07-28 18:12:14,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:14,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:14,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:14,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:14,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 18:12:14,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2020-07-28 18:12:14,613 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 5 [2020-07-28 18:12:14,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:14,613 INFO L479 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-07-28 18:12:14,614 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 18:12:14,614 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2020-07-28 18:12:14,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-28 18:12:14,615 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:14,615 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-28 18:12:14,615 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 18:12:14,616 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:14,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:14,616 INFO L82 PathProgramCache]: Analyzing trace with hash 29783153, now seen corresponding path program 1 times [2020-07-28 18:12:14,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:14,617 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289430083] [2020-07-28 18:12:14,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:14,705 INFO L280 TraceCheckUtils]: 0: Hoare triple {69#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post2, main_#t~post1, main_~i~0, main_~j~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~j~0 := 10;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; {71#(= 0 ULTIMATE.start_main_~sn~0)} is VALID [2020-07-28 18:12:14,707 INFO L280 TraceCheckUtils]: 1: Hoare triple {71#(= 0 ULTIMATE.start_main_~sn~0)} assume !(main_~i~0 <= main_~n~0); {71#(= 0 ULTIMATE.start_main_~sn~0)} is VALID [2020-07-28 18:12:14,709 INFO L280 TraceCheckUtils]: 2: Hoare triple {71#(= 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; {72#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 18:12:14,710 INFO L280 TraceCheckUtils]: 3: Hoare triple {72#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {70#false} is VALID [2020-07-28 18:12:14,711 INFO L280 TraceCheckUtils]: 4: Hoare triple {70#false} assume !false; {70#false} is VALID [2020-07-28 18:12:14,711 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:14,712 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289430083] [2020-07-28 18:12:14,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:12:14,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 18:12:14,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124937412] [2020-07-28 18:12:14,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-28 18:12:14,715 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:14,715 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 18:12:14,725 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:14,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 18:12:14,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:14,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 18:12:14,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 18:12:14,727 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 4 states. [2020-07-28 18:12:14,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:14,800 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-07-28 18:12:14,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 18:12:14,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-28 18:12:14,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:14,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:12:14,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2020-07-28 18:12:14,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:12:14,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2020-07-28 18:12:14,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 19 transitions. [2020-07-28 18:12:14,840 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:14,841 INFO L225 Difference]: With dead ends: 17 [2020-07-28 18:12:14,842 INFO L226 Difference]: Without dead ends: 13 [2020-07-28 18:12:14,843 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:14,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-07-28 18:12:14,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-28 18:12:14,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:14,848 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2020-07-28 18:12:14,849 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2020-07-28 18:12:14,849 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2020-07-28 18:12:14,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:14,851 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2020-07-28 18:12:14,851 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2020-07-28 18:12:14,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:14,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:14,852 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2020-07-28 18:12:14,853 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2020-07-28 18:12:14,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:14,855 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2020-07-28 18:12:14,855 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2020-07-28 18:12:14,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:14,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:14,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:14,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:14,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-28 18:12:14,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2020-07-28 18:12:14,858 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 5 [2020-07-28 18:12:14,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:14,859 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2020-07-28 18:12:14,859 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 18:12:14,859 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2020-07-28 18:12:14,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-28 18:12:14,860 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:14,860 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:12:14,860 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 18:12:14,861 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:14,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:14,861 INFO L82 PathProgramCache]: Analyzing trace with hash -963514282, now seen corresponding path program 1 times [2020-07-28 18:12:14,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:14,862 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272914189] [2020-07-28 18:12:14,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:14,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:15,282 INFO L280 TraceCheckUtils]: 0: Hoare triple {137#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post2, main_#t~post1, main_~i~0, main_~j~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~j~0 := 10;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; {139#(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:15,283 INFO L280 TraceCheckUtils]: 1: Hoare triple {139#(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); {140#(and (<= (* 2 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~sn~0 2)) (<= (+ ULTIMATE.start_main_~sn~0 2) (* 2 ULTIMATE.start_main_~n~0)))} is VALID [2020-07-28 18:12:15,285 INFO L280 TraceCheckUtils]: 2: Hoare triple {140#(and (<= (* 2 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~sn~0 2)) (<= (+ ULTIMATE.start_main_~sn~0 2) (* 2 ULTIMATE.start_main_~n~0)))} assume main_~i~0 < main_~j~0;main_~sn~0 := 2 + main_~sn~0; {141#(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:15,286 INFO L280 TraceCheckUtils]: 3: Hoare triple {141#(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~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2; {141#(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:15,288 INFO L280 TraceCheckUtils]: 4: Hoare triple {141#(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; {142#(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:15,290 INFO L280 TraceCheckUtils]: 5: Hoare triple {142#(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); {143#(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:15,292 INFO L280 TraceCheckUtils]: 6: Hoare triple {143#(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; {144#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 18:12:15,293 INFO L280 TraceCheckUtils]: 7: Hoare triple {144#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {138#false} is VALID [2020-07-28 18:12:15,293 INFO L280 TraceCheckUtils]: 8: Hoare triple {138#false} assume !false; {138#false} is VALID [2020-07-28 18:12:15,295 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:15,295 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272914189] [2020-07-28 18:12:15,296 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038905794] [2020-07-28 18:12:15,296 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:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:15,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-28 18:12:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:15,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:12:15,663 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 18:12:15,698 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-28 18:12:15,768 INFO L280 TraceCheckUtils]: 0: Hoare triple {137#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post2, main_#t~post1, main_~i~0, main_~j~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~j~0 := 10;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; {148#(and (= 1 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~sn~0))} is VALID [2020-07-28 18:12:15,769 INFO L280 TraceCheckUtils]: 1: Hoare triple {148#(and (= 1 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~sn~0))} assume !!(main_~i~0 <= main_~n~0); {152#(and (= 1 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0) (= 0 ULTIMATE.start_main_~sn~0))} is VALID [2020-07-28 18:12:15,771 INFO L280 TraceCheckUtils]: 2: Hoare triple {152#(and (= 1 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0) (= 0 ULTIMATE.start_main_~sn~0))} assume main_~i~0 < main_~j~0;main_~sn~0 := 2 + main_~sn~0; {156#(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:15,772 INFO L280 TraceCheckUtils]: 3: Hoare triple {156#(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~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2; {156#(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:15,773 INFO L280 TraceCheckUtils]: 4: Hoare triple {156#(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; {163#(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:15,776 INFO L280 TraceCheckUtils]: 5: Hoare triple {163#(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); {167#(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:15,778 INFO L280 TraceCheckUtils]: 6: Hoare triple {167#(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; {171#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2020-07-28 18:12:15,779 INFO L280 TraceCheckUtils]: 7: Hoare triple {171#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {138#false} is VALID [2020-07-28 18:12:15,779 INFO L280 TraceCheckUtils]: 8: Hoare triple {138#false} assume !false; {138#false} is VALID [2020-07-28 18:12:15,780 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:15,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:12:15,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2020-07-28 18:12:15,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238703979] [2020-07-28 18:12:15,782 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 9 [2020-07-28 18:12:15,783 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:15,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-28 18:12:15,823 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:15,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-28 18:12:15,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:15,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-28 18:12:15,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2020-07-28 18:12:15,824 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 14 states. [2020-07-28 18:12:16,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:16,417 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-07-28 18:12:16,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-28 18:12:16,418 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 9 [2020-07-28 18:12:16,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:16,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-28 18:12:16,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 36 transitions. [2020-07-28 18:12:16,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-28 18:12:16,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 36 transitions. [2020-07-28 18:12:16,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 36 transitions. [2020-07-28 18:12:16,477 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:16,479 INFO L225 Difference]: With dead ends: 35 [2020-07-28 18:12:16,479 INFO L226 Difference]: Without dead ends: 29 [2020-07-28 18:12:16,480 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2020-07-28 18:12:16,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-28 18:12:16,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2020-07-28 18:12:16,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:16,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 22 states. [2020-07-28 18:12:16,493 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 22 states. [2020-07-28 18:12:16,493 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 22 states. [2020-07-28 18:12:16,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:16,496 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2020-07-28 18:12:16,496 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2020-07-28 18:12:16,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:16,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:16,497 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 29 states. [2020-07-28 18:12:16,498 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 29 states. [2020-07-28 18:12:16,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:16,500 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2020-07-28 18:12:16,501 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2020-07-28 18:12:16,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:16,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:16,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:16,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:16,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-28 18:12:16,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2020-07-28 18:12:16,504 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 9 [2020-07-28 18:12:16,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:16,504 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2020-07-28 18:12:16,505 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-28 18:12:16,505 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2020-07-28 18:12:16,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-28 18:12:16,506 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:16,506 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:12:16,719 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-28 18:12:16,720 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:16,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:16,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1771006013, now seen corresponding path program 1 times [2020-07-28 18:12:16,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:16,723 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820594670] [2020-07-28 18:12:16,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:16,803 INFO L280 TraceCheckUtils]: 0: Hoare triple {312#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post2, main_#t~post1, main_~i~0, main_~j~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~j~0 := 10;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; {314#(<= (+ ULTIMATE.start_main_~i~0 9) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:16,804 INFO L280 TraceCheckUtils]: 1: Hoare triple {314#(<= (+ ULTIMATE.start_main_~i~0 9) ULTIMATE.start_main_~j~0)} assume !!(main_~i~0 <= main_~n~0); {314#(<= (+ ULTIMATE.start_main_~i~0 9) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:16,805 INFO L280 TraceCheckUtils]: 2: Hoare triple {314#(<= (+ ULTIMATE.start_main_~i~0 9) ULTIMATE.start_main_~j~0)} assume main_~i~0 < main_~j~0;main_~sn~0 := 2 + main_~sn~0; {314#(<= (+ ULTIMATE.start_main_~i~0 9) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:16,806 INFO L280 TraceCheckUtils]: 3: Hoare triple {314#(<= (+ ULTIMATE.start_main_~i~0 9) ULTIMATE.start_main_~j~0)} main_#t~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2; {315#(<= (+ ULTIMATE.start_main_~i~0 8) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:16,807 INFO L280 TraceCheckUtils]: 4: Hoare triple {315#(<= (+ ULTIMATE.start_main_~i~0 8) ULTIMATE.start_main_~j~0)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {316#(<= (+ ULTIMATE.start_main_~i~0 7) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:16,808 INFO L280 TraceCheckUtils]: 5: Hoare triple {316#(<= (+ ULTIMATE.start_main_~i~0 7) ULTIMATE.start_main_~j~0)} assume !!(main_~i~0 <= main_~n~0); {316#(<= (+ ULTIMATE.start_main_~i~0 7) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:16,811 INFO L280 TraceCheckUtils]: 6: Hoare triple {316#(<= (+ ULTIMATE.start_main_~i~0 7) ULTIMATE.start_main_~j~0)} assume !(main_~i~0 < main_~j~0); {313#false} is VALID [2020-07-28 18:12:16,811 INFO L280 TraceCheckUtils]: 7: Hoare triple {313#false} main_#t~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2; {313#false} is VALID [2020-07-28 18:12:16,812 INFO L280 TraceCheckUtils]: 8: Hoare triple {313#false} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {313#false} is VALID [2020-07-28 18:12:16,812 INFO L280 TraceCheckUtils]: 9: Hoare triple {313#false} assume !(main_~i~0 <= main_~n~0); {313#false} is VALID [2020-07-28 18:12:16,812 INFO L280 TraceCheckUtils]: 10: Hoare triple {313#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; {313#false} is VALID [2020-07-28 18:12:16,812 INFO L280 TraceCheckUtils]: 11: Hoare triple {313#false} assume 0 == __VERIFIER_assert_~cond; {313#false} is VALID [2020-07-28 18:12:16,813 INFO L280 TraceCheckUtils]: 12: Hoare triple {313#false} assume !false; {313#false} is VALID [2020-07-28 18:12:16,814 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:16,815 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820594670] [2020-07-28 18:12:16,815 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823933646] [2020-07-28 18:12:16,815 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:16,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:16,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-28 18:12:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:16,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:12:17,000 INFO L280 TraceCheckUtils]: 0: Hoare triple {312#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post2, main_#t~post1, main_~i~0, main_~j~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~j~0 := 10;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; {320#(and (<= ULTIMATE.start_main_~i~0 1) (<= 10 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:12:17,002 INFO L280 TraceCheckUtils]: 1: Hoare triple {320#(and (<= ULTIMATE.start_main_~i~0 1) (<= 10 ULTIMATE.start_main_~j~0))} assume !!(main_~i~0 <= main_~n~0); {320#(and (<= ULTIMATE.start_main_~i~0 1) (<= 10 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:12:17,003 INFO L280 TraceCheckUtils]: 2: Hoare triple {320#(and (<= ULTIMATE.start_main_~i~0 1) (<= 10 ULTIMATE.start_main_~j~0))} assume main_~i~0 < main_~j~0;main_~sn~0 := 2 + main_~sn~0; {320#(and (<= ULTIMATE.start_main_~i~0 1) (<= 10 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:12:17,004 INFO L280 TraceCheckUtils]: 3: Hoare triple {320#(and (<= ULTIMATE.start_main_~i~0 1) (<= 10 ULTIMATE.start_main_~j~0))} main_#t~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2; {330#(and (<= 9 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-28 18:12:17,005 INFO L280 TraceCheckUtils]: 4: Hoare triple {330#(and (<= 9 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~i~0 1))} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {334#(and (<= ULTIMATE.start_main_~i~0 2) (<= 9 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:12:17,006 INFO L280 TraceCheckUtils]: 5: Hoare triple {334#(and (<= ULTIMATE.start_main_~i~0 2) (<= 9 ULTIMATE.start_main_~j~0))} assume !!(main_~i~0 <= main_~n~0); {334#(and (<= ULTIMATE.start_main_~i~0 2) (<= 9 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:12:17,007 INFO L280 TraceCheckUtils]: 6: Hoare triple {334#(and (<= ULTIMATE.start_main_~i~0 2) (<= 9 ULTIMATE.start_main_~j~0))} assume !(main_~i~0 < main_~j~0); {313#false} is VALID [2020-07-28 18:12:17,007 INFO L280 TraceCheckUtils]: 7: Hoare triple {313#false} main_#t~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2; {313#false} is VALID [2020-07-28 18:12:17,007 INFO L280 TraceCheckUtils]: 8: Hoare triple {313#false} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {313#false} is VALID [2020-07-28 18:12:17,008 INFO L280 TraceCheckUtils]: 9: Hoare triple {313#false} assume !(main_~i~0 <= main_~n~0); {313#false} is VALID [2020-07-28 18:12:17,008 INFO L280 TraceCheckUtils]: 10: Hoare triple {313#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; {313#false} is VALID [2020-07-28 18:12:17,008 INFO L280 TraceCheckUtils]: 11: Hoare triple {313#false} assume 0 == __VERIFIER_assert_~cond; {313#false} is VALID [2020-07-28 18:12:17,009 INFO L280 TraceCheckUtils]: 12: Hoare triple {313#false} assume !false; {313#false} is VALID [2020-07-28 18:12:17,010 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:17,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:12:17,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2020-07-28 18:12:17,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962824357] [2020-07-28 18:12:17,011 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2020-07-28 18:12:17,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:17,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-28 18:12:17,036 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:17,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-28 18:12:17,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:17,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-28 18:12:17,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-07-28 18:12:17,038 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 8 states. [2020-07-28 18:12:17,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:17,154 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2020-07-28 18:12:17,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 18:12:17,155 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2020-07-28 18:12:17,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:17,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 18:12:17,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2020-07-28 18:12:17,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 18:12:17,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2020-07-28 18:12:17,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2020-07-28 18:12:17,212 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:17,213 INFO L225 Difference]: With dead ends: 30 [2020-07-28 18:12:17,213 INFO L226 Difference]: Without dead ends: 18 [2020-07-28 18:12:17,213 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-07-28 18:12:17,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-28 18:12:17,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-28 18:12:17,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:17,228 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2020-07-28 18:12:17,228 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-28 18:12:17,228 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-28 18:12:17,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:17,230 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-07-28 18:12:17,230 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-28 18:12:17,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:17,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:17,231 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-28 18:12:17,231 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-28 18:12:17,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:17,232 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2020-07-28 18:12:17,232 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-28 18:12:17,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:17,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:17,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:17,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:17,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-28 18:12:17,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2020-07-28 18:12:17,234 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2020-07-28 18:12:17,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:17,235 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-07-28 18:12:17,235 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-28 18:12:17,235 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-28 18:12:17,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-28 18:12:17,236 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:17,236 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1] [2020-07-28 18:12:17,447 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:17,448 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:17,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:17,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1276819616, now seen corresponding path program 2 times [2020-07-28 18:12:17,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:17,450 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659935980] [2020-07-28 18:12:17,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:17,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:17,798 INFO L280 TraceCheckUtils]: 0: Hoare triple {452#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post2, main_#t~post1, main_~i~0, main_~j~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~j~0 := 10;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; {454#(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:17,799 INFO L280 TraceCheckUtils]: 1: Hoare triple {454#(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); {454#(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:17,800 INFO L280 TraceCheckUtils]: 2: Hoare triple {454#(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_~j~0;main_~sn~0 := 2 + main_~sn~0; {455#(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:17,801 INFO L280 TraceCheckUtils]: 3: Hoare triple {455#(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~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2; {455#(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:17,802 INFO L280 TraceCheckUtils]: 4: Hoare triple {455#(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; {454#(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:17,803 INFO L280 TraceCheckUtils]: 5: Hoare triple {454#(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); {454#(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:17,805 INFO L280 TraceCheckUtils]: 6: Hoare triple {454#(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_~j~0;main_~sn~0 := 2 + main_~sn~0; {455#(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:17,806 INFO L280 TraceCheckUtils]: 7: Hoare triple {455#(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~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2; {455#(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:17,807 INFO L280 TraceCheckUtils]: 8: Hoare triple {455#(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; {454#(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:17,808 INFO L280 TraceCheckUtils]: 9: Hoare triple {454#(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); {456#(and (<= (* 2 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~sn~0 2)) (<= (+ ULTIMATE.start_main_~sn~0 2) (* 2 ULTIMATE.start_main_~n~0)))} is VALID [2020-07-28 18:12:17,810 INFO L280 TraceCheckUtils]: 10: Hoare triple {456#(and (<= (* 2 ULTIMATE.start_main_~i~0) (+ ULTIMATE.start_main_~sn~0 2)) (<= (+ ULTIMATE.start_main_~sn~0 2) (* 2 ULTIMATE.start_main_~n~0)))} assume main_~i~0 < main_~j~0;main_~sn~0 := 2 + main_~sn~0; {457#(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:17,811 INFO L280 TraceCheckUtils]: 11: Hoare triple {457#(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~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2; {457#(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:17,812 INFO L280 TraceCheckUtils]: 12: Hoare triple {457#(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; {458#(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:17,813 INFO L280 TraceCheckUtils]: 13: Hoare triple {458#(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); {459#(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:17,815 INFO L280 TraceCheckUtils]: 14: Hoare triple {459#(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; {460#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 18:12:17,816 INFO L280 TraceCheckUtils]: 15: Hoare triple {460#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {453#false} is VALID [2020-07-28 18:12:17,816 INFO L280 TraceCheckUtils]: 16: Hoare triple {453#false} assume !false; {453#false} is VALID [2020-07-28 18:12:17,817 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-28 18:12:17,817 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659935980] [2020-07-28 18:12:17,818 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26634253] [2020-07-28 18:12:17,818 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:17,842 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-28 18:12:17,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 18:12:17,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-28 18:12:17,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:17,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:12:18,259 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 18:12:18,297 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-28 18:12:18,362 INFO L280 TraceCheckUtils]: 0: Hoare triple {452#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post2, main_#t~post1, main_~i~0, main_~j~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~j~0 := 10;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; {464#(and (= 1 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~sn~0))} is VALID [2020-07-28 18:12:18,363 INFO L280 TraceCheckUtils]: 1: Hoare triple {464#(and (= 1 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~sn~0))} assume !!(main_~i~0 <= main_~n~0); {464#(and (= 1 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~sn~0))} is VALID [2020-07-28 18:12:18,364 INFO L280 TraceCheckUtils]: 2: Hoare triple {464#(and (= 1 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~sn~0))} assume main_~i~0 < main_~j~0;main_~sn~0 := 2 + main_~sn~0; {471#(and (= ULTIMATE.start_main_~sn~0 2) (= 1 ULTIMATE.start_main_~i~0))} is VALID [2020-07-28 18:12:18,365 INFO L280 TraceCheckUtils]: 3: Hoare triple {471#(and (= ULTIMATE.start_main_~sn~0 2) (= 1 ULTIMATE.start_main_~i~0))} main_#t~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2; {471#(and (= ULTIMATE.start_main_~sn~0 2) (= 1 ULTIMATE.start_main_~i~0))} is VALID [2020-07-28 18:12:18,366 INFO L280 TraceCheckUtils]: 4: Hoare triple {471#(and (= ULTIMATE.start_main_~sn~0 2) (= 1 ULTIMATE.start_main_~i~0))} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {478#(and (= 2 ULTIMATE.start_main_~i~0) (= ULTIMATE.start_main_~sn~0 2))} is VALID [2020-07-28 18:12:18,368 INFO L280 TraceCheckUtils]: 5: Hoare triple {478#(and (= 2 ULTIMATE.start_main_~i~0) (= ULTIMATE.start_main_~sn~0 2))} assume !!(main_~i~0 <= main_~n~0); {478#(and (= 2 ULTIMATE.start_main_~i~0) (= ULTIMATE.start_main_~sn~0 2))} is VALID [2020-07-28 18:12:18,369 INFO L280 TraceCheckUtils]: 6: Hoare triple {478#(and (= 2 ULTIMATE.start_main_~i~0) (= ULTIMATE.start_main_~sn~0 2))} assume main_~i~0 < main_~j~0;main_~sn~0 := 2 + main_~sn~0; {485#(and (= 2 ULTIMATE.start_main_~i~0) (= 4 ULTIMATE.start_main_~sn~0))} is VALID [2020-07-28 18:12:18,370 INFO L280 TraceCheckUtils]: 7: Hoare triple {485#(and (= 2 ULTIMATE.start_main_~i~0) (= 4 ULTIMATE.start_main_~sn~0))} main_#t~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2; {485#(and (= 2 ULTIMATE.start_main_~i~0) (= 4 ULTIMATE.start_main_~sn~0))} is VALID [2020-07-28 18:12:18,371 INFO L280 TraceCheckUtils]: 8: Hoare triple {485#(and (= 2 ULTIMATE.start_main_~i~0) (= 4 ULTIMATE.start_main_~sn~0))} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {492#(and (= 4 ULTIMATE.start_main_~sn~0) (= 3 ULTIMATE.start_main_~i~0))} is VALID [2020-07-28 18:12:18,372 INFO L280 TraceCheckUtils]: 9: Hoare triple {492#(and (= 4 ULTIMATE.start_main_~sn~0) (= 3 ULTIMATE.start_main_~i~0))} assume !!(main_~i~0 <= main_~n~0); {496#(and (<= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0) (= 4 ULTIMATE.start_main_~sn~0) (= 3 ULTIMATE.start_main_~i~0))} is VALID [2020-07-28 18:12:18,373 INFO L280 TraceCheckUtils]: 10: Hoare triple {496#(and (<= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0) (= 4 ULTIMATE.start_main_~sn~0) (= 3 ULTIMATE.start_main_~i~0))} assume main_~i~0 < main_~j~0;main_~sn~0 := 2 + main_~sn~0; {500#(and (= ULTIMATE.start_main_~sn~0 6) (<= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0) (= 3 ULTIMATE.start_main_~i~0))} is VALID [2020-07-28 18:12:18,374 INFO L280 TraceCheckUtils]: 11: Hoare triple {500#(and (= ULTIMATE.start_main_~sn~0 6) (<= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0) (= 3 ULTIMATE.start_main_~i~0))} main_#t~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2; {500#(and (= ULTIMATE.start_main_~sn~0 6) (<= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0) (= 3 ULTIMATE.start_main_~i~0))} is VALID [2020-07-28 18:12:18,375 INFO L280 TraceCheckUtils]: 12: Hoare triple {500#(and (= ULTIMATE.start_main_~sn~0 6) (<= 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; {507#(and (<= ULTIMATE.start_main_~i~0 4) (= ULTIMATE.start_main_~sn~0 6) (<= 3 ULTIMATE.start_main_~n~0))} is VALID [2020-07-28 18:12:18,376 INFO L280 TraceCheckUtils]: 13: Hoare triple {507#(and (<= ULTIMATE.start_main_~i~0 4) (= ULTIMATE.start_main_~sn~0 6) (<= 3 ULTIMATE.start_main_~n~0))} assume !(main_~i~0 <= main_~n~0); {511#(and (= ULTIMATE.start_main_~sn~0 6) (<= 3 ULTIMATE.start_main_~n~0) (<= ULTIMATE.start_main_~n~0 3))} is VALID [2020-07-28 18:12:18,378 INFO L280 TraceCheckUtils]: 14: Hoare triple {511#(and (= ULTIMATE.start_main_~sn~0 6) (<= 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; {515#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2020-07-28 18:12:18,379 INFO L280 TraceCheckUtils]: 15: Hoare triple {515#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {453#false} is VALID [2020-07-28 18:12:18,379 INFO L280 TraceCheckUtils]: 16: Hoare triple {453#false} assume !false; {453#false} is VALID [2020-07-28 18:12:18,380 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:18,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:12:18,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 18 [2020-07-28 18:12:18,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433869183] [2020-07-28 18:12:18,382 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 17 [2020-07-28 18:12:18,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:18,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2020-07-28 18:12:18,417 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:18,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-28 18:12:18,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:18,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-28 18:12:18,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2020-07-28 18:12:18,419 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 19 states. [2020-07-28 18:12:19,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:19,457 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2020-07-28 18:12:19,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-28 18:12:19,457 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 17 [2020-07-28 18:12:19,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:19,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-28 18:12:19,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 44 transitions. [2020-07-28 18:12:19,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-28 18:12:19,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 44 transitions. [2020-07-28 18:12:19,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 44 transitions. [2020-07-28 18:12:19,520 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:19,521 INFO L225 Difference]: With dead ends: 39 [2020-07-28 18:12:19,522 INFO L226 Difference]: Without dead ends: 33 [2020-07-28 18:12:19,523 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=177, Invalid=945, Unknown=0, NotChecked=0, Total=1122 [2020-07-28 18:12:19,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-28 18:12:19,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 19. [2020-07-28 18:12:19,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:19,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 19 states. [2020-07-28 18:12:19,545 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 19 states. [2020-07-28 18:12:19,545 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 19 states. [2020-07-28 18:12:19,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:19,551 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-28 18:12:19,551 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-28 18:12:19,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:19,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:19,552 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 33 states. [2020-07-28 18:12:19,553 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 33 states. [2020-07-28 18:12:19,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:19,556 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-28 18:12:19,557 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-28 18:12:19,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:19,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:19,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:19,563 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:19,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-28 18:12:19,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2020-07-28 18:12:19,566 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 17 [2020-07-28 18:12:19,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:19,566 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-07-28 18:12:19,566 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-28 18:12:19,567 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-28 18:12:19,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-28 18:12:19,568 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:19,568 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2020-07-28 18:12:19,781 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:19,782 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:19,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:19,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1243140318, now seen corresponding path program 2 times [2020-07-28 18:12:19,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:19,784 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82017052] [2020-07-28 18:12:19,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:19,856 INFO L280 TraceCheckUtils]: 0: Hoare triple {685#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post2, main_#t~post1, main_~i~0, main_~j~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~j~0 := 10;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; {687#(<= (+ ULTIMATE.start_main_~i~0 9) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:19,857 INFO L280 TraceCheckUtils]: 1: Hoare triple {687#(<= (+ ULTIMATE.start_main_~i~0 9) ULTIMATE.start_main_~j~0)} assume !!(main_~i~0 <= main_~n~0); {687#(<= (+ ULTIMATE.start_main_~i~0 9) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:19,864 INFO L280 TraceCheckUtils]: 2: Hoare triple {687#(<= (+ ULTIMATE.start_main_~i~0 9) ULTIMATE.start_main_~j~0)} assume main_~i~0 < main_~j~0;main_~sn~0 := 2 + main_~sn~0; {687#(<= (+ ULTIMATE.start_main_~i~0 9) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:19,865 INFO L280 TraceCheckUtils]: 3: Hoare triple {687#(<= (+ ULTIMATE.start_main_~i~0 9) ULTIMATE.start_main_~j~0)} main_#t~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2; {688#(<= (+ ULTIMATE.start_main_~i~0 8) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:19,866 INFO L280 TraceCheckUtils]: 4: Hoare triple {688#(<= (+ ULTIMATE.start_main_~i~0 8) ULTIMATE.start_main_~j~0)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {689#(<= (+ ULTIMATE.start_main_~i~0 7) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:19,867 INFO L280 TraceCheckUtils]: 5: Hoare triple {689#(<= (+ ULTIMATE.start_main_~i~0 7) ULTIMATE.start_main_~j~0)} assume !!(main_~i~0 <= main_~n~0); {689#(<= (+ ULTIMATE.start_main_~i~0 7) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:19,867 INFO L280 TraceCheckUtils]: 6: Hoare triple {689#(<= (+ ULTIMATE.start_main_~i~0 7) ULTIMATE.start_main_~j~0)} assume main_~i~0 < main_~j~0;main_~sn~0 := 2 + main_~sn~0; {689#(<= (+ ULTIMATE.start_main_~i~0 7) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:19,868 INFO L280 TraceCheckUtils]: 7: Hoare triple {689#(<= (+ ULTIMATE.start_main_~i~0 7) ULTIMATE.start_main_~j~0)} main_#t~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2; {690#(<= (+ ULTIMATE.start_main_~i~0 6) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:19,869 INFO L280 TraceCheckUtils]: 8: Hoare triple {690#(<= (+ ULTIMATE.start_main_~i~0 6) ULTIMATE.start_main_~j~0)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {691#(<= (+ ULTIMATE.start_main_~i~0 5) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:19,870 INFO L280 TraceCheckUtils]: 9: Hoare triple {691#(<= (+ ULTIMATE.start_main_~i~0 5) ULTIMATE.start_main_~j~0)} assume !!(main_~i~0 <= main_~n~0); {691#(<= (+ ULTIMATE.start_main_~i~0 5) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:19,871 INFO L280 TraceCheckUtils]: 10: Hoare triple {691#(<= (+ ULTIMATE.start_main_~i~0 5) ULTIMATE.start_main_~j~0)} assume !(main_~i~0 < main_~j~0); {686#false} is VALID [2020-07-28 18:12:19,871 INFO L280 TraceCheckUtils]: 11: Hoare triple {686#false} main_#t~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2; {686#false} is VALID [2020-07-28 18:12:19,872 INFO L280 TraceCheckUtils]: 12: Hoare triple {686#false} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {686#false} is VALID [2020-07-28 18:12:19,872 INFO L280 TraceCheckUtils]: 13: Hoare triple {686#false} assume !(main_~i~0 <= main_~n~0); {686#false} is VALID [2020-07-28 18:12:19,872 INFO L280 TraceCheckUtils]: 14: Hoare triple {686#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; {686#false} is VALID [2020-07-28 18:12:19,873 INFO L280 TraceCheckUtils]: 15: Hoare triple {686#false} assume 0 == __VERIFIER_assert_~cond; {686#false} is VALID [2020-07-28 18:12:19,873 INFO L280 TraceCheckUtils]: 16: Hoare triple {686#false} assume !false; {686#false} is VALID [2020-07-28 18:12:19,874 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:19,874 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82017052] [2020-07-28 18:12:19,874 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510698175] [2020-07-28 18:12:19,874 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:19,897 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-28 18:12:19,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 18:12:19,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 7 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:19,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:19,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:12:20,140 INFO L280 TraceCheckUtils]: 0: Hoare triple {685#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post2, main_#t~post1, main_~i~0, main_~j~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~j~0 := 10;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; {695#(and (<= ULTIMATE.start_main_~i~0 1) (<= 10 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:12:20,142 INFO L280 TraceCheckUtils]: 1: Hoare triple {695#(and (<= ULTIMATE.start_main_~i~0 1) (<= 10 ULTIMATE.start_main_~j~0))} assume !!(main_~i~0 <= main_~n~0); {695#(and (<= ULTIMATE.start_main_~i~0 1) (<= 10 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:12:20,144 INFO L280 TraceCheckUtils]: 2: Hoare triple {695#(and (<= ULTIMATE.start_main_~i~0 1) (<= 10 ULTIMATE.start_main_~j~0))} assume main_~i~0 < main_~j~0;main_~sn~0 := 2 + main_~sn~0; {695#(and (<= ULTIMATE.start_main_~i~0 1) (<= 10 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:12:20,147 INFO L280 TraceCheckUtils]: 3: Hoare triple {695#(and (<= ULTIMATE.start_main_~i~0 1) (<= 10 ULTIMATE.start_main_~j~0))} main_#t~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2; {705#(and (<= 9 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-28 18:12:20,148 INFO L280 TraceCheckUtils]: 4: Hoare triple {705#(and (<= 9 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~i~0 1))} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {709#(and (<= ULTIMATE.start_main_~i~0 2) (<= 9 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:12:20,149 INFO L280 TraceCheckUtils]: 5: Hoare triple {709#(and (<= ULTIMATE.start_main_~i~0 2) (<= 9 ULTIMATE.start_main_~j~0))} assume !!(main_~i~0 <= main_~n~0); {709#(and (<= ULTIMATE.start_main_~i~0 2) (<= 9 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:12:20,150 INFO L280 TraceCheckUtils]: 6: Hoare triple {709#(and (<= ULTIMATE.start_main_~i~0 2) (<= 9 ULTIMATE.start_main_~j~0))} assume main_~i~0 < main_~j~0;main_~sn~0 := 2 + main_~sn~0; {709#(and (<= ULTIMATE.start_main_~i~0 2) (<= 9 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:12:20,150 INFO L280 TraceCheckUtils]: 7: Hoare triple {709#(and (<= ULTIMATE.start_main_~i~0 2) (<= 9 ULTIMATE.start_main_~j~0))} main_#t~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2; {719#(and (<= 8 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~i~0 2))} is VALID [2020-07-28 18:12:20,152 INFO L280 TraceCheckUtils]: 8: Hoare triple {719#(and (<= 8 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~i~0 2))} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {723#(and (<= ULTIMATE.start_main_~i~0 3) (<= 8 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:12:20,153 INFO L280 TraceCheckUtils]: 9: Hoare triple {723#(and (<= ULTIMATE.start_main_~i~0 3) (<= 8 ULTIMATE.start_main_~j~0))} assume !!(main_~i~0 <= main_~n~0); {723#(and (<= ULTIMATE.start_main_~i~0 3) (<= 8 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:12:20,153 INFO L280 TraceCheckUtils]: 10: Hoare triple {723#(and (<= ULTIMATE.start_main_~i~0 3) (<= 8 ULTIMATE.start_main_~j~0))} assume !(main_~i~0 < main_~j~0); {686#false} is VALID [2020-07-28 18:12:20,153 INFO L280 TraceCheckUtils]: 11: Hoare triple {686#false} main_#t~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2; {686#false} is VALID [2020-07-28 18:12:20,154 INFO L280 TraceCheckUtils]: 12: Hoare triple {686#false} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {686#false} is VALID [2020-07-28 18:12:20,154 INFO L280 TraceCheckUtils]: 13: Hoare triple {686#false} assume !(main_~i~0 <= main_~n~0); {686#false} is VALID [2020-07-28 18:12:20,154 INFO L280 TraceCheckUtils]: 14: Hoare triple {686#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; {686#false} is VALID [2020-07-28 18:12:20,154 INFO L280 TraceCheckUtils]: 15: Hoare triple {686#false} assume 0 == __VERIFIER_assert_~cond; {686#false} is VALID [2020-07-28 18:12:20,155 INFO L280 TraceCheckUtils]: 16: Hoare triple {686#false} assume !false; {686#false} is VALID [2020-07-28 18:12:20,156 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:20,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:12:20,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2020-07-28 18:12:20,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108813704] [2020-07-28 18:12:20,157 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2020-07-28 18:12:20,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:20,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-28 18:12:20,201 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:20,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-28 18:12:20,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:20,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-28 18:12:20,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2020-07-28 18:12:20,203 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 12 states. [2020-07-28 18:12:20,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:20,336 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2020-07-28 18:12:20,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-28 18:12:20,336 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2020-07-28 18:12:20,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:20,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-28 18:12:20,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2020-07-28 18:12:20,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-28 18:12:20,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2020-07-28 18:12:20,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 31 transitions. [2020-07-28 18:12:20,378 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:20,379 INFO L225 Difference]: With dead ends: 32 [2020-07-28 18:12:20,379 INFO L226 Difference]: Without dead ends: 24 [2020-07-28 18:12:20,380 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2020-07-28 18:12:20,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-28 18:12:20,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2020-07-28 18:12:20,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:20,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2020-07-28 18:12:20,408 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2020-07-28 18:12:20,408 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2020-07-28 18:12:20,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:20,410 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-28 18:12:20,410 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-28 18:12:20,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:20,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:20,410 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2020-07-28 18:12:20,411 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2020-07-28 18:12:20,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:20,412 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-28 18:12:20,412 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-28 18:12:20,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:20,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:20,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:20,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:20,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-28 18:12:20,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2020-07-28 18:12:20,414 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 17 [2020-07-28 18:12:20,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:20,414 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2020-07-28 18:12:20,414 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-28 18:12:20,415 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-28 18:12:20,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-28 18:12:20,415 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:20,415 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1] [2020-07-28 18:12:20,624 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:20,625 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:20,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:20,626 INFO L82 PathProgramCache]: Analyzing trace with hash -242812025, now seen corresponding path program 3 times [2020-07-28 18:12:20,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:20,627 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40417644] [2020-07-28 18:12:20,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:20,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:20,773 INFO L280 TraceCheckUtils]: 0: Hoare triple {861#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post2, main_#t~post1, main_~i~0, main_~j~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~j~0 := 10;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; {863#(<= (+ ULTIMATE.start_main_~i~0 9) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:20,774 INFO L280 TraceCheckUtils]: 1: Hoare triple {863#(<= (+ ULTIMATE.start_main_~i~0 9) ULTIMATE.start_main_~j~0)} assume !!(main_~i~0 <= main_~n~0); {863#(<= (+ ULTIMATE.start_main_~i~0 9) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:20,775 INFO L280 TraceCheckUtils]: 2: Hoare triple {863#(<= (+ ULTIMATE.start_main_~i~0 9) ULTIMATE.start_main_~j~0)} assume main_~i~0 < main_~j~0;main_~sn~0 := 2 + main_~sn~0; {863#(<= (+ ULTIMATE.start_main_~i~0 9) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:20,776 INFO L280 TraceCheckUtils]: 3: Hoare triple {863#(<= (+ ULTIMATE.start_main_~i~0 9) ULTIMATE.start_main_~j~0)} main_#t~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2; {864#(<= (+ ULTIMATE.start_main_~i~0 8) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:20,776 INFO L280 TraceCheckUtils]: 4: Hoare triple {864#(<= (+ ULTIMATE.start_main_~i~0 8) ULTIMATE.start_main_~j~0)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {865#(<= (+ ULTIMATE.start_main_~i~0 7) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:20,777 INFO L280 TraceCheckUtils]: 5: Hoare triple {865#(<= (+ ULTIMATE.start_main_~i~0 7) ULTIMATE.start_main_~j~0)} assume !!(main_~i~0 <= main_~n~0); {865#(<= (+ ULTIMATE.start_main_~i~0 7) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:20,778 INFO L280 TraceCheckUtils]: 6: Hoare triple {865#(<= (+ ULTIMATE.start_main_~i~0 7) ULTIMATE.start_main_~j~0)} assume main_~i~0 < main_~j~0;main_~sn~0 := 2 + main_~sn~0; {865#(<= (+ ULTIMATE.start_main_~i~0 7) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:20,779 INFO L280 TraceCheckUtils]: 7: Hoare triple {865#(<= (+ ULTIMATE.start_main_~i~0 7) ULTIMATE.start_main_~j~0)} main_#t~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2; {866#(<= (+ ULTIMATE.start_main_~i~0 6) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:20,780 INFO L280 TraceCheckUtils]: 8: Hoare triple {866#(<= (+ ULTIMATE.start_main_~i~0 6) ULTIMATE.start_main_~j~0)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {867#(<= (+ ULTIMATE.start_main_~i~0 5) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:20,781 INFO L280 TraceCheckUtils]: 9: Hoare triple {867#(<= (+ ULTIMATE.start_main_~i~0 5) ULTIMATE.start_main_~j~0)} assume !!(main_~i~0 <= main_~n~0); {867#(<= (+ ULTIMATE.start_main_~i~0 5) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:20,782 INFO L280 TraceCheckUtils]: 10: Hoare triple {867#(<= (+ ULTIMATE.start_main_~i~0 5) ULTIMATE.start_main_~j~0)} assume main_~i~0 < main_~j~0;main_~sn~0 := 2 + main_~sn~0; {867#(<= (+ ULTIMATE.start_main_~i~0 5) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:20,782 INFO L280 TraceCheckUtils]: 11: Hoare triple {867#(<= (+ ULTIMATE.start_main_~i~0 5) ULTIMATE.start_main_~j~0)} main_#t~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2; {868#(<= (+ ULTIMATE.start_main_~i~0 4) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:20,783 INFO L280 TraceCheckUtils]: 12: Hoare triple {868#(<= (+ ULTIMATE.start_main_~i~0 4) ULTIMATE.start_main_~j~0)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {869#(<= (+ ULTIMATE.start_main_~i~0 3) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:20,784 INFO L280 TraceCheckUtils]: 13: Hoare triple {869#(<= (+ ULTIMATE.start_main_~i~0 3) ULTIMATE.start_main_~j~0)} assume !!(main_~i~0 <= main_~n~0); {869#(<= (+ ULTIMATE.start_main_~i~0 3) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:20,784 INFO L280 TraceCheckUtils]: 14: Hoare triple {869#(<= (+ ULTIMATE.start_main_~i~0 3) ULTIMATE.start_main_~j~0)} assume !(main_~i~0 < main_~j~0); {862#false} is VALID [2020-07-28 18:12:20,784 INFO L280 TraceCheckUtils]: 15: Hoare triple {862#false} main_#t~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2; {862#false} is VALID [2020-07-28 18:12:20,784 INFO L280 TraceCheckUtils]: 16: Hoare triple {862#false} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {862#false} is VALID [2020-07-28 18:12:20,785 INFO L280 TraceCheckUtils]: 17: Hoare triple {862#false} assume !(main_~i~0 <= main_~n~0); {862#false} is VALID [2020-07-28 18:12:20,785 INFO L280 TraceCheckUtils]: 18: Hoare triple {862#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; {862#false} is VALID [2020-07-28 18:12:20,785 INFO L280 TraceCheckUtils]: 19: Hoare triple {862#false} assume 0 == __VERIFIER_assert_~cond; {862#false} is VALID [2020-07-28 18:12:20,785 INFO L280 TraceCheckUtils]: 20: Hoare triple {862#false} assume !false; {862#false} is VALID [2020-07-28 18:12:20,786 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:20,786 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40417644] [2020-07-28 18:12:20,786 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127397888] [2020-07-28 18:12:20,786 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:20,815 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-07-28 18:12:20,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 18:12:20,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-28 18:12:20,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:20,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:12:21,134 INFO L280 TraceCheckUtils]: 0: Hoare triple {861#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post2, main_#t~post1, main_~i~0, main_~j~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~j~0 := 10;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; {873#(and (<= ULTIMATE.start_main_~i~0 1) (<= 10 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:12:21,135 INFO L280 TraceCheckUtils]: 1: Hoare triple {873#(and (<= ULTIMATE.start_main_~i~0 1) (<= 10 ULTIMATE.start_main_~j~0))} assume !!(main_~i~0 <= main_~n~0); {873#(and (<= ULTIMATE.start_main_~i~0 1) (<= 10 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:12:21,136 INFO L280 TraceCheckUtils]: 2: Hoare triple {873#(and (<= ULTIMATE.start_main_~i~0 1) (<= 10 ULTIMATE.start_main_~j~0))} assume main_~i~0 < main_~j~0;main_~sn~0 := 2 + main_~sn~0; {873#(and (<= ULTIMATE.start_main_~i~0 1) (<= 10 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:12:21,138 INFO L280 TraceCheckUtils]: 3: Hoare triple {873#(and (<= ULTIMATE.start_main_~i~0 1) (<= 10 ULTIMATE.start_main_~j~0))} main_#t~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2; {883#(and (<= 9 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-28 18:12:21,145 INFO L280 TraceCheckUtils]: 4: Hoare triple {883#(and (<= 9 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~i~0 1))} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {887#(and (<= ULTIMATE.start_main_~i~0 2) (<= 9 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:12:21,145 INFO L280 TraceCheckUtils]: 5: Hoare triple {887#(and (<= ULTIMATE.start_main_~i~0 2) (<= 9 ULTIMATE.start_main_~j~0))} assume !!(main_~i~0 <= main_~n~0); {887#(and (<= ULTIMATE.start_main_~i~0 2) (<= 9 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:12:21,146 INFO L280 TraceCheckUtils]: 6: Hoare triple {887#(and (<= ULTIMATE.start_main_~i~0 2) (<= 9 ULTIMATE.start_main_~j~0))} assume main_~i~0 < main_~j~0;main_~sn~0 := 2 + main_~sn~0; {887#(and (<= ULTIMATE.start_main_~i~0 2) (<= 9 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:12:21,147 INFO L280 TraceCheckUtils]: 7: Hoare triple {887#(and (<= ULTIMATE.start_main_~i~0 2) (<= 9 ULTIMATE.start_main_~j~0))} main_#t~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2; {897#(and (<= 8 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~i~0 2))} is VALID [2020-07-28 18:12:21,147 INFO L280 TraceCheckUtils]: 8: Hoare triple {897#(and (<= 8 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~i~0 2))} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {901#(and (<= ULTIMATE.start_main_~i~0 3) (<= 8 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:12:21,148 INFO L280 TraceCheckUtils]: 9: Hoare triple {901#(and (<= ULTIMATE.start_main_~i~0 3) (<= 8 ULTIMATE.start_main_~j~0))} assume !!(main_~i~0 <= main_~n~0); {901#(and (<= ULTIMATE.start_main_~i~0 3) (<= 8 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:12:21,149 INFO L280 TraceCheckUtils]: 10: Hoare triple {901#(and (<= ULTIMATE.start_main_~i~0 3) (<= 8 ULTIMATE.start_main_~j~0))} assume main_~i~0 < main_~j~0;main_~sn~0 := 2 + main_~sn~0; {901#(and (<= ULTIMATE.start_main_~i~0 3) (<= 8 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:12:21,152 INFO L280 TraceCheckUtils]: 11: Hoare triple {901#(and (<= ULTIMATE.start_main_~i~0 3) (<= 8 ULTIMATE.start_main_~j~0))} main_#t~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2; {911#(and (<= 7 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~i~0 3))} is VALID [2020-07-28 18:12:21,153 INFO L280 TraceCheckUtils]: 12: Hoare triple {911#(and (<= 7 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~i~0 3))} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {915#(and (<= ULTIMATE.start_main_~i~0 4) (<= 7 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:12:21,154 INFO L280 TraceCheckUtils]: 13: Hoare triple {915#(and (<= ULTIMATE.start_main_~i~0 4) (<= 7 ULTIMATE.start_main_~j~0))} assume !!(main_~i~0 <= main_~n~0); {915#(and (<= ULTIMATE.start_main_~i~0 4) (<= 7 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:12:21,154 INFO L280 TraceCheckUtils]: 14: Hoare triple {915#(and (<= ULTIMATE.start_main_~i~0 4) (<= 7 ULTIMATE.start_main_~j~0))} assume !(main_~i~0 < main_~j~0); {862#false} is VALID [2020-07-28 18:12:21,155 INFO L280 TraceCheckUtils]: 15: Hoare triple {862#false} main_#t~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2; {862#false} is VALID [2020-07-28 18:12:21,155 INFO L280 TraceCheckUtils]: 16: Hoare triple {862#false} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {862#false} is VALID [2020-07-28 18:12:21,155 INFO L280 TraceCheckUtils]: 17: Hoare triple {862#false} assume !(main_~i~0 <= main_~n~0); {862#false} is VALID [2020-07-28 18:12:21,155 INFO L280 TraceCheckUtils]: 18: Hoare triple {862#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; {862#false} is VALID [2020-07-28 18:12:21,156 INFO L280 TraceCheckUtils]: 19: Hoare triple {862#false} assume 0 == __VERIFIER_assert_~cond; {862#false} is VALID [2020-07-28 18:12:21,156 INFO L280 TraceCheckUtils]: 20: Hoare triple {862#false} assume !false; {862#false} is VALID [2020-07-28 18:12:21,157 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:21,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:12:21,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2020-07-28 18:12:21,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310458673] [2020-07-28 18:12:21,158 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-07-28 18:12:21,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:21,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-28 18:12:21,203 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:21,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-28 18:12:21,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:21,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-28 18:12:21,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2020-07-28 18:12:21,205 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 16 states. [2020-07-28 18:12:21,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:21,371 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2020-07-28 18:12:21,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-28 18:12:21,372 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2020-07-28 18:12:21,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:21,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-28 18:12:21,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2020-07-28 18:12:21,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-28 18:12:21,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2020-07-28 18:12:21,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 35 transitions. [2020-07-28 18:12:21,408 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:21,409 INFO L225 Difference]: With dead ends: 36 [2020-07-28 18:12:21,409 INFO L226 Difference]: Without dead ends: 28 [2020-07-28 18:12:21,410 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2020-07-28 18:12:21,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-28 18:12:21,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-07-28 18:12:21,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:21,435 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2020-07-28 18:12:21,435 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2020-07-28 18:12:21,436 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2020-07-28 18:12:21,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:21,438 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2020-07-28 18:12:21,438 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-28 18:12:21,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:21,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:21,438 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2020-07-28 18:12:21,439 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2020-07-28 18:12:21,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:21,440 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2020-07-28 18:12:21,440 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-28 18:12:21,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:21,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:21,442 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:21,442 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:21,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-28 18:12:21,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2020-07-28 18:12:21,443 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 21 [2020-07-28 18:12:21,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:21,445 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2020-07-28 18:12:21,446 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-28 18:12:21,446 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2020-07-28 18:12:21,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-28 18:12:21,446 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:21,446 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2020-07-28 18:12:21,652 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-28 18:12:21,652 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:21,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:21,653 INFO L82 PathProgramCache]: Analyzing trace with hash -2047865492, now seen corresponding path program 4 times [2020-07-28 18:12:21,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:21,654 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43195013] [2020-07-28 18:12:21,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:21,825 INFO L280 TraceCheckUtils]: 0: Hoare triple {1071#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post2, main_#t~post1, main_~i~0, main_~j~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~j~0 := 10;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; {1073#(<= (+ ULTIMATE.start_main_~i~0 9) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:21,826 INFO L280 TraceCheckUtils]: 1: Hoare triple {1073#(<= (+ ULTIMATE.start_main_~i~0 9) ULTIMATE.start_main_~j~0)} assume !!(main_~i~0 <= main_~n~0); {1073#(<= (+ ULTIMATE.start_main_~i~0 9) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:21,826 INFO L280 TraceCheckUtils]: 2: Hoare triple {1073#(<= (+ ULTIMATE.start_main_~i~0 9) ULTIMATE.start_main_~j~0)} assume main_~i~0 < main_~j~0;main_~sn~0 := 2 + main_~sn~0; {1073#(<= (+ ULTIMATE.start_main_~i~0 9) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:21,827 INFO L280 TraceCheckUtils]: 3: Hoare triple {1073#(<= (+ ULTIMATE.start_main_~i~0 9) ULTIMATE.start_main_~j~0)} main_#t~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2; {1074#(<= (+ ULTIMATE.start_main_~i~0 8) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:21,828 INFO L280 TraceCheckUtils]: 4: Hoare triple {1074#(<= (+ ULTIMATE.start_main_~i~0 8) ULTIMATE.start_main_~j~0)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1075#(<= (+ ULTIMATE.start_main_~i~0 7) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:21,829 INFO L280 TraceCheckUtils]: 5: Hoare triple {1075#(<= (+ ULTIMATE.start_main_~i~0 7) ULTIMATE.start_main_~j~0)} assume !!(main_~i~0 <= main_~n~0); {1075#(<= (+ ULTIMATE.start_main_~i~0 7) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:21,830 INFO L280 TraceCheckUtils]: 6: Hoare triple {1075#(<= (+ ULTIMATE.start_main_~i~0 7) ULTIMATE.start_main_~j~0)} assume main_~i~0 < main_~j~0;main_~sn~0 := 2 + main_~sn~0; {1075#(<= (+ ULTIMATE.start_main_~i~0 7) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:21,830 INFO L280 TraceCheckUtils]: 7: Hoare triple {1075#(<= (+ ULTIMATE.start_main_~i~0 7) ULTIMATE.start_main_~j~0)} main_#t~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2; {1076#(<= (+ ULTIMATE.start_main_~i~0 6) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:21,831 INFO L280 TraceCheckUtils]: 8: Hoare triple {1076#(<= (+ ULTIMATE.start_main_~i~0 6) ULTIMATE.start_main_~j~0)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1077#(<= (+ ULTIMATE.start_main_~i~0 5) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:21,831 INFO L280 TraceCheckUtils]: 9: Hoare triple {1077#(<= (+ ULTIMATE.start_main_~i~0 5) ULTIMATE.start_main_~j~0)} assume !!(main_~i~0 <= main_~n~0); {1077#(<= (+ ULTIMATE.start_main_~i~0 5) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:21,832 INFO L280 TraceCheckUtils]: 10: Hoare triple {1077#(<= (+ ULTIMATE.start_main_~i~0 5) ULTIMATE.start_main_~j~0)} assume main_~i~0 < main_~j~0;main_~sn~0 := 2 + main_~sn~0; {1077#(<= (+ ULTIMATE.start_main_~i~0 5) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:21,832 INFO L280 TraceCheckUtils]: 11: Hoare triple {1077#(<= (+ ULTIMATE.start_main_~i~0 5) ULTIMATE.start_main_~j~0)} main_#t~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2; {1078#(<= (+ ULTIMATE.start_main_~i~0 4) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:21,833 INFO L280 TraceCheckUtils]: 12: Hoare triple {1078#(<= (+ ULTIMATE.start_main_~i~0 4) ULTIMATE.start_main_~j~0)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1079#(<= (+ ULTIMATE.start_main_~i~0 3) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:21,833 INFO L280 TraceCheckUtils]: 13: Hoare triple {1079#(<= (+ ULTIMATE.start_main_~i~0 3) ULTIMATE.start_main_~j~0)} assume !!(main_~i~0 <= main_~n~0); {1079#(<= (+ ULTIMATE.start_main_~i~0 3) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:21,834 INFO L280 TraceCheckUtils]: 14: Hoare triple {1079#(<= (+ ULTIMATE.start_main_~i~0 3) ULTIMATE.start_main_~j~0)} assume main_~i~0 < main_~j~0;main_~sn~0 := 2 + main_~sn~0; {1079#(<= (+ ULTIMATE.start_main_~i~0 3) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:21,835 INFO L280 TraceCheckUtils]: 15: Hoare triple {1079#(<= (+ ULTIMATE.start_main_~i~0 3) ULTIMATE.start_main_~j~0)} main_#t~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2; {1080#(<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:21,838 INFO L280 TraceCheckUtils]: 16: Hoare triple {1080#(<= (+ ULTIMATE.start_main_~i~0 2) ULTIMATE.start_main_~j~0)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1081#(<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:21,842 INFO L280 TraceCheckUtils]: 17: Hoare triple {1081#(<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~j~0)} assume !!(main_~i~0 <= main_~n~0); {1081#(<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~j~0)} is VALID [2020-07-28 18:12:21,842 INFO L280 TraceCheckUtils]: 18: Hoare triple {1081#(<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~j~0)} assume !(main_~i~0 < main_~j~0); {1072#false} is VALID [2020-07-28 18:12:21,843 INFO L280 TraceCheckUtils]: 19: Hoare triple {1072#false} main_#t~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2; {1072#false} is VALID [2020-07-28 18:12:21,843 INFO L280 TraceCheckUtils]: 20: Hoare triple {1072#false} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1072#false} is VALID [2020-07-28 18:12:21,843 INFO L280 TraceCheckUtils]: 21: Hoare triple {1072#false} assume !(main_~i~0 <= main_~n~0); {1072#false} is VALID [2020-07-28 18:12:21,843 INFO L280 TraceCheckUtils]: 22: Hoare triple {1072#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; {1072#false} is VALID [2020-07-28 18:12:21,843 INFO L280 TraceCheckUtils]: 23: Hoare triple {1072#false} assume 0 == __VERIFIER_assert_~cond; {1072#false} is VALID [2020-07-28 18:12:21,843 INFO L280 TraceCheckUtils]: 24: Hoare triple {1072#false} assume !false; {1072#false} is VALID [2020-07-28 18:12:21,844 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:21,844 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43195013] [2020-07-28 18:12:21,845 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094740182] [2020-07-28 18:12:21,845 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:21,872 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-28 18:12:21,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 18:12:21,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-28 18:12:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:21,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:12:22,271 INFO L280 TraceCheckUtils]: 0: Hoare triple {1071#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post2, main_#t~post1, main_~i~0, main_~j~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~j~0 := 10;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; {1085#(and (<= ULTIMATE.start_main_~i~0 1) (<= 10 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:12:22,272 INFO L280 TraceCheckUtils]: 1: Hoare triple {1085#(and (<= ULTIMATE.start_main_~i~0 1) (<= 10 ULTIMATE.start_main_~j~0))} assume !!(main_~i~0 <= main_~n~0); {1085#(and (<= ULTIMATE.start_main_~i~0 1) (<= 10 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:12:22,273 INFO L280 TraceCheckUtils]: 2: Hoare triple {1085#(and (<= ULTIMATE.start_main_~i~0 1) (<= 10 ULTIMATE.start_main_~j~0))} assume main_~i~0 < main_~j~0;main_~sn~0 := 2 + main_~sn~0; {1085#(and (<= ULTIMATE.start_main_~i~0 1) (<= 10 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:12:22,274 INFO L280 TraceCheckUtils]: 3: Hoare triple {1085#(and (<= ULTIMATE.start_main_~i~0 1) (<= 10 ULTIMATE.start_main_~j~0))} main_#t~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2; {1095#(and (<= 9 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-28 18:12:22,275 INFO L280 TraceCheckUtils]: 4: Hoare triple {1095#(and (<= 9 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~i~0 1))} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1099#(and (<= ULTIMATE.start_main_~i~0 2) (<= 9 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:12:22,276 INFO L280 TraceCheckUtils]: 5: Hoare triple {1099#(and (<= ULTIMATE.start_main_~i~0 2) (<= 9 ULTIMATE.start_main_~j~0))} assume !!(main_~i~0 <= main_~n~0); {1099#(and (<= ULTIMATE.start_main_~i~0 2) (<= 9 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:12:22,277 INFO L280 TraceCheckUtils]: 6: Hoare triple {1099#(and (<= ULTIMATE.start_main_~i~0 2) (<= 9 ULTIMATE.start_main_~j~0))} assume main_~i~0 < main_~j~0;main_~sn~0 := 2 + main_~sn~0; {1099#(and (<= ULTIMATE.start_main_~i~0 2) (<= 9 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:12:22,278 INFO L280 TraceCheckUtils]: 7: Hoare triple {1099#(and (<= ULTIMATE.start_main_~i~0 2) (<= 9 ULTIMATE.start_main_~j~0))} main_#t~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2; {1109#(and (<= 8 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~i~0 2))} is VALID [2020-07-28 18:12:22,279 INFO L280 TraceCheckUtils]: 8: Hoare triple {1109#(and (<= 8 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~i~0 2))} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1113#(and (<= ULTIMATE.start_main_~i~0 3) (<= 8 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:12:22,280 INFO L280 TraceCheckUtils]: 9: Hoare triple {1113#(and (<= ULTIMATE.start_main_~i~0 3) (<= 8 ULTIMATE.start_main_~j~0))} assume !!(main_~i~0 <= main_~n~0); {1113#(and (<= ULTIMATE.start_main_~i~0 3) (<= 8 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:12:22,281 INFO L280 TraceCheckUtils]: 10: Hoare triple {1113#(and (<= ULTIMATE.start_main_~i~0 3) (<= 8 ULTIMATE.start_main_~j~0))} assume main_~i~0 < main_~j~0;main_~sn~0 := 2 + main_~sn~0; {1113#(and (<= ULTIMATE.start_main_~i~0 3) (<= 8 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:12:22,282 INFO L280 TraceCheckUtils]: 11: Hoare triple {1113#(and (<= ULTIMATE.start_main_~i~0 3) (<= 8 ULTIMATE.start_main_~j~0))} main_#t~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2; {1123#(and (<= 7 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~i~0 3))} is VALID [2020-07-28 18:12:22,283 INFO L280 TraceCheckUtils]: 12: Hoare triple {1123#(and (<= 7 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~i~0 3))} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1127#(and (<= ULTIMATE.start_main_~i~0 4) (<= 7 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:12:22,284 INFO L280 TraceCheckUtils]: 13: Hoare triple {1127#(and (<= ULTIMATE.start_main_~i~0 4) (<= 7 ULTIMATE.start_main_~j~0))} assume !!(main_~i~0 <= main_~n~0); {1127#(and (<= ULTIMATE.start_main_~i~0 4) (<= 7 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:12:22,285 INFO L280 TraceCheckUtils]: 14: Hoare triple {1127#(and (<= ULTIMATE.start_main_~i~0 4) (<= 7 ULTIMATE.start_main_~j~0))} assume main_~i~0 < main_~j~0;main_~sn~0 := 2 + main_~sn~0; {1127#(and (<= ULTIMATE.start_main_~i~0 4) (<= 7 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:12:22,286 INFO L280 TraceCheckUtils]: 15: Hoare triple {1127#(and (<= ULTIMATE.start_main_~i~0 4) (<= 7 ULTIMATE.start_main_~j~0))} main_#t~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2; {1137#(and (<= ULTIMATE.start_main_~i~0 4) (<= 6 ULTIMATE.start_main_~j~0))} is VALID [2020-07-28 18:12:22,287 INFO L280 TraceCheckUtils]: 16: Hoare triple {1137#(and (<= ULTIMATE.start_main_~i~0 4) (<= 6 ULTIMATE.start_main_~j~0))} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1141#(and (<= 6 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~i~0 5))} is VALID [2020-07-28 18:12:22,288 INFO L280 TraceCheckUtils]: 17: Hoare triple {1141#(and (<= 6 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~i~0 5))} assume !!(main_~i~0 <= main_~n~0); {1141#(and (<= 6 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~i~0 5))} is VALID [2020-07-28 18:12:22,289 INFO L280 TraceCheckUtils]: 18: Hoare triple {1141#(and (<= 6 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~i~0 5))} assume !(main_~i~0 < main_~j~0); {1072#false} is VALID [2020-07-28 18:12:22,289 INFO L280 TraceCheckUtils]: 19: Hoare triple {1072#false} main_#t~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2; {1072#false} is VALID [2020-07-28 18:12:22,289 INFO L280 TraceCheckUtils]: 20: Hoare triple {1072#false} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {1072#false} is VALID [2020-07-28 18:12:22,289 INFO L280 TraceCheckUtils]: 21: Hoare triple {1072#false} assume !(main_~i~0 <= main_~n~0); {1072#false} is VALID [2020-07-28 18:12:22,290 INFO L280 TraceCheckUtils]: 22: Hoare triple {1072#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; {1072#false} is VALID [2020-07-28 18:12:22,290 INFO L280 TraceCheckUtils]: 23: Hoare triple {1072#false} assume 0 == __VERIFIER_assert_~cond; {1072#false} is VALID [2020-07-28 18:12:22,290 INFO L280 TraceCheckUtils]: 24: Hoare triple {1072#false} assume !false; {1072#false} is VALID [2020-07-28 18:12:22,292 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:22,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:12:22,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2020-07-28 18:12:22,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85116591] [2020-07-28 18:12:22,293 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 25 [2020-07-28 18:12:22,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:22,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2020-07-28 18:12:22,346 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:22,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-28 18:12:22,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:22,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-28 18:12:22,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2020-07-28 18:12:22,348 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 20 states. [2020-07-28 18:12:22,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:22,623 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2020-07-28 18:12:22,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-28 18:12:22,624 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 25 [2020-07-28 18:12:22,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:22,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-28 18:12:22,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 40 transitions. [2020-07-28 18:12:22,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-28 18:12:22,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 40 transitions. [2020-07-28 18:12:22,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 40 transitions. [2020-07-28 18:12:22,670 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:22,671 INFO L225 Difference]: With dead ends: 41 [2020-07-28 18:12:22,672 INFO L226 Difference]: Without dead ends: 33 [2020-07-28 18:12:22,673 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2020-07-28 18:12:22,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-28 18:12:22,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2020-07-28 18:12:22,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:22,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 31 states. [2020-07-28 18:12:22,696 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 31 states. [2020-07-28 18:12:22,696 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 31 states. [2020-07-28 18:12:22,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:22,698 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2020-07-28 18:12:22,698 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2020-07-28 18:12:22,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:22,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:22,700 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 33 states. [2020-07-28 18:12:22,700 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 33 states. [2020-07-28 18:12:22,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:22,705 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2020-07-28 18:12:22,705 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2020-07-28 18:12:22,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:22,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:22,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:22,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:22,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-28 18:12:22,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2020-07-28 18:12:22,706 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 25 [2020-07-28 18:12:22,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:22,707 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2020-07-28 18:12:22,707 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-28 18:12:22,707 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-28 18:12:22,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-28 18:12:22,707 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:22,707 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1] [2020-07-28 18:12:22,908 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:22,909 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:22,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:22,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1174166319, now seen corresponding path program 5 times [2020-07-28 18:12:22,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:22,910 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10241718] [2020-07-28 18:12:22,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 18:12:22,942 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 18:12:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 18:12:22,962 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 18:12:22,979 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-28 18:12:22,979 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 18:12:22,980 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-28 18:12:23,005 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 18:12:23,006 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-28 18:12:23,006 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-28 18:12:23,006 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-28 18:12:23,006 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2020-07-28 18:12:23,006 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-28 18:12:23,007 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-28 18:12:23,007 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-28 18:12:23,007 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-28 18:12:23,007 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2020-07-28 18:12:23,007 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-28 18:12:23,007 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-28 18:12:23,008 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-28 18:12:23,008 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2020-07-28 18:12:23,008 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:12:23,008 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:23,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 06:12:23 BoogieIcfgContainer [2020-07-28 18:12:23,010 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 18:12:23,011 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 18:12:23,011 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 18:12:23,011 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 18:12:23,012 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:14" (3/4) ... [2020-07-28 18:12:23,014 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-28 18:12:23,066 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 18:12:23,066 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 18:12:23,069 INFO L168 Benchmark]: Toolchain (without parser) took 9724.85 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 276.3 MB). Free memory was 954.9 MB in the beginning and 941.6 MB in the end (delta: 13.2 MB). Peak memory consumption was 289.5 MB. Max. memory is 11.5 GB. [2020-07-28 18:12:23,070 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:12:23,070 INFO L168 Benchmark]: CACSL2BoogieTranslator took 232.71 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 944.1 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:23,071 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.96 ms. Allocated memory is still 1.0 GB. Free memory is still 944.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:12:23,071 INFO L168 Benchmark]: Boogie Preprocessor took 95.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -195.2 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2020-07-28 18:12:23,072 INFO L168 Benchmark]: RCFGBuilder took 348.20 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.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:12:23,073 INFO L168 Benchmark]: TraceAbstraction took 8946.72 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 126.9 MB). Free memory was 1.1 GB in the beginning and 941.6 MB in the end (delta: 178.4 MB). Peak memory consumption was 305.3 MB. Max. memory is 11.5 GB. [2020-07-28 18:12:23,073 INFO L168 Benchmark]: Witness Printer took 55.87 ms. Allocated memory is still 1.3 GB. Free memory is still 941.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:12:23,076 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 232.71 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 944.1 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 37.96 ms. Allocated memory is still 1.0 GB. Free memory is still 944.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 95.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -195.2 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 348.20 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.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8946.72 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 126.9 MB). Free memory was 1.1 GB in the beginning and 941.6 MB in the end (delta: 178.4 MB). Peak memory consumption was 305.3 MB. Max. memory is 11.5 GB. * Witness Printer took 55.87 ms. Allocated memory is still 1.3 GB. Free memory is still 941.6 MB. There was no memory consumed. 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, j=10, n=__VERIFIER_nondet_uint(), sn=0; [L12] int i, j=10, n=__VERIFIER_nondet_uint(), sn=0; [L13] i=1 [L13] COND TRUE i<=n [L14] COND TRUE i