./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/PodelskiRybalchenko-TACAS2011-Fig4.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/PodelskiRybalchenko-TACAS2011-Fig4.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 7fe3843d41a84d22889162aaa1c2b6d18f44faeeac702eea9c45f49a2c72d4bd --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:05:54,317 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:05:54,319 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:05:54,348 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:05:54,348 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:05:54,351 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:05:54,353 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:05:54,358 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:05:54,359 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:05:54,360 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:05:54,360 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:05:54,361 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:05:54,362 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:05:54,366 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:05:54,368 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:05:54,368 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:05:54,371 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:05:54,373 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:05:54,374 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:05:54,375 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:05:54,378 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:05:54,379 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:05:54,380 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:05:54,381 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:05:54,382 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:05:54,384 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:05:54,384 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:05:54,385 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:05:54,386 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:05:54,386 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:05:54,387 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:05:54,387 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:05:54,388 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:05:54,389 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:05:54,390 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:05:54,391 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:05:54,391 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:05:54,391 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:05:54,392 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:05:54,392 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:05:54,393 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:05:54,393 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:05:54,415 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:05:54,415 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:05:54,416 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:05:54,416 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:05:54,417 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:05:54,417 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:05:54,417 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:05:54,418 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:05:54,418 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:05:54,418 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:05:54,422 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:05:54,422 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:05:54,423 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:05:54,423 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:05:54,423 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:05:54,423 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:05:54,423 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:05:54,423 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:05:54,423 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:05:54,424 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:05:54,424 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:05:54,424 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:05:54,424 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:05:54,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:05:54,424 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:05:54,424 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:05:54,425 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:05:54,426 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:05:54,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:05:54,426 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:05:54,426 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 -> 7fe3843d41a84d22889162aaa1c2b6d18f44faeeac702eea9c45f49a2c72d4bd [2022-02-21 03:05:54,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:05:54,640 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:05:54,642 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:05:54,644 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:05:54,644 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:05:54,645 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/PodelskiRybalchenko-TACAS2011-Fig4.c [2022-02-21 03:05:54,694 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48abbd922/f0e3356fb46942d19b18f9c20326954c/FLAGc7b32b5ac [2022-02-21 03:05:54,989 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:05:54,989 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/PodelskiRybalchenko-TACAS2011-Fig4.c [2022-02-21 03:05:54,997 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48abbd922/f0e3356fb46942d19b18f9c20326954c/FLAGc7b32b5ac [2022-02-21 03:05:55,428 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48abbd922/f0e3356fb46942d19b18f9c20326954c [2022-02-21 03:05:55,430 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:05:55,431 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:05:55,432 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:05:55,432 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:05:55,435 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:05:55,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:05:55" (1/1) ... [2022-02-21 03:05:55,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eada551 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:55, skipping insertion in model container [2022-02-21 03:05:55,436 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:05:55" (1/1) ... [2022-02-21 03:05:55,441 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:05:55,449 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:05:55,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:05:55,539 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:05:55,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:05:55,577 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:05:55,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:55 WrapperNode [2022-02-21 03:05:55,578 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:05:55,579 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:05:55,579 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:05:55,579 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:05:55,585 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:05:55" (1/1) ... [2022-02-21 03:05:55,589 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:05:55" (1/1) ... [2022-02-21 03:05:55,603 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 29 [2022-02-21 03:05:55,604 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:05:55,604 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:05:55,604 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:05:55,605 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:05:55,609 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:55" (1/1) ... [2022-02-21 03:05:55,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:55" (1/1) ... [2022-02-21 03:05:55,610 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:55" (1/1) ... [2022-02-21 03:05:55,611 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:55" (1/1) ... [2022-02-21 03:05:55,612 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:55" (1/1) ... [2022-02-21 03:05:55,614 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:55" (1/1) ... [2022-02-21 03:05:55,615 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:55" (1/1) ... [2022-02-21 03:05:55,616 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:05:55,616 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:05:55,617 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:05:55,617 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:05:55,617 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:55" (1/1) ... [2022-02-21 03:05:55,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:05:55,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:05:55,641 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:05:55,658 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:05:55,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:05:55,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:05:55,710 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:05:55,711 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:05:55,821 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:05:55,825 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:05:55,828 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:05:55,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:05:55 BoogieIcfgContainer [2022-02-21 03:05:55,837 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:05:55,838 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:05:55,838 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:05:55,841 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:05:55,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:05:55" (1/3) ... [2022-02-21 03:05:55,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2493bcdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:05:55, skipping insertion in model container [2022-02-21 03:05:55,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:55" (2/3) ... [2022-02-21 03:05:55,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2493bcdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:05:55, skipping insertion in model container [2022-02-21 03:05:55,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:05:55" (3/3) ... [2022-02-21 03:05:55,856 INFO L111 eAbstractionObserver]: Analyzing ICFG PodelskiRybalchenko-TACAS2011-Fig4.c [2022-02-21 03:05:55,860 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:05:55,860 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-02-21 03:05:55,898 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:05:55,918 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:05:55,918 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-21 03:05:55,932 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 15 states have internal predecessors, (18), 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:05:55,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-21 03:05:55,940 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:55,941 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-21 03:05:55,941 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:05:55,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:55,945 INFO L85 PathProgramCache]: Analyzing trace with hash 28699945, now seen corresponding path program 1 times [2022-02-21 03:05:55,951 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:55,952 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310433027] [2022-02-21 03:05:55,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:55,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:56,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {19#true} assume { :begin_inline_ULTIMATE.init } true; {19#true} is VALID [2022-02-21 03:05:56,081 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_#t~nondet3#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {21#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} is VALID [2022-02-21 03:05:56,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} assume !!(main_~x~0#1 > 0 && main_~y~0#1 > 0);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {21#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} is VALID [2022-02-21 03:05:56,082 INFO L290 TraceCheckUtils]: 3: Hoare triple {21#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {21#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} is VALID [2022-02-21 03:05:56,083 INFO L290 TraceCheckUtils]: 4: Hoare triple {21#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} assume !(main_~y~0#1 - 1 <= 2147483647); {20#false} is VALID [2022-02-21 03:05:56,083 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:05:56,084 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:56,085 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310433027] [2022-02-21 03:05:56,085 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310433027] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:05:56,085 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:05:56,086 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:05:56,087 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337685247] [2022-02-21 03:05:56,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:05:56,091 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:05:56,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:56,099 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:05:56,106 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:05:56,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:05:56,107 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:56,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:05:56,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:05:56,128 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 15 states have internal predecessors, (18), 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 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:05:56,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:56,195 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-02-21 03:05:56,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:05:56,195 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:05:56,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:56,197 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:05:56,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2022-02-21 03:05:56,206 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:05:56,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2022-02-21 03:05:56,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 21 transitions. [2022-02-21 03:05:56,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:56,242 INFO L225 Difference]: With dead ends: 20 [2022-02-21 03:05:56,243 INFO L226 Difference]: Without dead ends: 11 [2022-02-21 03:05:56,245 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:05:56,250 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:05:56,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 12 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:05:56,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-02-21 03:05:56,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-02-21 03:05:56,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:56,276 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:05:56,277 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:05:56,277 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:05:56,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:56,280 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2022-02-21 03:05:56,280 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2022-02-21 03:05:56,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:56,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:56,281 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:05:56,281 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:05:56,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:56,286 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2022-02-21 03:05:56,286 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2022-02-21 03:05:56,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:56,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:56,287 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:56,287 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:56,287 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:05:56,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2022-02-21 03:05:56,289 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 5 [2022-02-21 03:05:56,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:56,290 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2022-02-21 03:05:56,290 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:05:56,291 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2022-02-21 03:05:56,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-21 03:05:56,291 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:56,291 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-21 03:05:56,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:05:56,292 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:05:56,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:56,296 INFO L85 PathProgramCache]: Analyzing trace with hash 28699753, now seen corresponding path program 1 times [2022-02-21 03:05:56,296 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:56,296 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834311911] [2022-02-21 03:05:56,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:56,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:56,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:56,338 INFO L290 TraceCheckUtils]: 0: Hoare triple {81#true} assume { :begin_inline_ULTIMATE.init } true; {81#true} is VALID [2022-02-21 03:05:56,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {81#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_#t~nondet3#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {83#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} is VALID [2022-02-21 03:05:56,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {83#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} assume !!(main_~x~0#1 > 0 && main_~y~0#1 > 0);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {83#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} is VALID [2022-02-21 03:05:56,340 INFO L290 TraceCheckUtils]: 3: Hoare triple {83#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1; {83#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} is VALID [2022-02-21 03:05:56,341 INFO L290 TraceCheckUtils]: 4: Hoare triple {83#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} assume !(main_~x~0#1 - 1 <= 2147483647); {82#false} is VALID [2022-02-21 03:05:56,341 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:05:56,342 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:56,342 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834311911] [2022-02-21 03:05:56,343 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834311911] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:05:56,343 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:05:56,345 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:05:56,345 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599711839] [2022-02-21 03:05:56,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:05:56,346 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:05:56,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:56,347 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:05:56,354 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:05:56,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:05:56,354 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:56,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:05:56,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:05:56,359 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:05:56,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:56,378 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2022-02-21 03:05:56,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:05:56,379 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:05:56,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:56,380 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:05:56,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2022-02-21 03:05:56,381 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:05:56,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2022-02-21 03:05:56,387 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 12 transitions. [2022-02-21 03:05:56,398 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:05:56,399 INFO L225 Difference]: With dead ends: 11 [2022-02-21 03:05:56,399 INFO L226 Difference]: Without dead ends: 10 [2022-02-21 03:05:56,399 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:05:56,403 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 6 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:05:56,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 8 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:05:56,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-02-21 03:05:56,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-02-21 03:05:56,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:56,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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:05:56,409 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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:05:56,409 INFO L87 Difference]: Start difference. First operand 10 states. Second operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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:05:56,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:56,410 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2022-02-21 03:05:56,410 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2022-02-21 03:05:56,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:56,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:56,411 INFO L74 IsIncluded]: Start isIncluded. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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 10 states. [2022-02-21 03:05:56,411 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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 10 states. [2022-02-21 03:05:56,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:56,412 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2022-02-21 03:05:56,412 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2022-02-21 03:05:56,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:56,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:56,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:56,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:56,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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:05:56,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2022-02-21 03:05:56,414 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 5 [2022-02-21 03:05:56,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:56,414 INFO L470 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2022-02-21 03:05:56,415 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:05:56,415 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2022-02-21 03:05:56,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 03:05:56,416 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:56,416 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:05:56,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:05:56,416 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:05:56,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:56,417 INFO L85 PathProgramCache]: Analyzing trace with hash 889698349, now seen corresponding path program 1 times [2022-02-21 03:05:56,417 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:56,418 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447116491] [2022-02-21 03:05:56,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:56,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:56,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:56,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {129#true} assume { :begin_inline_ULTIMATE.init } true; {129#true} is VALID [2022-02-21 03:05:56,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {129#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_#t~nondet3#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {129#true} is VALID [2022-02-21 03:05:56,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {129#true} assume !!(main_~x~0#1 > 0 && main_~y~0#1 > 0);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {131#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:56,473 INFO L290 TraceCheckUtils]: 3: Hoare triple {131#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {131#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:56,473 INFO L290 TraceCheckUtils]: 4: Hoare triple {131#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume main_~y~0#1 - 1 <= 2147483647; {131#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:56,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {131#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume !(main_~y~0#1 - 1 >= -2147483648); {130#false} is VALID [2022-02-21 03:05:56,475 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:05:56,475 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:56,475 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447116491] [2022-02-21 03:05:56,476 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447116491] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:05:56,476 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:05:56,476 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:05:56,476 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30953162] [2022-02-21 03:05:56,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:05:56,477 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:05:56,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:56,477 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:05:56,483 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:05:56,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:05:56,484 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:56,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:05:56,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:05:56,485 INFO L87 Difference]: Start difference. First operand 10 states and 11 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:05:56,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:56,506 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2022-02-21 03:05:56,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:05:56,507 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:05:56,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:56,507 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:05:56,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2022-02-21 03:05:56,508 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:05:56,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2022-02-21 03:05:56,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 11 transitions. [2022-02-21 03:05:56,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:56,518 INFO L225 Difference]: With dead ends: 10 [2022-02-21 03:05:56,518 INFO L226 Difference]: Without dead ends: 9 [2022-02-21 03:05:56,519 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:05:56,524 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:05:56,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 9 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:05:56,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-02-21 03:05:56,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-02-21 03:05:56,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:56,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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:05:56,529 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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:05:56,529 INFO L87 Difference]: Start difference. First operand 9 states. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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:05:56,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:56,530 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2022-02-21 03:05:56,530 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2022-02-21 03:05:56,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:56,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:56,531 INFO L74 IsIncluded]: Start isIncluded. First operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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 9 states. [2022-02-21 03:05:56,532 INFO L87 Difference]: Start difference. First operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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 9 states. [2022-02-21 03:05:56,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:56,533 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2022-02-21 03:05:56,533 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2022-02-21 03:05:56,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:56,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:56,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:56,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:56,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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:05:56,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2022-02-21 03:05:56,537 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2022-02-21 03:05:56,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:56,537 INFO L470 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-02-21 03:05:56,537 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:05:56,537 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2022-02-21 03:05:56,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 03:05:56,538 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:56,538 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:05:56,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:05:56,539 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:05:56,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:56,540 INFO L85 PathProgramCache]: Analyzing trace with hash 889692391, now seen corresponding path program 1 times [2022-02-21 03:05:56,540 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:56,540 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059751593] [2022-02-21 03:05:56,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:56,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:56,573 INFO L290 TraceCheckUtils]: 0: Hoare triple {173#true} assume { :begin_inline_ULTIMATE.init } true; {173#true} is VALID [2022-02-21 03:05:56,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {173#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_#t~nondet3#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {173#true} is VALID [2022-02-21 03:05:56,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {173#true} assume !!(main_~x~0#1 > 0 && main_~y~0#1 > 0);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {175#(<= 1 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:05:56,575 INFO L290 TraceCheckUtils]: 3: Hoare triple {175#(<= 1 |ULTIMATE.start_main_~x~0#1|)} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1; {175#(<= 1 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:05:56,575 INFO L290 TraceCheckUtils]: 4: Hoare triple {175#(<= 1 |ULTIMATE.start_main_~x~0#1|)} assume main_~x~0#1 - 1 <= 2147483647; {175#(<= 1 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:05:56,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {175#(<= 1 |ULTIMATE.start_main_~x~0#1|)} assume !(main_~x~0#1 - 1 >= -2147483648); {174#false} is VALID [2022-02-21 03:05:56,576 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:05:56,576 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:56,576 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059751593] [2022-02-21 03:05:56,576 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059751593] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:05:56,577 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:05:56,577 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:05:56,577 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833480272] [2022-02-21 03:05:56,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:05:56,578 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:05:56,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:56,578 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:05:56,583 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:05:56,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:05:56,583 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:56,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:05:56,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:05:56,584 INFO L87 Difference]: Start difference. First operand 9 states and 10 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:05:56,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:56,602 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2022-02-21 03:05:56,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:05:56,602 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:05:56,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:56,603 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:05:56,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2022-02-21 03:05:56,604 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:05:56,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2022-02-21 03:05:56,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 11 transitions. [2022-02-21 03:05:56,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:56,614 INFO L225 Difference]: With dead ends: 10 [2022-02-21 03:05:56,614 INFO L226 Difference]: Without dead ends: 0 [2022-02-21 03:05:56,615 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:05:56,617 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 3 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:05:56,618 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 8 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:05:56,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-21 03:05:56,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-21 03:05:56,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:56,619 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:05:56,619 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:05:56,620 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:05:56,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:56,620 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:05:56,620 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:05:56,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:56,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:56,620 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:05:56,621 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:05:56,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:56,621 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:05:56,621 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:05:56,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:56,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:56,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:56,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:56,622 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:05:56,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 03:05:56,622 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2022-02-21 03:05:56,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:56,622 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:05:56,623 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:05:56,623 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:05:56,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:56,625 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-02-21 03:05:56,626 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-02-21 03:05:56,626 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-02-21 03:05:56,626 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-02-21 03:05:56,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 03:05:56,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-21 03:05:56,649 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 19) no Hoare annotation was computed. [2022-02-21 03:05:56,650 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-21 03:05:56,650 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2022-02-21 03:05:56,650 INFO L854 garLoopResultBuilder]: At program point L25(lines 13 26) the Hoare annotation is: (<= |ULTIMATE.start_main_~y~0#1| 2147483647) [2022-02-21 03:05:56,650 INFO L858 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-02-21 03:05:56,650 INFO L858 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2022-02-21 03:05:56,650 INFO L858 garLoopResultBuilder]: For program point L17-2(lines 17 24) no Hoare annotation was computed. [2022-02-21 03:05:56,651 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-21 03:05:56,651 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 19) no Hoare annotation was computed. [2022-02-21 03:05:56,651 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2022-02-21 03:05:56,651 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-21 03:05:56,651 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-21 03:05:56,651 INFO L858 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2022-02-21 03:05:56,651 INFO L858 garLoopResultBuilder]: For program point L22-1(line 22) no Hoare annotation was computed. [2022-02-21 03:05:56,651 INFO L858 garLoopResultBuilder]: For program point L18(lines 18 23) no Hoare annotation was computed. [2022-02-21 03:05:56,654 INFO L854 garLoopResultBuilder]: At program point L18-2(lines 17 24) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~x~0#1| 2147483647) (<= |ULTIMATE.start_main_~y~0#1| 2147483647)) [2022-02-21 03:05:56,658 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-21 03:05:56,659 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 03:05:56,661 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-21 03:05:56,662 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-21 03:05:56,662 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2022-02-21 03:05:56,662 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2022-02-21 03:05:56,662 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-21 03:05:56,662 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2022-02-21 03:05:56,662 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-21 03:05:56,662 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-21 03:05:56,662 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-21 03:05:56,662 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-21 03:05:56,662 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-21 03:05:56,663 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-21 03:05:56,663 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-21 03:05:56,663 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-21 03:05:56,663 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-02-21 03:05:56,663 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-02-21 03:05:56,663 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-21 03:05:56,663 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-21 03:05:56,663 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-21 03:05:56,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 03:05:56 BoogieIcfgContainer [2022-02-21 03:05:56,669 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-21 03:05:56,670 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:05:56,670 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:05:56,670 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:05:56,671 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:05:55" (3/4) ... [2022-02-21 03:05:56,672 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-21 03:05:56,678 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-21 03:05:56,678 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-02-21 03:05:56,678 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-21 03:05:56,695 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 03:05:56,695 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:05:56,696 INFO L158 Benchmark]: Toolchain (without parser) took 1265.01ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 65.1MB in the beginning and 44.9MB in the end (delta: 20.2MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. [2022-02-21 03:05:56,696 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 86.0MB. Free memory was 62.3MB in the beginning and 62.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:05:56,697 INFO L158 Benchmark]: CACSL2BoogieTranslator took 145.82ms. Allocated memory is still 86.0MB. Free memory was 64.8MB in the beginning and 62.7MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:05:56,697 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.93ms. Allocated memory is still 86.0MB. Free memory was 62.7MB in the beginning and 61.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:05:56,697 INFO L158 Benchmark]: Boogie Preprocessor took 11.64ms. Allocated memory is still 86.0MB. Free memory was 61.3MB in the beginning and 60.4MB in the end (delta: 874.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:05:56,697 INFO L158 Benchmark]: RCFGBuilder took 220.33ms. Allocated memory is still 86.0MB. Free memory was 60.4MB in the beginning and 50.2MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 03:05:56,698 INFO L158 Benchmark]: TraceAbstraction took 831.80ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 49.7MB in the beginning and 47.0MB in the end (delta: 2.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-02-21 03:05:56,698 INFO L158 Benchmark]: Witness Printer took 25.35ms. Allocated memory is still 104.9MB. Free memory was 47.0MB in the beginning and 44.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:05:56,699 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.15ms. Allocated memory is still 86.0MB. Free memory was 62.3MB in the beginning and 62.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 145.82ms. Allocated memory is still 86.0MB. Free memory was 64.8MB in the beginning and 62.7MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.93ms. Allocated memory is still 86.0MB. Free memory was 62.7MB in the beginning and 61.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 11.64ms. Allocated memory is still 86.0MB. Free memory was 61.3MB in the beginning and 60.4MB in the end (delta: 874.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 220.33ms. Allocated memory is still 86.0MB. Free memory was 60.4MB in the beginning and 50.2MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 831.80ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 49.7MB in the beginning and 47.0MB in the end (delta: 2.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Witness Printer took 25.35ms. Allocated memory is still 104.9MB. Free memory was 47.0MB in the beginning and 44.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: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: 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: 22]: 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: 0.8s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 37 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19 IncrementalHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 33 mSDtfsCounter, 19 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 4 NumberOfFragments, 10 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 11 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 42 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 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: 17]: Loop Invariant Derived loop invariant: x <= 2147483647 && y <= 2147483647 - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: y <= 2147483647 RESULT: Ultimate proved your program to be correct! [2022-02-21 03:05:56,725 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