./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2.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/Urban-WST2013-Fig2.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 9c55a9a6f50b70c8ad02d8f9cdba1133727e3a9a73c5b8d3940178ed4735e2c1 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:05:57,039 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:05:57,040 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:05:57,061 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:05:57,062 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:05:57,063 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:05:57,064 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:05:57,065 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:05:57,066 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:05:57,066 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:05:57,067 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:05:57,068 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:05:57,069 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:05:57,069 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:05:57,072 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:05:57,074 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:05:57,074 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:05:57,075 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:05:57,080 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:05:57,081 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:05:57,082 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:05:57,085 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:05:57,086 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:05:57,086 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:05:57,088 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:05:57,090 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:05:57,090 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:05:57,091 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:05:57,092 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:05:57,093 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:05:57,093 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:05:57,094 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:05:57,096 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:05:57,096 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:05:57,097 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:05:57,097 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:05:57,098 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:05:57,099 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:05:57,099 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:05:57,099 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:05:57,100 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:05:57,101 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-02-21 03:05:57,128 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:05:57,128 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:05:57,128 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:05:57,129 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:05:57,129 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:05:57,129 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:05:57,130 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:05:57,130 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:05:57,130 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:05:57,130 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:05:57,131 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:05:57,131 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:05:57,131 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:05:57,131 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:05:57,131 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:05:57,132 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:05:57,132 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:05:57,132 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:05:57,132 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:05:57,132 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:05:57,132 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:05:57,132 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:05:57,133 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:05:57,133 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:05:57,133 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:05:57,133 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:05:57,133 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:05:57,134 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:05:57,134 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:05:57,134 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:05:57,135 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 -> 9c55a9a6f50b70c8ad02d8f9cdba1133727e3a9a73c5b8d3940178ed4735e2c1 [2022-02-21 03:05:57,342 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:05:57,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:05:57,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:05:57,363 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:05:57,364 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:05:57,365 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2.c [2022-02-21 03:05:57,405 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb6dd8f1e/c37b926847264ba6a41359dba563e2ff/FLAGcc40eb6cf [2022-02-21 03:05:57,775 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:05:57,776 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2.c [2022-02-21 03:05:57,781 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb6dd8f1e/c37b926847264ba6a41359dba563e2ff/FLAGcc40eb6cf [2022-02-21 03:05:57,790 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb6dd8f1e/c37b926847264ba6a41359dba563e2ff [2022-02-21 03:05:57,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:05:57,793 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:05:57,795 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:05:57,795 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:05:57,797 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:05:57,800 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:05:57" (1/1) ... [2022-02-21 03:05:57,801 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@173407bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:57, skipping insertion in model container [2022-02-21 03:05:57,801 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:05:57" (1/1) ... [2022-02-21 03:05:57,806 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:05:57,813 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:05:57,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:05:57,926 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:05:57,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:05:57,944 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:05:57,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:57 WrapperNode [2022-02-21 03:05:57,945 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:05:57,946 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:05:57,946 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:05:57,947 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:05:57,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:57" (1/1) ... [2022-02-21 03:05:57,956 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:57" (1/1) ... [2022-02-21 03:05:57,978 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 27 [2022-02-21 03:05:57,979 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:05:57,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:05:57,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:05:57,980 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:05:57,985 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:57" (1/1) ... [2022-02-21 03:05:57,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:57" (1/1) ... [2022-02-21 03:05:57,986 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:57" (1/1) ... [2022-02-21 03:05:57,986 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:57" (1/1) ... [2022-02-21 03:05:57,989 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:57" (1/1) ... [2022-02-21 03:05:57,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:57" (1/1) ... [2022-02-21 03:05:57,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:57" (1/1) ... [2022-02-21 03:05:57,996 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:05:57,997 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:05:57,997 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:05:57,997 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:05:57,998 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:57" (1/1) ... [2022-02-21 03:05:58,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:05:58,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:05:58,026 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-21 03:05:58,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-21 03:05:58,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:05:58,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:05:58,099 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:05:58,100 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:05:58,209 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:05:58,214 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:05:58,214 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:05:58,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:05:58 BoogieIcfgContainer [2022-02-21 03:05:58,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:05:58,223 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:05:58,224 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:05:58,226 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:05:58,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:05:57" (1/3) ... [2022-02-21 03:05:58,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c812f00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:05:58, skipping insertion in model container [2022-02-21 03:05:58,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:57" (2/3) ... [2022-02-21 03:05:58,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c812f00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:05:58, skipping insertion in model container [2022-02-21 03:05:58,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:05:58" (3/3) ... [2022-02-21 03:05:58,228 INFO L111 eAbstractionObserver]: Analyzing ICFG Urban-WST2013-Fig2.c [2022-02-21 03:05:58,232 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:05:58,237 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-02-21 03:05:58,292 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:05:58,296 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-21 03:05:58,303 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-21 03:05:58,313 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:05:58,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-21 03:05:58,317 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:58,317 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-21 03:05:58,318 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:05:58,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:58,322 INFO L85 PathProgramCache]: Analyzing trace with hash 28699890, now seen corresponding path program 1 times [2022-02-21 03:05:58,330 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:58,331 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014930801] [2022-02-21 03:05:58,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:58,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:58,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:58,464 INFO L290 TraceCheckUtils]: 0: Hoare triple {19#true} assume { :begin_inline_ULTIMATE.init } true; {19#true} is VALID [2022-02-21 03:05:58,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {19#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {19#true} is VALID [2022-02-21 03:05:58,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {19#true} assume !!(main_~x1~0#1 <= 10);main_~x2~0#1 := 10; {21#(<= 10 |ULTIMATE.start_main_~x2~0#1|)} is VALID [2022-02-21 03:05:58,468 INFO L290 TraceCheckUtils]: 3: Hoare triple {21#(<= 10 |ULTIMATE.start_main_~x2~0#1|)} assume !(main_~x2~0#1 > 1); {20#false} is VALID [2022-02-21 03:05:58,469 INFO L290 TraceCheckUtils]: 4: Hoare triple {20#false} assume !(1 + main_~x1~0#1 <= 2147483647); {20#false} is VALID [2022-02-21 03:05:58,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:05:58,470 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:58,470 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014930801] [2022-02-21 03:05:58,471 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014930801] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:05:58,471 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:05:58,471 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:05:58,474 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274682661] [2022-02-21 03:05:58,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:05:58,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 03:05:58,479 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:58,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:58,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:58,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:05:58,493 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:58,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:05:58,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:05:58,510 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, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:58,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:58,570 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-02-21 03:05:58,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:05:58,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 03:05:58,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:58,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:58,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-02-21 03:05:58,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:58,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-02-21 03:05:58,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 43 transitions. [2022-02-21 03:05:58,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:58,650 INFO L225 Difference]: With dead ends: 33 [2022-02-21 03:05:58,654 INFO L226 Difference]: Without dead ends: 15 [2022-02-21 03:05:58,656 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:05:58,659 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 3 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:05:58,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 22 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:05:58,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-02-21 03:05:58,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-21 03:05:58,685 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:58,685 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:58,686 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:58,686 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:58,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:58,691 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-21 03:05:58,691 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-21 03:05:58,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:58,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:58,699 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 14 states have internal predecessors, (17), 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 15 states. [2022-02-21 03:05:58,699 INFO L87 Difference]: Start difference. First operand has 15 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 14 states have internal predecessors, (17), 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 15 states. [2022-02-21 03:05:58,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:58,702 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-21 03:05:58,702 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-21 03:05:58,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:58,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:58,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:58,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:58,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:58,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-02-21 03:05:58,705 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 5 [2022-02-21 03:05:58,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:58,705 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-02-21 03:05:58,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:58,707 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-21 03:05:58,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-21 03:05:58,707 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:58,707 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-21 03:05:58,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:05:58,708 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:05:58,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:58,710 INFO L85 PathProgramCache]: Analyzing trace with hash 28699945, now seen corresponding path program 1 times [2022-02-21 03:05:58,710 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:58,711 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684802255] [2022-02-21 03:05:58,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:58,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:58,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {112#true} assume { :begin_inline_ULTIMATE.init } true; {112#true} is VALID [2022-02-21 03:05:58,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {112#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {112#true} is VALID [2022-02-21 03:05:58,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {112#true} assume !!(main_~x1~0#1 <= 10);main_~x2~0#1 := 10; {114#(<= |ULTIMATE.start_main_~x2~0#1| 10)} is VALID [2022-02-21 03:05:58,739 INFO L290 TraceCheckUtils]: 3: Hoare triple {114#(<= |ULTIMATE.start_main_~x2~0#1| 10)} assume !!(main_~x2~0#1 > 1); {114#(<= |ULTIMATE.start_main_~x2~0#1| 10)} is VALID [2022-02-21 03:05:58,740 INFO L290 TraceCheckUtils]: 4: Hoare triple {114#(<= |ULTIMATE.start_main_~x2~0#1| 10)} assume !(main_~x2~0#1 - 1 <= 2147483647); {113#false} is VALID [2022-02-21 03:05:58,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:05:58,740 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:58,740 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684802255] [2022-02-21 03:05:58,741 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684802255] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:05:58,741 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:05:58,741 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:05:58,741 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723690186] [2022-02-21 03:05:58,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:05:58,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 03:05:58,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:58,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:58,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:58,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:05:58,752 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:58,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:05:58,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:05:58,756 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:58,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:58,796 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-02-21 03:05:58,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:05:58,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 03:05:58,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:58,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:58,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2022-02-21 03:05:58,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:58,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2022-02-21 03:05:58,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 14 transitions. [2022-02-21 03:05:58,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:58,812 INFO L225 Difference]: With dead ends: 16 [2022-02-21 03:05:58,812 INFO L226 Difference]: Without dead ends: 15 [2022-02-21 03:05:58,813 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:05:58,815 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:05:58,816 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 9 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:05:58,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-02-21 03:05:58,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2022-02-21 03:05:58,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:58,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:58,822 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:58,822 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:58,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:58,823 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-02-21 03:05:58,823 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-02-21 03:05:58,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:58,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:58,824 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states. [2022-02-21 03:05:58,825 INFO L87 Difference]: Start difference. First operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states. [2022-02-21 03:05:58,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:58,826 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-02-21 03:05:58,826 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-02-21 03:05:58,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:58,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:58,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:58,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:58,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:58,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-02-21 03:05:58,828 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 5 [2022-02-21 03:05:58,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:58,828 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-02-21 03:05:58,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:58,829 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-02-21 03:05:58,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-21 03:05:58,829 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:58,829 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:05:58,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:05:58,829 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:05:58,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:58,830 INFO L85 PathProgramCache]: Analyzing trace with hash 301623032, now seen corresponding path program 1 times [2022-02-21 03:05:58,831 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:58,831 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593282383] [2022-02-21 03:05:58,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:58,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:58,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {184#true} assume { :begin_inline_ULTIMATE.init } true; {184#true} is VALID [2022-02-21 03:05:58,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {184#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {184#true} is VALID [2022-02-21 03:05:58,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {184#true} assume !!(main_~x1~0#1 <= 10);main_~x2~0#1 := 10; {186#(<= |ULTIMATE.start_main_~x1~0#1| 10)} is VALID [2022-02-21 03:05:58,885 INFO L290 TraceCheckUtils]: 3: Hoare triple {186#(<= |ULTIMATE.start_main_~x1~0#1| 10)} assume !!(main_~x2~0#1 > 1); {186#(<= |ULTIMATE.start_main_~x1~0#1| 10)} is VALID [2022-02-21 03:05:58,885 INFO L290 TraceCheckUtils]: 4: Hoare triple {186#(<= |ULTIMATE.start_main_~x1~0#1| 10)} assume main_~x2~0#1 - 1 <= 2147483647; {186#(<= |ULTIMATE.start_main_~x1~0#1| 10)} is VALID [2022-02-21 03:05:58,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {186#(<= |ULTIMATE.start_main_~x1~0#1| 10)} assume main_~x2~0#1 - 1 >= -2147483648;main_~x2~0#1 := main_~x2~0#1 - 1; {186#(<= |ULTIMATE.start_main_~x1~0#1| 10)} is VALID [2022-02-21 03:05:58,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {186#(<= |ULTIMATE.start_main_~x1~0#1| 10)} assume !(main_~x2~0#1 > 1); {186#(<= |ULTIMATE.start_main_~x1~0#1| 10)} is VALID [2022-02-21 03:05:58,887 INFO L290 TraceCheckUtils]: 7: Hoare triple {186#(<= |ULTIMATE.start_main_~x1~0#1| 10)} assume !(1 + main_~x1~0#1 <= 2147483647); {185#false} is VALID [2022-02-21 03:05:58,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:05:58,887 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:58,887 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593282383] [2022-02-21 03:05:58,887 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593282383] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:05:58,887 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:05:58,887 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:05:58,887 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303384255] [2022-02-21 03:05:58,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:05:58,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-21 03:05:58,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:58,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:58,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:58,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:05:58,894 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:58,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:05:58,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:05:58,895 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:58,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:58,910 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-02-21 03:05:58,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:05:58,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-21 03:05:58,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:58,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:58,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2022-02-21 03:05:58,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:58,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2022-02-21 03:05:58,911 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 12 transitions. [2022-02-21 03:05:58,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:58,922 INFO L225 Difference]: With dead ends: 14 [2022-02-21 03:05:58,922 INFO L226 Difference]: Without dead ends: 13 [2022-02-21 03:05:58,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:05:58,924 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:05:58,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 9 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:05:58,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-02-21 03:05:58,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-21 03:05:58,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:58,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:58,938 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:58,938 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:58,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:58,939 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-02-21 03:05:58,939 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-02-21 03:05:58,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:58,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:58,940 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states. [2022-02-21 03:05:58,940 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states. [2022-02-21 03:05:58,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:58,942 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-02-21 03:05:58,942 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-02-21 03:05:58,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:58,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:58,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:58,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:58,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:58,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-02-21 03:05:58,946 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 8 [2022-02-21 03:05:58,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:58,946 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-02-21 03:05:58,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:58,947 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-02-21 03:05:58,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-21 03:05:58,948 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:58,948 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:05:58,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:05:58,948 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:05:58,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:58,949 INFO L85 PathProgramCache]: Analyzing trace with hash 760379461, now seen corresponding path program 1 times [2022-02-21 03:05:58,949 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:58,949 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579330088] [2022-02-21 03:05:58,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:58,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:58,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {248#true} assume { :begin_inline_ULTIMATE.init } true; {248#true} is VALID [2022-02-21 03:05:58,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {248#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {250#(<= 0 (+ |ULTIMATE.start_main_~x1~0#1| 2147483648))} is VALID [2022-02-21 03:05:58,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {250#(<= 0 (+ |ULTIMATE.start_main_~x1~0#1| 2147483648))} assume !!(main_~x1~0#1 <= 10);main_~x2~0#1 := 10; {250#(<= 0 (+ |ULTIMATE.start_main_~x1~0#1| 2147483648))} is VALID [2022-02-21 03:05:58,981 INFO L290 TraceCheckUtils]: 3: Hoare triple {250#(<= 0 (+ |ULTIMATE.start_main_~x1~0#1| 2147483648))} assume !!(main_~x2~0#1 > 1); {250#(<= 0 (+ |ULTIMATE.start_main_~x1~0#1| 2147483648))} is VALID [2022-02-21 03:05:58,981 INFO L290 TraceCheckUtils]: 4: Hoare triple {250#(<= 0 (+ |ULTIMATE.start_main_~x1~0#1| 2147483648))} assume main_~x2~0#1 - 1 <= 2147483647; {250#(<= 0 (+ |ULTIMATE.start_main_~x1~0#1| 2147483648))} is VALID [2022-02-21 03:05:58,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {250#(<= 0 (+ |ULTIMATE.start_main_~x1~0#1| 2147483648))} assume main_~x2~0#1 - 1 >= -2147483648;main_~x2~0#1 := main_~x2~0#1 - 1; {250#(<= 0 (+ |ULTIMATE.start_main_~x1~0#1| 2147483648))} is VALID [2022-02-21 03:05:58,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {250#(<= 0 (+ |ULTIMATE.start_main_~x1~0#1| 2147483648))} assume !(main_~x2~0#1 > 1); {250#(<= 0 (+ |ULTIMATE.start_main_~x1~0#1| 2147483648))} is VALID [2022-02-21 03:05:58,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {250#(<= 0 (+ |ULTIMATE.start_main_~x1~0#1| 2147483648))} assume 1 + main_~x1~0#1 <= 2147483647; {250#(<= 0 (+ |ULTIMATE.start_main_~x1~0#1| 2147483648))} is VALID [2022-02-21 03:05:58,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {250#(<= 0 (+ |ULTIMATE.start_main_~x1~0#1| 2147483648))} assume !(1 + main_~x1~0#1 >= -2147483648); {249#false} is VALID [2022-02-21 03:05:58,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:05:58,986 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:58,986 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579330088] [2022-02-21 03:05:58,986 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579330088] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:05:58,986 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:05:58,986 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:05:58,986 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449414295] [2022-02-21 03:05:58,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:05:58,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2022-02-21 03:05:58,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:58,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:58,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:58,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:05:58,995 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:58,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:05:58,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:05:58,996 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:59,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:59,014 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-02-21 03:05:59,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:05:59,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2022-02-21 03:05:59,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:59,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:59,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2022-02-21 03:05:59,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:59,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2022-02-21 03:05:59,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 11 transitions. [2022-02-21 03:05:59,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:59,028 INFO L225 Difference]: With dead ends: 13 [2022-02-21 03:05:59,028 INFO L226 Difference]: Without dead ends: 12 [2022-02-21 03:05:59,028 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:05:59,035 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:05:59,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 8 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:05:59,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-02-21 03:05:59,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-02-21 03:05:59,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:59,047 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:59,048 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:59,048 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:59,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:59,049 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2022-02-21 03:05:59,049 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2022-02-21 03:05:59,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:59,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:59,049 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states. [2022-02-21 03:05:59,050 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states. [2022-02-21 03:05:59,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:59,051 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2022-02-21 03:05:59,051 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2022-02-21 03:05:59,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:59,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:59,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:59,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:59,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:59,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2022-02-21 03:05:59,056 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 9 [2022-02-21 03:05:59,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:59,056 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2022-02-21 03:05:59,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:59,057 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2022-02-21 03:05:59,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-21 03:05:59,057 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:59,057 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2022-02-21 03:05:59,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 03:05:59,057 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:05:59,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:59,058 INFO L85 PathProgramCache]: Analyzing trace with hash 760381159, now seen corresponding path program 1 times [2022-02-21 03:05:59,058 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:59,058 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205589810] [2022-02-21 03:05:59,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:59,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:59,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:59,081 INFO L290 TraceCheckUtils]: 0: Hoare triple {308#true} assume { :begin_inline_ULTIMATE.init } true; {308#true} is VALID [2022-02-21 03:05:59,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {308#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {308#true} is VALID [2022-02-21 03:05:59,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {308#true} assume !!(main_~x1~0#1 <= 10);main_~x2~0#1 := 10; {308#true} is VALID [2022-02-21 03:05:59,082 INFO L290 TraceCheckUtils]: 3: Hoare triple {308#true} assume !!(main_~x2~0#1 > 1); {308#true} is VALID [2022-02-21 03:05:59,082 INFO L290 TraceCheckUtils]: 4: Hoare triple {308#true} assume main_~x2~0#1 - 1 <= 2147483647; {308#true} is VALID [2022-02-21 03:05:59,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {308#true} assume main_~x2~0#1 - 1 >= -2147483648;main_~x2~0#1 := main_~x2~0#1 - 1; {308#true} is VALID [2022-02-21 03:05:59,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {308#true} assume !!(main_~x2~0#1 > 1); {310#(<= 2 |ULTIMATE.start_main_~x2~0#1|)} is VALID [2022-02-21 03:05:59,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {310#(<= 2 |ULTIMATE.start_main_~x2~0#1|)} assume main_~x2~0#1 - 1 <= 2147483647; {310#(<= 2 |ULTIMATE.start_main_~x2~0#1|)} is VALID [2022-02-21 03:05:59,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {310#(<= 2 |ULTIMATE.start_main_~x2~0#1|)} assume !(main_~x2~0#1 - 1 >= -2147483648); {309#false} is VALID [2022-02-21 03:05:59,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:05:59,084 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:59,085 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205589810] [2022-02-21 03:05:59,085 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205589810] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:05:59,085 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:05:59,085 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:05:59,085 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975120438] [2022-02-21 03:05:59,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:05:59,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2022-02-21 03:05:59,086 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:59,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:59,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:59,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:05:59,103 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:59,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:05:59,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:05:59,103 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:59,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:59,151 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2022-02-21 03:05:59,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:05:59,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2022-02-21 03:05:59,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:59,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:59,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2022-02-21 03:05:59,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:59,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2022-02-21 03:05:59,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 11 transitions. [2022-02-21 03:05:59,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:59,160 INFO L225 Difference]: With dead ends: 12 [2022-02-21 03:05:59,160 INFO L226 Difference]: Without dead ends: 0 [2022-02-21 03:05:59,160 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:05:59,161 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:05:59,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:05:59,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-21 03:05:59,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-21 03:05:59,161 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:59,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:59,162 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:59,162 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:59,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:59,162 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:05:59,162 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:05:59,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:59,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:59,162 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-21 03:05:59,162 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-21 03:05:59,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:59,162 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:05:59,162 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:05:59,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:59,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:59,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:59,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:59,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:59,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 03:05:59,163 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2022-02-21 03:05:59,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:59,163 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:05:59,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:05:59,163 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:05:59,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:59,165 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-02-21 03:05:59,165 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-02-21 03:05:59,165 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-02-21 03:05:59,165 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-02-21 03:05:59,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-21 03:05:59,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-21 03:05:59,208 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2022-02-21 03:05:59,208 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-21 03:05:59,208 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2022-02-21 03:05:59,208 INFO L854 garLoopResultBuilder]: At program point L21-2(lines 21 23) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~x1~0#1| 10) (<= |ULTIMATE.start_main_~x2~0#1| 10) (<= 0 (+ |ULTIMATE.start_main_~x1~0#1| 2147483648))) [2022-02-21 03:05:59,208 INFO L858 garLoopResultBuilder]: For program point L21-3(lines 21 23) no Hoare annotation was computed. [2022-02-21 03:05:59,208 INFO L854 garLoopResultBuilder]: At program point L19-2(lines 19 25) the Hoare annotation is: (<= 0 (+ |ULTIMATE.start_main_~x1~0#1| 2147483648)) [2022-02-21 03:05:59,208 INFO L858 garLoopResultBuilder]: For program point L19-3(lines 19 25) no Hoare annotation was computed. [2022-02-21 03:05:59,208 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-21 03:05:59,208 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2022-02-21 03:05:59,209 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2022-02-21 03:05:59,209 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-21 03:05:59,209 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-21 03:05:59,209 INFO L861 garLoopResultBuilder]: At program point L26(lines 14 27) the Hoare annotation is: true [2022-02-21 03:05:59,209 INFO L858 garLoopResultBuilder]: For program point L24(line 24) no Hoare annotation was computed. [2022-02-21 03:05:59,209 INFO L858 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2022-02-21 03:05:59,209 INFO L858 garLoopResultBuilder]: For program point L22-1(line 22) no Hoare annotation was computed. [2022-02-21 03:05:59,211 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-21 03:05:59,212 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 03:05:59,214 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-21 03:05:59,214 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-21 03:05:59,219 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2022-02-21 03:05:59,219 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2022-02-21 03:05:59,220 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2022-02-21 03:05:59,220 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2022-02-21 03:05:59,221 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2022-02-21 03:05:59,221 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-21 03:05:59,221 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-21 03:05:59,221 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2022-02-21 03:05:59,221 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2022-02-21 03:05:59,221 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-21 03:05:59,221 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-21 03:05:59,221 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-21 03:05:59,221 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-21 03:05:59,221 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-21 03:05:59,221 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-21 03:05:59,222 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-21 03:05:59,222 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:05:59,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 03:05:59 BoogieIcfgContainer [2022-02-21 03:05:59,228 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-21 03:05:59,228 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:05:59,228 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:05:59,228 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:05:59,229 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:05:58" (3/4) ... [2022-02-21 03:05:59,230 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-21 03:05:59,236 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-21 03:05:59,236 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-02-21 03:05:59,236 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-21 03:05:59,255 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 03:05:59,255 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:05:59,256 INFO L158 Benchmark]: Toolchain (without parser) took 1462.64ms. Allocated memory is still 96.5MB. Free memory was 62.0MB in the beginning and 69.9MB in the end (delta: -7.9MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:05:59,256 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 96.5MB. Free memory is still 78.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:05:59,256 INFO L158 Benchmark]: CACSL2BoogieTranslator took 150.72ms. Allocated memory is still 96.5MB. Free memory was 61.8MB in the beginning and 75.3MB in the end (delta: -13.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:05:59,257 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.53ms. Allocated memory is still 96.5MB. Free memory was 75.3MB in the beginning and 73.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:05:59,257 INFO L158 Benchmark]: Boogie Preprocessor took 16.49ms. Allocated memory is still 96.5MB. Free memory was 73.8MB in the beginning and 72.9MB in the end (delta: 887.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:05:59,257 INFO L158 Benchmark]: RCFGBuilder took 225.59ms. Allocated memory is still 96.5MB. Free memory was 72.9MB in the beginning and 63.0MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 03:05:59,257 INFO L158 Benchmark]: TraceAbstraction took 1004.16ms. Allocated memory is still 96.5MB. Free memory was 62.4MB in the beginning and 72.0MB in the end (delta: -9.6MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. [2022-02-21 03:05:59,258 INFO L158 Benchmark]: Witness Printer took 27.10ms. Allocated memory is still 96.5MB. Free memory was 72.0MB in the beginning and 69.9MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 03:05:59,259 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 96.5MB. Free memory is still 78.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 150.72ms. Allocated memory is still 96.5MB. Free memory was 61.8MB in the beginning and 75.3MB in the end (delta: -13.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.53ms. Allocated memory is still 96.5MB. Free memory was 75.3MB in the beginning and 73.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.49ms. Allocated memory is still 96.5MB. Free memory was 73.8MB in the beginning and 72.9MB in the end (delta: 887.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 225.59ms. Allocated memory is still 96.5MB. Free memory was 72.9MB in the beginning and 63.0MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1004.16ms. Allocated memory is still 96.5MB. Free memory was 62.4MB in the beginning and 72.0MB in the end (delta: -9.6MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. * Witness Printer took 27.10ms. Allocated memory is still 96.5MB. Free memory was 72.0MB in the beginning and 69.9MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 57 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30 IncrementalHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 42 mSDtfsCounter, 30 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, InterpolantAutomatonStates: 15, 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, 5 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 7 NumberOfFragments, 18 HoareAnnotationTreeSize, 3 FomulaSimplifications, 3 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 16 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 31 ConstructedInterpolants, 0 QuantifiedInterpolants, 79 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 5/5 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: 0 <= x1 + 2147483648 - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (x1 <= 10 && x2 <= 10) && 0 <= x1 + 2147483648 - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-02-21 03:05:59,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE