./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-Fig2b.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/AliasDarteFeautrierGonnord-SAS2010-Fig2b.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 2d15f7a175b7227b2fe35aa1981e666cdccea86724b9e7e9c290d14ef6b6263a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:03:33,202 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:03:33,205 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:03:33,237 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:03:33,238 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:03:33,241 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:03:33,242 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:03:33,247 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:03:33,249 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:03:33,253 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:03:33,254 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:03:33,255 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:03:33,255 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:03:33,258 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:03:33,259 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:03:33,262 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:03:33,263 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:03:33,263 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:03:33,265 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:03:33,270 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:03:33,272 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:03:33,272 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:03:33,274 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:03:33,275 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:03:33,281 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:03:33,281 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:03:33,281 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:03:33,283 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:03:33,283 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:03:33,284 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:03:33,285 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:03:33,285 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:03:33,287 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:03:33,288 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:03:33,289 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:03:33,289 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:03:33,289 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:03:33,290 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:03:33,290 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:03:33,291 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:03:33,292 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:03:33,293 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:03:33,328 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:03:33,328 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:03:33,329 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:03:33,329 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:03:33,330 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:03:33,330 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:03:33,330 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:03:33,331 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:03:33,331 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:03:33,331 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:03:33,332 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:03:33,332 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:03:33,332 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:03:33,332 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:03:33,332 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:03:33,333 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:03:33,333 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:03:33,333 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:03:33,333 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:03:33,333 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:03:33,334 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:03:33,334 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:03:33,334 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:03:33,334 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:03:33,334 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:03:33,335 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:03:33,335 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:03:33,335 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:03:33,335 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:03:33,336 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:03:33,336 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 -> 2d15f7a175b7227b2fe35aa1981e666cdccea86724b9e7e9c290d14ef6b6263a [2022-02-21 03:03:33,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:03:33,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:03:33,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:03:33,586 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:03:33,587 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:03:33,588 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-Fig2b.c [2022-02-21 03:03:33,656 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dae72112/5f74e120b112416f971e1356431c0d6e/FLAGf57ebc7ad [2022-02-21 03:03:34,090 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:03:34,091 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-Fig2b.c [2022-02-21 03:03:34,099 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dae72112/5f74e120b112416f971e1356431c0d6e/FLAGf57ebc7ad [2022-02-21 03:03:34,516 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dae72112/5f74e120b112416f971e1356431c0d6e [2022-02-21 03:03:34,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:03:34,520 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:03:34,524 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:03:34,524 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:03:34,526 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:03:34,527 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:03:34" (1/1) ... [2022-02-21 03:03:34,528 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b751d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:34, skipping insertion in model container [2022-02-21 03:03:34,528 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:03:34" (1/1) ... [2022-02-21 03:03:34,535 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:03:34,549 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:03:34,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:03:34,698 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:03:34,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:03:34,722 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:03:34,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:34 WrapperNode [2022-02-21 03:03:34,723 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:03:34,724 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:03:34,724 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:03:34,724 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:03:34,730 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:03:34" (1/1) ... [2022-02-21 03:03:34,733 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:03:34" (1/1) ... [2022-02-21 03:03:34,764 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 68 [2022-02-21 03:03:34,764 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:03:34,765 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:03:34,765 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:03:34,765 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:03:34,772 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:34" (1/1) ... [2022-02-21 03:03:34,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:34" (1/1) ... [2022-02-21 03:03:34,778 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:34" (1/1) ... [2022-02-21 03:03:34,778 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:34" (1/1) ... [2022-02-21 03:03:34,783 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:34" (1/1) ... [2022-02-21 03:03:34,788 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:34" (1/1) ... [2022-02-21 03:03:34,792 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:34" (1/1) ... [2022-02-21 03:03:34,795 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:03:34,796 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:03:34,797 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:03:34,797 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:03:34,798 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:34" (1/1) ... [2022-02-21 03:03:34,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:03:34,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:34,825 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:03:34,848 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:03:34,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:03:34,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:03:34,921 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:03:34,923 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:03:35,227 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:03:35,233 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:03:35,233 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-21 03:03:35,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:03:35 BoogieIcfgContainer [2022-02-21 03:03:35,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:03:35,236 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:03:35,236 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:03:35,238 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:03:35,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:03:34" (1/3) ... [2022-02-21 03:03:35,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3012849f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:03:35, skipping insertion in model container [2022-02-21 03:03:35,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:34" (2/3) ... [2022-02-21 03:03:35,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3012849f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:03:35, skipping insertion in model container [2022-02-21 03:03:35,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:03:35" (3/3) ... [2022-02-21 03:03:35,245 INFO L111 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-Fig2b.c [2022-02-21 03:03:35,251 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:03:35,252 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2022-02-21 03:03:35,283 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:03:35,289 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:03:35,289 INFO L340 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2022-02-21 03:03:35,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 50 states have internal predecessors, (58), 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:03:35,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-21 03:03:35,306 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:35,307 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-21 03:03:35,307 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:03:35,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:35,312 INFO L85 PathProgramCache]: Analyzing trace with hash 925796, now seen corresponding path program 1 times [2022-02-21 03:03:35,320 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:35,320 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133144433] [2022-02-21 03:03:35,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:35,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:35,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:35,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {54#true} assume { :begin_inline_ULTIMATE.init } true; {54#true} is VALID [2022-02-21 03:03:35,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#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~nondet4#1, main_#t~short5#1, main_#t~nondet2#1, main_#t~short3#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; {56#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} is VALID [2022-02-21 03:03:35,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {56#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} assume !!(main_~x~0#1 >= 2); {56#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} is VALID [2022-02-21 03:03:35,474 INFO L290 TraceCheckUtils]: 3: Hoare triple {56#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} assume !(main_~x~0#1 - 1 <= 2147483647); {55#false} is VALID [2022-02-21 03:03:35,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:03:35,476 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:35,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133144433] [2022-02-21 03:03:35,477 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133144433] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:35,477 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:35,477 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:03:35,479 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804010196] [2022-02-21 03:03:35,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:35,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2022-02-21 03:03:35,484 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:35,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:03:35,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:35,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:03:35,496 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:35,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:03:35,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:03:35,529 INFO L87 Difference]: Start difference. First operand has 51 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 50 states have internal predecessors, (58), 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.0) internal successors, (4), 3 states have internal predecessors, (4), 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:03:35,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:35,690 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2022-02-21 03:03:35,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:03:35,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2022-02-21 03:03:35,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:35,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:03:35,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2022-02-21 03:03:35,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:03:35,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2022-02-21 03:03:35,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 117 transitions. [2022-02-21 03:03:35,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:35,852 INFO L225 Difference]: With dead ends: 100 [2022-02-21 03:03:35,852 INFO L226 Difference]: Without dead ends: 47 [2022-02-21 03:03:35,854 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:03:35,857 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 43 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:35,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 30 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:35,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-02-21 03:03:35,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2022-02-21 03:03:35,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:35,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 45 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 44 states have internal predecessors, (49), 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:03:35,888 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 45 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 44 states have internal predecessors, (49), 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:03:35,890 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 45 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 44 states have internal predecessors, (49), 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:03:35,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:35,903 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-02-21 03:03:35,903 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-02-21 03:03:35,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:35,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:35,905 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 44 states have internal predecessors, (49), 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 47 states. [2022-02-21 03:03:35,906 INFO L87 Difference]: Start difference. First operand has 45 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 44 states have internal predecessors, (49), 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 47 states. [2022-02-21 03:03:35,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:35,910 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-02-21 03:03:35,910 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-02-21 03:03:35,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:35,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:35,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:35,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:35,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 44 states have internal predecessors, (49), 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:03:35,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2022-02-21 03:03:35,917 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 4 [2022-02-21 03:03:35,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:35,918 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2022-02-21 03:03:35,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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:03:35,920 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-02-21 03:03:35,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-21 03:03:35,920 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:35,920 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-21 03:03:35,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:03:35,921 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:03:35,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:35,925 INFO L85 PathProgramCache]: Analyzing trace with hash 28699721, now seen corresponding path program 1 times [2022-02-21 03:03:35,925 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:35,926 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428160057] [2022-02-21 03:03:35,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:35,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:35,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:35,962 INFO L290 TraceCheckUtils]: 0: Hoare triple {310#true} assume { :begin_inline_ULTIMATE.init } true; {310#true} is VALID [2022-02-21 03:03:35,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {310#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~nondet4#1, main_#t~short5#1, main_#t~nondet2#1, main_#t~short3#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; {310#true} is VALID [2022-02-21 03:03:35,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {310#true} assume !!(main_~x~0#1 >= 2); {312#(<= 2 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:03:35,963 INFO L290 TraceCheckUtils]: 3: Hoare triple {312#(<= 2 |ULTIMATE.start_main_~x~0#1|)} assume main_~x~0#1 - 1 <= 2147483647; {312#(<= 2 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:03:35,965 INFO L290 TraceCheckUtils]: 4: Hoare triple {312#(<= 2 |ULTIMATE.start_main_~x~0#1|)} assume !(main_~x~0#1 - 1 >= -2147483648); {311#false} is VALID [2022-02-21 03:03:35,966 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:03:35,966 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:35,966 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428160057] [2022-02-21 03:03:35,967 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428160057] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:35,967 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:35,968 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:03:35,971 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210300486] [2022-02-21 03:03:35,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:35,973 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:03:35,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:35,973 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:03:35,978 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:03:35,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:03:35,979 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:35,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:03:35,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:03:35,986 INFO L87 Difference]: Start difference. First operand 45 states and 49 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:03:36,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:36,067 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-02-21 03:03:36,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:03:36,068 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:03:36,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:36,069 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:03:36,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-02-21 03:03:36,071 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:03:36,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-02-21 03:03:36,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 49 transitions. [2022-02-21 03:03:36,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:36,114 INFO L225 Difference]: With dead ends: 45 [2022-02-21 03:03:36,114 INFO L226 Difference]: Without dead ends: 44 [2022-02-21 03:03:36,114 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:03:36,119 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:36,120 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:36,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-21 03:03:36,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-02-21 03:03:36,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:36,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 43 states have internal predecessors, (48), 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:03:36,131 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 43 states have internal predecessors, (48), 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:03:36,132 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 43 states have internal predecessors, (48), 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:03:36,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:36,136 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-02-21 03:03:36,136 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-02-21 03:03:36,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:36,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:36,138 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 43 states have internal predecessors, (48), 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 44 states. [2022-02-21 03:03:36,138 INFO L87 Difference]: Start difference. First operand has 44 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 43 states have internal predecessors, (48), 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 44 states. [2022-02-21 03:03:36,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:36,142 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-02-21 03:03:36,142 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-02-21 03:03:36,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:36,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:36,143 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:36,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:36,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 43 states have internal predecessors, (48), 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:03:36,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-02-21 03:03:36,144 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 5 [2022-02-21 03:03:36,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:36,145 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-02-21 03:03:36,145 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:03:36,145 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-02-21 03:03:36,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 03:03:36,146 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:36,146 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:03:36,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:03:36,146 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:03:36,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:36,148 INFO L85 PathProgramCache]: Analyzing trace with hash 889691398, now seen corresponding path program 1 times [2022-02-21 03:03:36,148 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:36,148 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098193374] [2022-02-21 03:03:36,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:36,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:36,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:03:36,176 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:03:36,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:03:36,208 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:03:36,208 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-21 03:03:36,209 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 20 remaining) [2022-02-21 03:03:36,212 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 20 remaining) [2022-02-21 03:03:36,213 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 20 remaining) [2022-02-21 03:03:36,213 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 20 remaining) [2022-02-21 03:03:36,213 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 20 remaining) [2022-02-21 03:03:36,213 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 20 remaining) [2022-02-21 03:03:36,213 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 20 remaining) [2022-02-21 03:03:36,214 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 20 remaining) [2022-02-21 03:03:36,214 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 20 remaining) [2022-02-21 03:03:36,216 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 20 remaining) [2022-02-21 03:03:36,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 20 remaining) [2022-02-21 03:03:36,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 20 remaining) [2022-02-21 03:03:36,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 20 remaining) [2022-02-21 03:03:36,218 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 20 remaining) [2022-02-21 03:03:36,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 20 remaining) [2022-02-21 03:03:36,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 20 remaining) [2022-02-21 03:03:36,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 20 remaining) [2022-02-21 03:03:36,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 20 remaining) [2022-02-21 03:03:36,219 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 20 remaining) [2022-02-21 03:03:36,220 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 20 remaining) [2022-02-21 03:03:36,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:03:36,225 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-21 03:03:36,227 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 03:03:36,242 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-21 03:03:36,243 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-21 03:03:36,243 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2022-02-21 03:03:36,243 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2022-02-21 03:03:36,243 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2022-02-21 03:03:36,243 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2022-02-21 03:03:36,243 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-21 03:03:36,243 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-21 03:03:36,244 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-21 03:03:36,244 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2022-02-21 03:03:36,244 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2022-02-21 03:03:36,244 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-21 03:03:36,244 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-21 03:03:36,244 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-21 03:03:36,244 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-02-21 03:03:36,244 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-02-21 03:03:36,245 WARN L170 areAnnotationChecker]: L20-6 has no Hoare annotation [2022-02-21 03:03:36,245 WARN L170 areAnnotationChecker]: L20-6 has no Hoare annotation [2022-02-21 03:03:36,245 WARN L170 areAnnotationChecker]: L20-6 has no Hoare annotation [2022-02-21 03:03:36,245 WARN L170 areAnnotationChecker]: L20-7 has no Hoare annotation [2022-02-21 03:03:36,245 WARN L170 areAnnotationChecker]: L20-7 has no Hoare annotation [2022-02-21 03:03:36,245 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-02-21 03:03:36,245 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-02-21 03:03:36,245 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-21 03:03:36,246 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-21 03:03:36,246 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2022-02-21 03:03:36,246 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2022-02-21 03:03:36,246 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-02-21 03:03:36,246 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-02-21 03:03:36,246 WARN L170 areAnnotationChecker]: L20-4 has no Hoare annotation [2022-02-21 03:03:36,246 WARN L170 areAnnotationChecker]: L20-4 has no Hoare annotation [2022-02-21 03:03:36,246 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-02-21 03:03:36,247 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-02-21 03:03:36,247 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-21 03:03:36,250 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-21 03:03:36,250 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-21 03:03:36,250 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-21 03:03:36,250 WARN L170 areAnnotationChecker]: L22-6 has no Hoare annotation [2022-02-21 03:03:36,250 WARN L170 areAnnotationChecker]: L22-6 has no Hoare annotation [2022-02-21 03:03:36,251 WARN L170 areAnnotationChecker]: L22-6 has no Hoare annotation [2022-02-21 03:03:36,251 WARN L170 areAnnotationChecker]: L22-7 has no Hoare annotation [2022-02-21 03:03:36,251 WARN L170 areAnnotationChecker]: L22-7 has no Hoare annotation [2022-02-21 03:03:36,251 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-21 03:03:36,251 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-21 03:03:36,253 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-21 03:03:36,253 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-21 03:03:36,253 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-02-21 03:03:36,253 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-02-21 03:03:36,253 WARN L170 areAnnotationChecker]: L22-4 has no Hoare annotation [2022-02-21 03:03:36,253 WARN L170 areAnnotationChecker]: L22-4 has no Hoare annotation [2022-02-21 03:03:36,254 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-21 03:03:36,254 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-21 03:03:36,254 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-02-21 03:03:36,254 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-02-21 03:03:36,254 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-21 03:03:36,254 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-21 03:03:36,254 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-02-21 03:03:36,254 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-02-21 03:03:36,254 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:03:36,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 03:03:36 BoogieIcfgContainer [2022-02-21 03:03:36,256 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-21 03:03:36,257 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:03:36,257 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:03:36,257 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:03:36,258 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:03:35" (3/4) ... [2022-02-21 03:03:36,259 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-21 03:03:36,287 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 03:03:36,287 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:03:36,288 INFO L158 Benchmark]: Toolchain (without parser) took 1767.52ms. Allocated memory was 88.1MB in the beginning and 127.9MB in the end (delta: 39.8MB). Free memory was 55.5MB in the beginning and 64.1MB in the end (delta: -8.6MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2022-02-21 03:03:36,288 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 88.1MB. Free memory was 43.4MB in the beginning and 43.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:03:36,289 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.40ms. Allocated memory was 88.1MB in the beginning and 127.9MB in the end (delta: 39.8MB). Free memory was 55.3MB in the beginning and 104.9MB in the end (delta: -49.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:03:36,289 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.45ms. Allocated memory is still 127.9MB. Free memory was 104.5MB in the beginning and 103.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:03:36,289 INFO L158 Benchmark]: Boogie Preprocessor took 30.46ms. Allocated memory is still 127.9MB. Free memory was 103.2MB in the beginning and 102.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:03:36,289 INFO L158 Benchmark]: RCFGBuilder took 438.23ms. Allocated memory is still 127.9MB. Free memory was 102.0MB in the beginning and 87.7MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-21 03:03:36,290 INFO L158 Benchmark]: TraceAbstraction took 1020.48ms. Allocated memory is still 127.9MB. Free memory was 87.3MB in the beginning and 65.8MB in the end (delta: 21.5MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. [2022-02-21 03:03:36,290 INFO L158 Benchmark]: Witness Printer took 30.30ms. Allocated memory is still 127.9MB. Free memory was 65.8MB in the beginning and 64.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:03:36,293 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.17ms. Allocated memory is still 88.1MB. Free memory was 43.4MB in the beginning and 43.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 199.40ms. Allocated memory was 88.1MB in the beginning and 127.9MB in the end (delta: 39.8MB). Free memory was 55.3MB in the beginning and 104.9MB in the end (delta: -49.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.45ms. Allocated memory is still 127.9MB. Free memory was 104.5MB in the beginning and 103.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.46ms. Allocated memory is still 127.9MB. Free memory was 103.2MB in the beginning and 102.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 438.23ms. Allocated memory is still 127.9MB. Free memory was 102.0MB in the beginning and 87.7MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1020.48ms. Allocated memory is still 127.9MB. Free memory was 87.3MB in the beginning and 65.8MB in the end (delta: 21.5MB). Peak memory consumption was 23.0MB. Max. memory is 16.1GB. * Witness Printer took 30.30ms. Allocated memory is still 127.9MB. Free memory was 65.8MB in the beginning and 64.1MB in the end (delta: 1.8MB). 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 - CounterExampleResult [Line: 19]: integer overflow possible integer overflow possible We found a FailurePath: [L14] int x, y; [L15] x = __VERIFIER_nondet_int() [L16] y = __VERIFIER_nondet_int() [L17] COND TRUE x >= 2 VAL [x=2, y=2147483647] [L18] EXPR x - 1 [L18] x = x - 1 VAL [x=1, y=2147483647] [L19] y + x VAL [x=1, y=2147483647] - UnprovableResult [Line: 18]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 20]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 20]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 21]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 21]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 22]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 22]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 23]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 23]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 24]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 24]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 26]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 26]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 28]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 28]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 51 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 43 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43 mSDsluCounter, 97 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 54 IncrementalHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 71 mSDtfsCounter, 54 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 15 NumberOfCodeBlocks, 15 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 7 ConstructedInterpolants, 0 QuantifiedInterpolants, 15 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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 RESULT: Ultimate proved your program to be incorrect! [2022-02-21 03:03:36,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)