./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Fig1.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Fig1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ef399329f84d2482fbc6cd637d6b986ccb5018221a1a0504f889d0bed5430f95 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:04:16,278 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:04:16,279 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:04:16,298 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:04:16,298 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:04:16,299 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:04:16,300 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:04:16,301 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:04:16,302 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:04:16,303 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:04:16,304 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:04:16,304 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:04:16,305 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:04:16,305 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:04:16,306 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:04:16,307 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:04:16,308 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:04:16,308 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:04:16,309 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:04:16,311 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:04:16,312 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:04:16,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:04:16,313 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:04:16,314 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:04:16,316 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:04:16,316 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:04:16,316 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:04:16,317 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:04:16,317 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:04:16,318 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:04:16,318 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:04:16,318 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:04:16,319 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:04:16,319 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:04:16,320 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:04:16,320 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:04:16,321 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:04:16,321 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:04:16,321 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:04:16,322 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:04:16,322 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:04:16,323 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-02-21 03:04:16,337 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:04:16,337 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:04:16,337 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:04:16,337 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:04:16,338 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:04:16,338 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:04:16,339 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:04:16,339 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:04:16,339 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:04:16,339 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:04:16,339 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:04:16,339 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:04:16,340 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:04:16,340 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:04:16,340 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:04:16,340 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:04:16,340 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:04:16,340 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:04:16,340 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:04:16,341 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:04:16,341 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:04:16,341 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:04:16,341 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:04:16,341 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:04:16,341 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:04:16,341 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:04:16,342 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:04:16,342 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:04:16,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:04:16,342 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:04:16,342 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 ! overflow) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ef399329f84d2482fbc6cd637d6b986ccb5018221a1a0504f889d0bed5430f95 [2022-02-21 03:04:16,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:04:16,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:04:16,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:04:16,539 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:04:16,539 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:04:16,540 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Fig1.c [2022-02-21 03:04:16,593 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaa812d5e/cc673099c2984a80ae62615ff587e2a5/FLAGccef8b096 [2022-02-21 03:04:16,893 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:04:16,894 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Fig1.c [2022-02-21 03:04:16,900 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaa812d5e/cc673099c2984a80ae62615ff587e2a5/FLAGccef8b096 [2022-02-21 03:04:16,911 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaa812d5e/cc673099c2984a80ae62615ff587e2a5 [2022-02-21 03:04:16,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:04:16,916 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:04:16,920 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:04:16,920 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:04:16,922 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:04:16,923 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:04:16" (1/1) ... [2022-02-21 03:04:16,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d9e1817 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:16, skipping insertion in model container [2022-02-21 03:04:16,924 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:04:16" (1/1) ... [2022-02-21 03:04:16,929 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:04:16,939 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:04:17,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:04:17,109 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:04:17,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:04:17,133 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:04:17,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:17 WrapperNode [2022-02-21 03:04:17,134 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:04:17,135 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:04:17,135 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:04:17,135 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:04:17,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:17" (1/1) ... [2022-02-21 03:04:17,143 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:17" (1/1) ... [2022-02-21 03:04:17,159 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 31 [2022-02-21 03:04:17,159 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:04:17,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:04:17,160 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:04:17,161 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:04:17,166 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:17" (1/1) ... [2022-02-21 03:04:17,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:17" (1/1) ... [2022-02-21 03:04:17,168 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:17" (1/1) ... [2022-02-21 03:04:17,168 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:17" (1/1) ... [2022-02-21 03:04:17,171 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:17" (1/1) ... [2022-02-21 03:04:17,174 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:17" (1/1) ... [2022-02-21 03:04:17,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:17" (1/1) ... [2022-02-21 03:04:17,178 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:04:17,179 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:04:17,179 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:04:17,179 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:04:17,180 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:17" (1/1) ... [2022-02-21 03:04:17,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:04:17,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:04:17,202 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-21 03:04:17,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-21 03:04:17,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:04:17,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:04:17,266 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:04:17,267 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:04:17,420 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:04:17,438 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:04:17,438 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:04:17,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:04:17 BoogieIcfgContainer [2022-02-21 03:04:17,439 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:04:17,440 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:04:17,441 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:04:17,443 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:04:17,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:04:16" (1/3) ... [2022-02-21 03:04:17,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c274b33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:04:17, skipping insertion in model container [2022-02-21 03:04:17,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:17" (2/3) ... [2022-02-21 03:04:17,444 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c274b33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:04:17, skipping insertion in model container [2022-02-21 03:04:17,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:04:17" (3/3) ... [2022-02-21 03:04:17,445 INFO L111 eAbstractionObserver]: Analyzing ICFG BrockschmidtCookFuhs-CAV2013-Fig1.c [2022-02-21 03:04:17,449 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:04:17,449 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-02-21 03:04:17,478 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:04:17,483 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-21 03:04:17,484 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-21 03:04:17,494 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:17,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-21 03:04:17,497 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:17,498 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-21 03:04:17,499 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:04:17,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:17,503 INFO L85 PathProgramCache]: Analyzing trace with hash 28699890, now seen corresponding path program 1 times [2022-02-21 03:04:17,509 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:17,509 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856504966] [2022-02-21 03:04:17,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:17,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:17,655 INFO L290 TraceCheckUtils]: 0: Hoare triple {19#true} assume { :begin_inline_ULTIMATE.init } true; {19#true} is VALID [2022-02-21 03:04:17,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {19#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~i~0#1, main_~j~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~n~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~n~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {21#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:17,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {22#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:17,664 INFO L290 TraceCheckUtils]: 3: Hoare triple {22#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !(main_~j~0#1 <= main_~i~0#1); {22#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:17,664 INFO L290 TraceCheckUtils]: 4: Hoare triple {22#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !(1 + main_~i~0#1 <= 2147483647); {20#false} is VALID [2022-02-21 03:04:17,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:17,666 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:17,666 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856504966] [2022-02-21 03:04:17,667 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856504966] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:04:17,668 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:04:17,668 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:04:17,669 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810459394] [2022-02-21 03:04:17,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:04:17,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 03:04:17,676 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:17,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:17,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:17,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:04:17,689 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:17,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:04:17,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:04:17,709 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:17,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:17,764 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-02-21 03:04:17,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:04:17,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 03:04:17,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:17,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:17,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-02-21 03:04:17,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:17,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-02-21 03:04:17,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 36 transitions. [2022-02-21 03:04:17,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:17,801 INFO L225 Difference]: With dead ends: 29 [2022-02-21 03:04:17,801 INFO L226 Difference]: Without dead ends: 11 [2022-02-21 03:04:17,803 INFO L932 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 [2022-02-21 03:04:17,806 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 20 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:17,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 14 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:17,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-02-21 03:04:17,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-02-21 03:04:17,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:17,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand has 11 states, 8 states have (on average 1.5) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:17,829 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand has 11 states, 8 states have (on average 1.5) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:17,829 INFO L87 Difference]: Start difference. First operand 11 states. Second operand has 11 states, 8 states have (on average 1.5) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:17,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:17,835 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2022-02-21 03:04:17,835 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2022-02-21 03:04:17,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:17,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:17,835 INFO L74 IsIncluded]: Start isIncluded. First operand has 11 states, 8 states have (on average 1.5) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11 states. [2022-02-21 03:04:17,836 INFO L87 Difference]: Start difference. First operand has 11 states, 8 states have (on average 1.5) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11 states. [2022-02-21 03:04:17,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:17,843 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2022-02-21 03:04:17,843 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2022-02-21 03:04:17,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:17,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:17,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:17,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:17,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 1.5) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:17,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2022-02-21 03:04:17,846 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 5 [2022-02-21 03:04:17,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:17,847 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2022-02-21 03:04:17,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:17,848 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2022-02-21 03:04:17,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-21 03:04:17,848 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:17,848 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-21 03:04:17,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:04:17,849 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:04:17,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:17,853 INFO L85 PathProgramCache]: Analyzing trace with hash 28699945, now seen corresponding path program 1 times [2022-02-21 03:04:17,853 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:17,853 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465477269] [2022-02-21 03:04:17,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:17,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:17,881 INFO L290 TraceCheckUtils]: 0: Hoare triple {97#true} assume { :begin_inline_ULTIMATE.init } true; {97#true} is VALID [2022-02-21 03:04:17,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {97#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~i~0#1, main_~j~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~n~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~n~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {97#true} is VALID [2022-02-21 03:04:17,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {97#true} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {99#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:04:17,887 INFO L290 TraceCheckUtils]: 3: Hoare triple {99#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume !!(main_~j~0#1 <= main_~i~0#1); {99#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:04:17,892 INFO L290 TraceCheckUtils]: 4: Hoare triple {99#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume !(1 + main_~j~0#1 <= 2147483647); {98#false} is VALID [2022-02-21 03:04:17,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:17,892 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:17,892 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465477269] [2022-02-21 03:04:17,893 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465477269] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:04:17,893 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:04:17,893 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:04:17,893 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063594319] [2022-02-21 03:04:17,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:04:17,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 03:04:17,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:17,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:17,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:17,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:04:17,903 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:17,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:04:17,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:17,908 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:17,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:17,950 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-02-21 03:04:17,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:04:17,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 03:04:17,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:17,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:17,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2022-02-21 03:04:17,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:17,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2022-02-21 03:04:17,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 22 transitions. [2022-02-21 03:04:17,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:17,968 INFO L225 Difference]: With dead ends: 19 [2022-02-21 03:04:17,969 INFO L226 Difference]: Without dead ends: 18 [2022-02-21 03:04:17,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:17,970 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:17,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 12 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:17,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-21 03:04:17,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2022-02-21 03:04:17,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:17,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 13 states, 10 states have (on average 1.5) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:17,977 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 13 states, 10 states have (on average 1.5) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:17,977 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 13 states, 10 states have (on average 1.5) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:17,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:17,978 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-02-21 03:04:17,979 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-02-21 03:04:17,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:17,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:17,979 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 10 states have (on average 1.5) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states. [2022-02-21 03:04:17,979 INFO L87 Difference]: Start difference. First operand has 13 states, 10 states have (on average 1.5) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states. [2022-02-21 03:04:17,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:17,980 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-02-21 03:04:17,980 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-02-21 03:04:17,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:17,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:17,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:17,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:17,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 10 states have (on average 1.5) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:17,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-02-21 03:04:17,982 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 5 [2022-02-21 03:04:17,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:17,982 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-02-21 03:04:17,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:17,983 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-02-21 03:04:17,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 03:04:17,983 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:17,983 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:04:17,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:04:17,984 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:04:17,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:17,984 INFO L85 PathProgramCache]: Analyzing trace with hash 889696651, now seen corresponding path program 1 times [2022-02-21 03:04:17,984 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:17,984 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797358299] [2022-02-21 03:04:17,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:17,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:17,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:18,005 INFO L290 TraceCheckUtils]: 0: Hoare triple {177#true} assume { :begin_inline_ULTIMATE.init } true; {177#true} is VALID [2022-02-21 03:04:18,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {177#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~i~0#1, main_~j~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~n~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~n~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {179#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648))} is VALID [2022-02-21 03:04:18,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {179#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648))} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {179#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648))} is VALID [2022-02-21 03:04:18,007 INFO L290 TraceCheckUtils]: 3: Hoare triple {179#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648))} assume !(main_~j~0#1 <= main_~i~0#1); {179#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648))} is VALID [2022-02-21 03:04:18,007 INFO L290 TraceCheckUtils]: 4: Hoare triple {179#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648))} assume 1 + main_~i~0#1 <= 2147483647; {179#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648))} is VALID [2022-02-21 03:04:18,008 INFO L290 TraceCheckUtils]: 5: Hoare triple {179#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648))} assume !(1 + main_~i~0#1 >= -2147483648); {178#false} is VALID [2022-02-21 03:04:18,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:18,008 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:18,008 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797358299] [2022-02-21 03:04:18,009 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797358299] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:04:18,009 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:04:18,009 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:04:18,009 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275994626] [2022-02-21 03:04:18,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:04:18,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-21 03:04:18,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:18,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:18,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:18,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:04:18,015 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:18,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:04:18,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:18,016 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:18,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:18,033 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2022-02-21 03:04:18,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:04:18,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-21 03:04:18,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:18,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:18,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2022-02-21 03:04:18,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:18,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2022-02-21 03:04:18,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 12 transitions. [2022-02-21 03:04:18,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:18,044 INFO L225 Difference]: With dead ends: 13 [2022-02-21 03:04:18,044 INFO L226 Difference]: Without dead ends: 12 [2022-02-21 03:04:18,044 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:18,045 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 5 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:18,046 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 7 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:18,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-02-21 03:04:18,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-02-21 03:04:18,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:18,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:18,054 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:18,054 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:18,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:18,055 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2022-02-21 03:04:18,055 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2022-02-21 03:04:18,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:18,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:18,055 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states. [2022-02-21 03:04:18,056 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states. [2022-02-21 03:04:18,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:18,056 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2022-02-21 03:04:18,057 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2022-02-21 03:04:18,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:18,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:18,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:18,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:18,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:18,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2022-02-21 03:04:18,058 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 6 [2022-02-21 03:04:18,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:18,058 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2022-02-21 03:04:18,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:18,059 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2022-02-21 03:04:18,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 03:04:18,059 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:18,059 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:04:18,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:04:18,060 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:04:18,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:18,060 INFO L85 PathProgramCache]: Analyzing trace with hash 889698349, now seen corresponding path program 1 times [2022-02-21 03:04:18,060 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:18,061 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323151477] [2022-02-21 03:04:18,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:18,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:18,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {237#true} assume { :begin_inline_ULTIMATE.init } true; {237#true} is VALID [2022-02-21 03:04:18,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {237#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~i~0#1, main_~j~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~n~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~n~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {237#true} is VALID [2022-02-21 03:04:18,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {237#true} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {239#(<= 0 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:04:18,080 INFO L290 TraceCheckUtils]: 3: Hoare triple {239#(<= 0 |ULTIMATE.start_main_~j~0#1|)} assume !!(main_~j~0#1 <= main_~i~0#1); {239#(<= 0 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:04:18,081 INFO L290 TraceCheckUtils]: 4: Hoare triple {239#(<= 0 |ULTIMATE.start_main_~j~0#1|)} assume 1 + main_~j~0#1 <= 2147483647; {239#(<= 0 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:04:18,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {239#(<= 0 |ULTIMATE.start_main_~j~0#1|)} assume !(1 + main_~j~0#1 >= -2147483648); {238#false} is VALID [2022-02-21 03:04:18,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:18,081 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:18,082 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323151477] [2022-02-21 03:04:18,082 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323151477] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:04:18,082 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:04:18,082 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:04:18,082 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893835091] [2022-02-21 03:04:18,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:04:18,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-21 03:04:18,083 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:18,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:18,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:18,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:04:18,088 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:18,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:04:18,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:18,089 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:18,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:18,111 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2022-02-21 03:04:18,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:04:18,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-21 03:04:18,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:18,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:18,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2022-02-21 03:04:18,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:18,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2022-02-21 03:04:18,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 12 transitions. [2022-02-21 03:04:18,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:18,122 INFO L225 Difference]: With dead ends: 13 [2022-02-21 03:04:18,122 INFO L226 Difference]: Without dead ends: 12 [2022-02-21 03:04:18,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:18,123 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:18,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 7 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:18,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-02-21 03:04:18,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2022-02-21 03:04:18,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:18,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:18,134 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:18,134 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:18,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:18,135 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2022-02-21 03:04:18,135 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2022-02-21 03:04:18,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:18,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:18,135 INFO L74 IsIncluded]: Start isIncluded. First operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states. [2022-02-21 03:04:18,136 INFO L87 Difference]: Start difference. First operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states. [2022-02-21 03:04:18,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:18,136 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2022-02-21 03:04:18,137 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2022-02-21 03:04:18,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:18,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:18,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:18,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:18,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:18,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2022-02-21 03:04:18,138 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 6 [2022-02-21 03:04:18,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:18,138 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2022-02-21 03:04:18,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:18,139 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2022-02-21 03:04:18,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-21 03:04:18,139 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:18,139 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:04:18,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 03:04:18,140 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:04:18,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:18,140 INFO L85 PathProgramCache]: Analyzing trace with hash 301623087, now seen corresponding path program 1 times [2022-02-21 03:04:18,140 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:18,141 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764494421] [2022-02-21 03:04:18,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:18,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:18,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:18,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {297#true} assume { :begin_inline_ULTIMATE.init } true; {297#true} is VALID [2022-02-21 03:04:18,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {297#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~i~0#1, main_~j~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~n~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~n~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {297#true} is VALID [2022-02-21 03:04:18,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {297#true} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {299#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:04:18,168 INFO L290 TraceCheckUtils]: 3: Hoare triple {299#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume !!(main_~j~0#1 <= main_~i~0#1); {299#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:04:18,168 INFO L290 TraceCheckUtils]: 4: Hoare triple {299#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume 1 + main_~j~0#1 <= 2147483647; {299#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:04:18,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {299#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {300#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-21 03:04:18,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {300#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume !!(main_~j~0#1 <= main_~i~0#1); {300#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-21 03:04:18,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {300#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume !(1 + main_~j~0#1 <= 2147483647); {298#false} is VALID [2022-02-21 03:04:18,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:18,171 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:18,171 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764494421] [2022-02-21 03:04:18,171 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764494421] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:04:18,171 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426724441] [2022-02-21 03:04:18,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:18,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:18,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:04:18,173 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:04:18,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-21 03:04:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:18,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:04:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:18,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:04:18,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {297#true} assume { :begin_inline_ULTIMATE.init } true; {297#true} is VALID [2022-02-21 03:04:18,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {297#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~i~0#1, main_~j~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~n~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~n~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {297#true} is VALID [2022-02-21 03:04:18,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {297#true} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {299#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:04:18,257 INFO L290 TraceCheckUtils]: 3: Hoare triple {299#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume !!(main_~j~0#1 <= main_~i~0#1); {299#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:04:18,258 INFO L290 TraceCheckUtils]: 4: Hoare triple {299#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume 1 + main_~j~0#1 <= 2147483647; {299#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:04:18,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {299#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {300#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-21 03:04:18,259 INFO L290 TraceCheckUtils]: 6: Hoare triple {300#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume !!(main_~j~0#1 <= main_~i~0#1); {300#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-21 03:04:18,259 INFO L290 TraceCheckUtils]: 7: Hoare triple {300#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume !(1 + main_~j~0#1 <= 2147483647); {298#false} is VALID [2022-02-21 03:04:18,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:18,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:04:18,304 INFO L290 TraceCheckUtils]: 7: Hoare triple {325#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} assume !(1 + main_~j~0#1 <= 2147483647); {298#false} is VALID [2022-02-21 03:04:18,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {325#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} assume !!(main_~j~0#1 <= main_~i~0#1); {325#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {332#(<= |ULTIMATE.start_main_~j~0#1| 2147483645)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {325#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,306 INFO L290 TraceCheckUtils]: 4: Hoare triple {332#(<= |ULTIMATE.start_main_~j~0#1| 2147483645)} assume 1 + main_~j~0#1 <= 2147483647; {332#(<= |ULTIMATE.start_main_~j~0#1| 2147483645)} is VALID [2022-02-21 03:04:18,306 INFO L290 TraceCheckUtils]: 3: Hoare triple {332#(<= |ULTIMATE.start_main_~j~0#1| 2147483645)} assume !!(main_~j~0#1 <= main_~i~0#1); {332#(<= |ULTIMATE.start_main_~j~0#1| 2147483645)} is VALID [2022-02-21 03:04:18,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {297#true} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {332#(<= |ULTIMATE.start_main_~j~0#1| 2147483645)} is VALID [2022-02-21 03:04:18,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {297#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~i~0#1, main_~j~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~n~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~n~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {297#true} is VALID [2022-02-21 03:04:18,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {297#true} assume { :begin_inline_ULTIMATE.init } true; {297#true} is VALID [2022-02-21 03:04:18,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:18,307 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426724441] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:04:18,308 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:04:18,308 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-02-21 03:04:18,308 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910309545] [2022-02-21 03:04:18,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:04:18,309 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-21 03:04:18,309 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:18,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:18,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:18,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:04:18,321 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:18,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:04:18,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:04:18,322 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:18,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:18,394 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-02-21 03:04:18,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:04:18,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-21 03:04:18,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:18,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:18,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-02-21 03:04:18,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:18,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-02-21 03:04:18,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-02-21 03:04:18,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:18,424 INFO L225 Difference]: With dead ends: 33 [2022-02-21 03:04:18,424 INFO L226 Difference]: Without dead ends: 32 [2022-02-21 03:04:18,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:04:18,425 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 19 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:18,426 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 18 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:18,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-21 03:04:18,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 20. [2022-02-21 03:04:18,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:18,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:18,454 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:18,454 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:18,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:18,455 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-02-21 03:04:18,455 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-02-21 03:04:18,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:18,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:18,456 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 32 states. [2022-02-21 03:04:18,456 INFO L87 Difference]: Start difference. First operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 32 states. [2022-02-21 03:04:18,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:18,457 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-02-21 03:04:18,458 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-02-21 03:04:18,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:18,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:18,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:18,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:18,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:18,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-02-21 03:04:18,459 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 8 [2022-02-21 03:04:18,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:18,460 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-02-21 03:04:18,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:18,460 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-02-21 03:04:18,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-21 03:04:18,461 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:18,461 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1] [2022-02-21 03:04:18,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:04:18,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:18,675 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:04:18,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:18,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1687014999, now seen corresponding path program 2 times [2022-02-21 03:04:18,675 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:18,675 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85715877] [2022-02-21 03:04:18,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:18,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:18,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:18,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {480#true} assume { :begin_inline_ULTIMATE.init } true; {480#true} is VALID [2022-02-21 03:04:18,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {480#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~i~0#1, main_~j~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~n~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~n~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {482#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:18,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {482#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,721 INFO L290 TraceCheckUtils]: 3: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !!(main_~j~0#1 <= main_~i~0#1); {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,721 INFO L290 TraceCheckUtils]: 4: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume 1 + main_~j~0#1 <= 2147483647; {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,722 INFO L290 TraceCheckUtils]: 6: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !!(main_~j~0#1 <= main_~i~0#1); {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume 1 + main_~j~0#1 <= 2147483647; {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !!(main_~j~0#1 <= main_~i~0#1); {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume 1 + main_~j~0#1 <= 2147483647; {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !!(main_~j~0#1 <= main_~i~0#1); {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume 1 + main_~j~0#1 <= 2147483647; {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,730 INFO L290 TraceCheckUtils]: 15: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !!(main_~j~0#1 <= main_~i~0#1); {484#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {484#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} assume !(1 + main_~j~0#1 <= 2147483647); {481#false} is VALID [2022-02-21 03:04:18,731 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-02-21 03:04:18,731 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:18,731 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85715877] [2022-02-21 03:04:18,731 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85715877] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:04:18,732 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882859429] [2022-02-21 03:04:18,732 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:04:18,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:18,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:04:18,736 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:04:18,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-21 03:04:18,758 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-21 03:04:18,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:04:18,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:04:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:18,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:04:18,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {480#true} assume { :begin_inline_ULTIMATE.init } true; {480#true} is VALID [2022-02-21 03:04:18,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {480#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~i~0#1, main_~j~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~n~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~n~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {482#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:18,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {482#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,840 INFO L290 TraceCheckUtils]: 3: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !!(main_~j~0#1 <= main_~i~0#1); {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,840 INFO L290 TraceCheckUtils]: 4: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume 1 + main_~j~0#1 <= 2147483647; {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,841 INFO L290 TraceCheckUtils]: 5: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,841 INFO L290 TraceCheckUtils]: 6: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !!(main_~j~0#1 <= main_~i~0#1); {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,841 INFO L290 TraceCheckUtils]: 7: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume 1 + main_~j~0#1 <= 2147483647; {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !!(main_~j~0#1 <= main_~i~0#1); {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,843 INFO L290 TraceCheckUtils]: 10: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume 1 + main_~j~0#1 <= 2147483647; {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,843 INFO L290 TraceCheckUtils]: 11: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !!(main_~j~0#1 <= main_~i~0#1); {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume 1 + main_~j~0#1 <= 2147483647; {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,844 INFO L290 TraceCheckUtils]: 14: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,845 INFO L290 TraceCheckUtils]: 15: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !!(main_~j~0#1 <= main_~i~0#1); {484#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {484#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} assume !(1 + main_~j~0#1 <= 2147483647); {481#false} is VALID [2022-02-21 03:04:18,845 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-02-21 03:04:18,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:04:18,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {484#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} assume !(1 + main_~j~0#1 <= 2147483647); {481#false} is VALID [2022-02-21 03:04:18,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !!(main_~j~0#1 <= main_~i~0#1); {484#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,919 INFO L290 TraceCheckUtils]: 14: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,919 INFO L290 TraceCheckUtils]: 13: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume 1 + main_~j~0#1 <= 2147483647; {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,919 INFO L290 TraceCheckUtils]: 12: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !!(main_~j~0#1 <= main_~i~0#1); {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,920 INFO L290 TraceCheckUtils]: 11: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,920 INFO L290 TraceCheckUtils]: 10: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume 1 + main_~j~0#1 <= 2147483647; {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,921 INFO L290 TraceCheckUtils]: 9: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !!(main_~j~0#1 <= main_~i~0#1); {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume 1 + main_~j~0#1 <= 2147483647; {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !!(main_~j~0#1 <= main_~i~0#1); {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,922 INFO L290 TraceCheckUtils]: 4: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume 1 + main_~j~0#1 <= 2147483647; {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,923 INFO L290 TraceCheckUtils]: 3: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !!(main_~j~0#1 <= main_~i~0#1); {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {482#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {483#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:18,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {480#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~i~0#1, main_~j~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~n~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~n~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {482#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:18,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {480#true} assume { :begin_inline_ULTIMATE.init } true; {480#true} is VALID [2022-02-21 03:04:18,924 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-02-21 03:04:18,924 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882859429] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:04:18,925 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:04:18,925 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2022-02-21 03:04:18,925 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007229865] [2022-02-21 03:04:18,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:04:18,926 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-21 03:04:18,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:18,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:18,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:18,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:04:18,931 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:18,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:04:18,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:04:18,932 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:18,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:18,998 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-02-21 03:04:18,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:04:18,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-21 03:04:18,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:18,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:18,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2022-02-21 03:04:18,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:18,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2022-02-21 03:04:19,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 15 transitions. [2022-02-21 03:04:19,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:19,011 INFO L225 Difference]: With dead ends: 23 [2022-02-21 03:04:19,011 INFO L226 Difference]: Without dead ends: 0 [2022-02-21 03:04:19,011 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:04:19,012 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:19,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 5 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:19,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-21 03:04:19,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-21 03:04:19,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:19,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:19,013 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:19,013 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:19,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:19,014 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:04:19,014 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:04:19,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:19,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:19,014 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-21 03:04:19,014 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-21 03:04:19,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:19,014 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:04:19,014 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:04:19,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:19,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:19,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:19,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:19,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:19,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 03:04:19,015 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2022-02-21 03:04:19,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:19,016 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:04:19,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:19,016 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:04:19,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:19,018 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-02-21 03:04:19,018 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-02-21 03:04:19,018 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-02-21 03:04:19,019 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-02-21 03:04:19,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:04:19,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-02-21 03:04:19,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-21 03:04:19,350 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2022-02-21 03:04:19,350 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-21 03:04:19,351 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2022-02-21 03:04:19,351 INFO L854 garLoopResultBuilder]: At program point L21-2(lines 21 23) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648)) (<= |ULTIMATE.start_main_~i~0#1| 2147483646) (<= 0 |ULTIMATE.start_main_~j~0#1|)) [2022-02-21 03:04:19,351 INFO L858 garLoopResultBuilder]: For program point L21-3(lines 21 23) no Hoare annotation was computed. [2022-02-21 03:04:19,351 INFO L854 garLoopResultBuilder]: At program point L19-2(lines 19 25) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= 0 (+ |ULTIMATE.start_main_~i~0#1| 2147483648))) [2022-02-21 03:04:19,351 INFO L858 garLoopResultBuilder]: For program point L19-3(lines 19 25) no Hoare annotation was computed. [2022-02-21 03:04:19,351 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-21 03:04:19,351 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2022-02-21 03:04:19,351 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2022-02-21 03:04:19,352 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-21 03:04:19,352 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-21 03:04:19,352 INFO L854 garLoopResultBuilder]: At program point L26(lines 14 27) the Hoare annotation is: (<= |ULTIMATE.start_main_~n~0#1| 2147483647) [2022-02-21 03:04:19,352 INFO L858 garLoopResultBuilder]: For program point L24(line 24) no Hoare annotation was computed. [2022-02-21 03:04:19,352 INFO L858 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2022-02-21 03:04:19,352 INFO L858 garLoopResultBuilder]: For program point L22-1(line 22) no Hoare annotation was computed. [2022-02-21 03:04:19,354 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2022-02-21 03:04:19,355 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 03:04:19,358 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-21 03:04:19,358 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-21 03:04:19,358 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2022-02-21 03:04:19,358 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2022-02-21 03:04:19,360 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2022-02-21 03:04:19,360 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2022-02-21 03:04:19,360 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2022-02-21 03:04:19,360 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-21 03:04:19,360 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-21 03:04:19,360 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2022-02-21 03:04:19,360 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2022-02-21 03:04:19,360 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-21 03:04:19,360 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-21 03:04:19,360 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-21 03:04:19,360 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-21 03:04:19,360 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-21 03:04:19,360 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-21 03:04:19,360 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-21 03:04:19,360 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-21 03:04:19,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 03:04:19 BoogieIcfgContainer [2022-02-21 03:04:19,371 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-21 03:04:19,373 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:04:19,373 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:04:19,373 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:04:19,373 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:04:17" (3/4) ... [2022-02-21 03:04:19,378 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-21 03:04:19,385 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-21 03:04:19,386 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-02-21 03:04:19,386 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-21 03:04:19,414 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 03:04:19,414 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:04:19,415 INFO L158 Benchmark]: Toolchain (without parser) took 2498.63ms. Allocated memory was 119.5MB in the beginning and 151.0MB in the end (delta: 31.5MB). Free memory was 87.2MB in the beginning and 122.9MB in the end (delta: -35.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:04:19,416 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 81.8MB. Free memory was 37.8MB in the beginning and 37.7MB in the end (delta: 47.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:04:19,416 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.81ms. Allocated memory is still 119.5MB. Free memory was 86.9MB in the beginning and 96.1MB in the end (delta: -9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:04:19,416 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.69ms. Allocated memory is still 119.5MB. Free memory was 96.1MB in the beginning and 94.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:04:19,417 INFO L158 Benchmark]: Boogie Preprocessor took 17.82ms. Allocated memory is still 119.5MB. Free memory was 94.5MB in the beginning and 93.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:04:19,417 INFO L158 Benchmark]: RCFGBuilder took 260.64ms. Allocated memory is still 119.5MB. Free memory was 93.5MB in the beginning and 83.5MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 03:04:19,417 INFO L158 Benchmark]: TraceAbstraction took 1930.87ms. Allocated memory was 119.5MB in the beginning and 151.0MB in the end (delta: 31.5MB). Free memory was 83.0MB in the beginning and 125.0MB in the end (delta: -41.9MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. [2022-02-21 03:04:19,417 INFO L158 Benchmark]: Witness Printer took 41.32ms. Allocated memory is still 151.0MB. Free memory was 125.0MB in the beginning and 122.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:04:19,419 INFO L339 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.14ms. Allocated memory is still 81.8MB. Free memory was 37.8MB in the beginning and 37.7MB in the end (delta: 47.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 214.81ms. Allocated memory is still 119.5MB. Free memory was 86.9MB in the beginning and 96.1MB in the end (delta: -9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.69ms. Allocated memory is still 119.5MB. Free memory was 96.1MB in the beginning and 94.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.82ms. Allocated memory is still 119.5MB. Free memory was 94.5MB in the beginning and 93.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 260.64ms. Allocated memory is still 119.5MB. Free memory was 93.5MB in the beginning and 83.5MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1930.87ms. Allocated memory was 119.5MB in the beginning and 151.0MB in the end (delta: 31.5MB). Free memory was 83.0MB in the beginning and 125.0MB in the end (delta: -41.9MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. * Witness Printer took 41.32ms. Allocated memory is still 151.0MB. Free memory was 125.0MB in the beginning and 122.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 6, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 69 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 69 mSDsluCounter, 63 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 72 IncrementalHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 38 mSDtfsCounter, 72 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=5, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 11 NumberOfFragments, 27 HoareAnnotationTreeSize, 3 FomulaSimplifications, 163 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 328 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 72 NumberOfCodeBlocks, 60 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 87 ConstructedInterpolants, 0 QuantifiedInterpolants, 239 SizeOfPredicates, 4 NumberOfNonLiveVariables, 33 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 66/84 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: n <= 2147483647 && 0 <= i + 2147483648 - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: ((n <= 2147483647 && 0 <= i + 2147483648) && i <= 2147483646) && 0 <= j - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: n <= 2147483647 RESULT: Ultimate proved your program to be correct! [2022-02-21 03:04:19,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE