./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-while2.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-while2.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 a723a67708085ac2edc65dca820ea0ff5f017c1387423fea83ca87f76f9f53c3 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:04:00,804 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:04:00,806 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:04:00,838 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:04:00,839 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:04:00,842 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:04:00,843 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:04:00,845 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:04:00,846 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:04:00,850 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:04:00,851 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:04:00,852 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:04:00,852 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:04:00,854 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:04:00,855 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:04:00,858 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:04:00,859 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:04:00,859 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:04:00,861 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:04:00,865 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:04:00,867 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:04:00,867 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:04:00,869 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:04:00,869 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:04:00,871 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:04:00,871 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:04:00,871 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:04:00,872 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:04:00,872 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:04:00,873 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:04:00,873 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:04:00,874 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:04:00,875 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:04:00,876 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:04:00,877 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:04:00,877 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:04:00,877 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:04:00,877 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:04:00,878 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:04:00,878 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:04:00,879 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:04:00,879 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-02-21 03:04:00,902 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:04:00,903 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:04:00,903 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:04:00,904 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:04:00,904 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:04:00,904 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:04:00,905 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:04:00,905 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:04:00,905 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:04:00,905 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:04:00,906 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:04:00,906 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:04:00,906 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:04:00,906 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:04:00,906 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:04:00,907 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:04:00,907 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:04:00,907 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:04:00,907 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:04:00,907 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:04:00,907 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:04:00,908 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:04:00,908 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:04:00,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:04:00,908 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:04:00,908 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:04:00,908 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:04:00,909 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:04:00,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:04:00,910 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:04:00,910 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 -> a723a67708085ac2edc65dca820ea0ff5f017c1387423fea83ca87f76f9f53c3 [2022-02-21 03:04:01,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:04:01,088 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:04:01,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:04:01,091 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:04:01,092 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:04:01,093 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-while2.c [2022-02-21 03:04:01,147 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93e42da06/62452b69e0f1485597be763c8b8ee708/FLAG82516d16c [2022-02-21 03:04:01,496 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:04:01,496 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-while2.c [2022-02-21 03:04:01,505 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93e42da06/62452b69e0f1485597be763c8b8ee708/FLAG82516d16c [2022-02-21 03:04:01,517 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93e42da06/62452b69e0f1485597be763c8b8ee708 [2022-02-21 03:04:01,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:04:01,522 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:04:01,523 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:04:01,523 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:04:01,526 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:04:01,526 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:04:01" (1/1) ... [2022-02-21 03:04:01,527 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@db1b422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:01, skipping insertion in model container [2022-02-21 03:04:01,527 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:04:01" (1/1) ... [2022-02-21 03:04:01,532 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:04:01,542 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:04:01,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:04:01,689 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:04:01,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:04:01,705 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:04:01,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:01 WrapperNode [2022-02-21 03:04:01,706 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:04:01,707 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:04:01,707 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:04:01,707 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:04:01,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:01" (1/1) ... [2022-02-21 03:04:01,715 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:01" (1/1) ... [2022-02-21 03:04:01,727 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2022-02-21 03:04:01,727 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:04:01,728 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:04:01,728 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:04:01,728 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:04:01,733 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:01" (1/1) ... [2022-02-21 03:04:01,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:01" (1/1) ... [2022-02-21 03:04:01,734 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:01" (1/1) ... [2022-02-21 03:04:01,734 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:01" (1/1) ... [2022-02-21 03:04:01,736 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:01" (1/1) ... [2022-02-21 03:04:01,739 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:01" (1/1) ... [2022-02-21 03:04:01,740 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:01" (1/1) ... [2022-02-21 03:04:01,741 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:04:01,741 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:04:01,741 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:04:01,742 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:04:01,742 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:01" (1/1) ... [2022-02-21 03:04:01,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:04:01,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:04:01,776 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-21 03:04:01,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-21 03:04:01,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:04:01,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:04:01,854 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:04:01,856 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:04:01,940 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:04:01,945 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:04:01,945 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:04:01,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:04:01 BoogieIcfgContainer [2022-02-21 03:04:01,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:04:01,948 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:04:01,948 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:04:01,950 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:04:01,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:04:01" (1/3) ... [2022-02-21 03:04:01,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23a747ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:04:01, skipping insertion in model container [2022-02-21 03:04:01,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:01" (2/3) ... [2022-02-21 03:04:01,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23a747ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:04:01, skipping insertion in model container [2022-02-21 03:04:01,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:04:01" (3/3) ... [2022-02-21 03:04:01,953 INFO L111 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-while2.c [2022-02-21 03:04:01,956 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:04:01,956 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-02-21 03:04:01,998 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:04:02,003 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-21 03:04:02,003 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-21 03:04:02,025 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:02,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-21 03:04:02,029 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:02,029 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-21 03:04:02,029 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:04:02,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:02,033 INFO L85 PathProgramCache]: Analyzing trace with hash 28699890, now seen corresponding path program 1 times [2022-02-21 03:04:02,041 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:02,041 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419628994] [2022-02-21 03:04:02,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:02,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:02,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {19#true} assume { :begin_inline_ULTIMATE.init } true; {19#true} is VALID [2022-02-21 03:04:02,170 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_~i~0#1, main_~j~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~N~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_~N~0#1; {21#(<= |ULTIMATE.start_main_~i~0#1| 2147483647)} is VALID [2022-02-21 03:04:02,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#(<= |ULTIMATE.start_main_~i~0#1| 2147483647)} assume !!(main_~i~0#1 > 0);main_~j~0#1 := main_~N~0#1; {21#(<= |ULTIMATE.start_main_~i~0#1| 2147483647)} is VALID [2022-02-21 03:04:02,171 INFO L290 TraceCheckUtils]: 3: Hoare triple {21#(<= |ULTIMATE.start_main_~i~0#1| 2147483647)} assume !(main_~j~0#1 > 0); {21#(<= |ULTIMATE.start_main_~i~0#1| 2147483647)} is VALID [2022-02-21 03:04:02,171 INFO L290 TraceCheckUtils]: 4: Hoare triple {21#(<= |ULTIMATE.start_main_~i~0#1| 2147483647)} assume !(main_~i~0#1 - 1 <= 2147483647); {20#false} is VALID [2022-02-21 03:04:02,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:02,172 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:02,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419628994] [2022-02-21 03:04:02,173 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419628994] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:04:02,173 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:04:02,173 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:04:02,174 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120055150] [2022-02-21 03:04:02,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:04:02,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 03:04:02,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:02,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:02,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:02,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:04:02,196 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:02,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:04:02,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:02,214 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:02,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:02,253 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-02-21 03:04:02,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:04:02,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 03:04:02,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:02,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:02,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-02-21 03:04:02,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:02,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-02-21 03:04:02,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2022-02-21 03:04:02,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:02,293 INFO L225 Difference]: With dead ends: 29 [2022-02-21 03:04:02,294 INFO L226 Difference]: Without dead ends: 11 [2022-02-21 03:04:02,297 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:02,304 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:02,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 12 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:02,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-02-21 03:04:02,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-02-21 03:04:02,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:02,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand has 11 states, 8 states have (on average 1.5) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:02,347 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand has 11 states, 8 states have (on average 1.5) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:02,347 INFO L87 Difference]: Start difference. First operand 11 states. Second operand has 11 states, 8 states have (on average 1.5) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:02,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:02,349 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2022-02-21 03:04:02,349 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2022-02-21 03:04:02,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:02,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:02,350 INFO L74 IsIncluded]: Start isIncluded. First operand has 11 states, 8 states have (on average 1.5) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11 states. [2022-02-21 03:04:02,350 INFO L87 Difference]: Start difference. First operand has 11 states, 8 states have (on average 1.5) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11 states. [2022-02-21 03:04:02,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:02,353 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2022-02-21 03:04:02,353 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2022-02-21 03:04:02,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:02,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:02,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:02,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:02,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 1.5) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:02,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2022-02-21 03:04:02,357 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 5 [2022-02-21 03:04:02,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:02,358 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2022-02-21 03:04:02,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:02,359 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2022-02-21 03:04:02,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-21 03:04:02,359 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:02,359 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-21 03:04:02,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:04:02,360 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:04:02,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:02,363 INFO L85 PathProgramCache]: Analyzing trace with hash 28699945, now seen corresponding path program 1 times [2022-02-21 03:04:02,363 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:02,364 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198855797] [2022-02-21 03:04:02,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:02,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:02,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {94#true} assume { :begin_inline_ULTIMATE.init } true; {94#true} is VALID [2022-02-21 03:04:02,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {94#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~j~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~N~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_~N~0#1; {96#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:04:02,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {96#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume !!(main_~i~0#1 > 0);main_~j~0#1 := main_~N~0#1; {97#(<= |ULTIMATE.start_main_~j~0#1| 2147483647)} is VALID [2022-02-21 03:04:02,425 INFO L290 TraceCheckUtils]: 3: Hoare triple {97#(<= |ULTIMATE.start_main_~j~0#1| 2147483647)} assume !!(main_~j~0#1 > 0); {97#(<= |ULTIMATE.start_main_~j~0#1| 2147483647)} is VALID [2022-02-21 03:04:02,425 INFO L290 TraceCheckUtils]: 4: Hoare triple {97#(<= |ULTIMATE.start_main_~j~0#1| 2147483647)} assume !(main_~j~0#1 - 1 <= 2147483647); {95#false} is VALID [2022-02-21 03:04:02,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:02,426 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:02,426 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198855797] [2022-02-21 03:04:02,426 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198855797] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:04:02,426 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:04:02,426 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:04:02,427 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303587281] [2022-02-21 03:04:02,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:04:02,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 03:04:02,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:02,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:02,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:02,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:04:02,435 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:02,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:04:02,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:04:02,438 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:02,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:02,493 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2022-02-21 03:04:02,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:04:02,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 03:04:02,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:02,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:02,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2022-02-21 03:04:02,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:02,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2022-02-21 03:04:02,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 13 transitions. [2022-02-21 03:04:02,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:02,507 INFO L225 Difference]: With dead ends: 12 [2022-02-21 03:04:02,507 INFO L226 Difference]: Without dead ends: 11 [2022-02-21 03:04:02,507 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:04:02,508 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 14 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:02,509 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 7 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:02,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-02-21 03:04:02,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2022-02-21 03:04:02,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:02,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 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:04:02,524 INFO L74 IsIncluded]: Start isIncluded. First operand 11 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:04:02,524 INFO L87 Difference]: Start difference. First operand 11 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:04:02,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:02,526 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2022-02-21 03:04:02,526 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2022-02-21 03:04:02,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:02,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:02,527 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 11 states. [2022-02-21 03:04:02,527 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 11 states. [2022-02-21 03:04:02,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:02,529 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2022-02-21 03:04:02,529 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2022-02-21 03:04:02,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:02,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:02,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:02,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:02,530 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:04:02,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2022-02-21 03:04:02,531 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 5 [2022-02-21 03:04:02,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:02,531 INFO L470 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2022-02-21 03:04:02,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:02,532 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2022-02-21 03:04:02,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 03:04:02,533 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:02,533 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:04:02,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:04:02,534 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:04:02,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:02,535 INFO L85 PathProgramCache]: Analyzing trace with hash 889696651, now seen corresponding path program 1 times [2022-02-21 03:04:02,535 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:02,535 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614149505] [2022-02-21 03:04:02,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:02,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:02,564 INFO L290 TraceCheckUtils]: 0: Hoare triple {151#true} assume { :begin_inline_ULTIMATE.init } true; {151#true} is VALID [2022-02-21 03:04:02,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {151#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~j~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~N~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_~N~0#1; {151#true} is VALID [2022-02-21 03:04:02,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {151#true} assume !!(main_~i~0#1 > 0);main_~j~0#1 := main_~N~0#1; {153#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:04:02,565 INFO L290 TraceCheckUtils]: 3: Hoare triple {153#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~j~0#1 > 0); {153#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:04:02,566 INFO L290 TraceCheckUtils]: 4: Hoare triple {153#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume main_~i~0#1 - 1 <= 2147483647; {153#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:04:02,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {153#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 - 1 >= -2147483648); {152#false} is VALID [2022-02-21 03:04:02,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:02,567 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:02,567 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614149505] [2022-02-21 03:04:02,567 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614149505] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:04:02,567 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:04:02,567 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:04:02,567 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679389517] [2022-02-21 03:04:02,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:04:02,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-21 03:04:02,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:02,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:02,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:02,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:04:02,573 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:02,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:04:02,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:02,574 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:04:02,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:02,602 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2022-02-21 03:04:02,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:04:02,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-21 03:04:02,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:02,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:04:02,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2022-02-21 03:04:02,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:04:02,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2022-02-21 03:04:02,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 11 transitions. [2022-02-21 03:04:02,635 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:04:02,636 INFO L225 Difference]: With dead ends: 10 [2022-02-21 03:04:02,636 INFO L226 Difference]: Without dead ends: 9 [2022-02-21 03:04:02,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:02,637 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:02,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 9 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:02,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-02-21 03:04:02,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-02-21 03:04:02,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:02,648 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:04:02,648 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:04:02,648 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:04:02,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:02,649 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2022-02-21 03:04:02,649 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2022-02-21 03:04:02,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:02,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:02,649 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:04:02,649 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:04:02,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:02,650 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2022-02-21 03:04:02,650 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2022-02-21 03:04:02,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:02,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:02,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:02,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:02,650 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:04:02,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2022-02-21 03:04:02,651 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2022-02-21 03:04:02,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:02,651 INFO L470 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-02-21 03:04:02,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:02,651 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2022-02-21 03:04:02,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 03:04:02,651 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:02,651 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:04:02,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:04:02,652 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:04:02,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:02,652 INFO L85 PathProgramCache]: Analyzing trace with hash 889698349, now seen corresponding path program 1 times [2022-02-21 03:04:02,652 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:02,652 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777129998] [2022-02-21 03:04:02,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:02,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:02,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {197#true} assume { :begin_inline_ULTIMATE.init } true; {197#true} is VALID [2022-02-21 03:04:02,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {197#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~j~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~N~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_~N~0#1; {197#true} is VALID [2022-02-21 03:04:02,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {197#true} assume !!(main_~i~0#1 > 0);main_~j~0#1 := main_~N~0#1; {197#true} is VALID [2022-02-21 03:04:02,672 INFO L290 TraceCheckUtils]: 3: Hoare triple {197#true} assume !!(main_~j~0#1 > 0); {199#(<= 1 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:04:02,673 INFO L290 TraceCheckUtils]: 4: Hoare triple {199#(<= 1 |ULTIMATE.start_main_~j~0#1|)} assume main_~j~0#1 - 1 <= 2147483647; {199#(<= 1 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:04:02,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {199#(<= 1 |ULTIMATE.start_main_~j~0#1|)} assume !(main_~j~0#1 - 1 >= -2147483648); {198#false} is VALID [2022-02-21 03:04:02,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:02,674 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:02,674 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777129998] [2022-02-21 03:04:02,674 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777129998] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:04:02,674 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:04:02,674 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:04:02,674 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473001817] [2022-02-21 03:04:02,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:04:02,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-21 03:04:02,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:02,675 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:02,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:02,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:04:02,680 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:02,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:04:02,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:02,681 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:04:02,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:02,707 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2022-02-21 03:04:02,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:04:02,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-21 03:04:02,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:02,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:02,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2022-02-21 03:04:02,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:02,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2022-02-21 03:04:02,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 10 transitions. [2022-02-21 03:04:02,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:02,721 INFO L225 Difference]: With dead ends: 9 [2022-02-21 03:04:02,721 INFO L226 Difference]: Without dead ends: 0 [2022-02-21 03:04:02,722 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:02,723 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:02,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:02,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-21 03:04:02,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-21 03:04:02,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:02,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:02,724 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:02,724 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:02,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:02,724 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:04:02,724 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:04:02,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:02,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:02,724 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-21 03:04:02,724 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-21 03:04:02,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:02,724 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:04:02,724 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:04:02,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:02,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:02,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:02,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:02,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:02,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 03:04:02,725 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2022-02-21 03:04:02,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:02,725 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:04:02,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:02,725 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:04:02,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:02,727 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-02-21 03:04:02,727 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-02-21 03:04:02,727 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-02-21 03:04:02,727 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-02-21 03:04:02,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 03:04:02,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-21 03:04:02,757 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2022-02-21 03:04:02,757 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-21 03:04:02,757 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2022-02-21 03:04:02,758 INFO L854 garLoopResultBuilder]: At program point L19-2(lines 19 21) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 2147483647) (<= |ULTIMATE.start_main_~j~0#1| 2147483647) (<= |ULTIMATE.start_main_~N~0#1| 2147483647)) [2022-02-21 03:04:02,758 INFO L858 garLoopResultBuilder]: For program point L19-3(lines 19 21) no Hoare annotation was computed. [2022-02-21 03:04:02,758 INFO L854 garLoopResultBuilder]: At program point L17-2(lines 17 23) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~i~0#1| 2147483647) (<= |ULTIMATE.start_main_~N~0#1| 2147483647)) [2022-02-21 03:04:02,758 INFO L858 garLoopResultBuilder]: For program point L17-3(lines 17 23) no Hoare annotation was computed. [2022-02-21 03:04:02,758 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-21 03:04:02,758 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2022-02-21 03:04:02,758 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2022-02-21 03:04:02,758 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-21 03:04:02,758 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-21 03:04:02,758 INFO L854 garLoopResultBuilder]: At program point L24(lines 13 25) the Hoare annotation is: (<= |ULTIMATE.start_main_~i~0#1| 2147483647) [2022-02-21 03:04:02,758 INFO L858 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2022-02-21 03:04:02,758 INFO L858 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2022-02-21 03:04:02,759 INFO L858 garLoopResultBuilder]: For program point L20-1(line 20) no Hoare annotation was computed. [2022-02-21 03:04:02,761 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-21 03:04:02,762 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 03:04:02,764 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-21 03:04:02,764 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-21 03:04:02,764 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2022-02-21 03:04:02,764 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2022-02-21 03:04:02,766 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2022-02-21 03:04:02,766 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2022-02-21 03:04:02,766 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2022-02-21 03:04:02,766 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-21 03:04:02,766 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-21 03:04:02,766 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2022-02-21 03:04:02,766 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2022-02-21 03:04:02,766 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-21 03:04:02,766 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-21 03:04:02,766 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-21 03:04:02,766 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-21 03:04:02,766 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-21 03:04:02,766 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-02-21 03:04:02,766 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-02-21 03:04:02,766 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-21 03:04:02,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 03:04:02 BoogieIcfgContainer [2022-02-21 03:04:02,778 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-21 03:04:02,779 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:04:02,779 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:04:02,779 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:04:02,779 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:04:01" (3/4) ... [2022-02-21 03:04:02,781 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-21 03:04:02,788 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-21 03:04:02,788 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-02-21 03:04:02,788 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-21 03:04:02,817 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 03:04:02,818 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:04:02,818 INFO L158 Benchmark]: Toolchain (without parser) took 1296.82ms. Allocated memory was 100.7MB in the beginning and 140.5MB in the end (delta: 39.8MB). Free memory was 69.4MB in the beginning and 86.6MB in the end (delta: -17.2MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2022-02-21 03:04:02,819 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 100.7MB. Free memory is still 56.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:04:02,819 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.52ms. Allocated memory was 100.7MB in the beginning and 140.5MB in the end (delta: 39.8MB). Free memory was 69.4MB in the beginning and 116.8MB in the end (delta: -47.4MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2022-02-21 03:04:02,819 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.52ms. Allocated memory is still 140.5MB. Free memory was 116.8MB in the beginning and 115.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:04:02,819 INFO L158 Benchmark]: Boogie Preprocessor took 12.92ms. Allocated memory is still 140.5MB. Free memory was 115.4MB in the beginning and 114.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:04:02,820 INFO L158 Benchmark]: RCFGBuilder took 205.28ms. Allocated memory is still 140.5MB. Free memory was 114.2MB in the beginning and 104.9MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:04:02,820 INFO L158 Benchmark]: TraceAbstraction took 830.52ms. Allocated memory is still 140.5MB. Free memory was 104.2MB in the beginning and 89.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. [2022-02-21 03:04:02,820 INFO L158 Benchmark]: Witness Printer took 38.89ms. Allocated memory is still 140.5MB. Free memory was 88.8MB in the beginning and 86.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:04:02,822 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 100.7MB. Free memory is still 56.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 183.52ms. Allocated memory was 100.7MB in the beginning and 140.5MB in the end (delta: 39.8MB). Free memory was 69.4MB in the beginning and 116.8MB in the end (delta: -47.4MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.52ms. Allocated memory is still 140.5MB. Free memory was 116.8MB in the beginning and 115.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 12.92ms. Allocated memory is still 140.5MB. Free memory was 115.4MB in the beginning and 114.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 205.28ms. Allocated memory is still 140.5MB. Free memory was 114.2MB in the beginning and 104.9MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 830.52ms. Allocated memory is still 140.5MB. Free memory was 104.2MB in the beginning and 89.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. * Witness Printer took 38.89ms. Allocated memory is still 140.5MB. Free memory was 88.8MB in the beginning and 86.6MB in the end (delta: 2.2MB). 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: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: 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, 29 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 38 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23 IncrementalHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 31 mSDtfsCounter, 23 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, InterpolantAutomatonStates: 13, 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, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 6 NumberOfFragments, 23 HoareAnnotationTreeSize, 3 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 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, 40 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: 19]: Loop Invariant Derived loop invariant: ((1 <= i && i <= 2147483647) && j <= 2147483647) && N <= 2147483647 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: i <= 2147483647 && N <= 2147483647 - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: i <= 2147483647 RESULT: Ultimate proved your program to be correct! [2022-02-21 03:04:02,860 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