./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi3.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi3.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 59f8de3095dec84b471ea17a2f8054509a628ca6c3fce9f023768548ca2b0891 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:03:54,634 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:03:54,635 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:03:54,654 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:03:54,655 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:03:54,655 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:03:54,656 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:03:54,658 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:03:54,659 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:03:54,659 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:03:54,660 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:03:54,662 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:03:54,662 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:03:54,666 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:03:54,667 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:03:54,668 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:03:54,668 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:03:54,669 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:03:54,670 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:03:54,671 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:03:54,672 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:03:54,672 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:03:54,673 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:03:54,674 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:03:54,675 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:03:54,675 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:03:54,676 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:03:54,676 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:03:54,676 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:03:54,677 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:03:54,677 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:03:54,678 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:03:54,678 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:03:54,679 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:03:54,679 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:03:54,680 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:03:54,680 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:03:54,680 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:03:54,680 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:03:54,681 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:03:54,681 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:03:54,682 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-02-21 03:03:54,695 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:03:54,695 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:03:54,696 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:03:54,696 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:03:54,696 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:03:54,696 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:03:54,697 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:03:54,697 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:03:54,697 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:03:54,697 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:03:54,697 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:03:54,698 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:03:54,698 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:03:54,698 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:03:54,698 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:03:54,698 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:03:54,698 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:03:54,699 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:03:54,699 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:03:54,699 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:03:54,699 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:03:54,699 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:03:54,699 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:03:54,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:03:54,700 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:03:54,700 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:03:54,700 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:03:54,700 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:03:54,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:03:54,700 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:03:54,701 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 -> 59f8de3095dec84b471ea17a2f8054509a628ca6c3fce9f023768548ca2b0891 [2022-02-21 03:03:54,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:03:54,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:03:54,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:03:54,923 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:03:54,923 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:03:54,924 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi3.c [2022-02-21 03:03:54,981 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64378616c/6344ab81b49e45248ac711c7ac93cdee/FLAGd5e128aff [2022-02-21 03:03:55,314 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:03:55,314 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi3.c [2022-02-21 03:03:55,318 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64378616c/6344ab81b49e45248ac711c7ac93cdee/FLAGd5e128aff [2022-02-21 03:03:55,760 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64378616c/6344ab81b49e45248ac711c7ac93cdee [2022-02-21 03:03:55,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:03:55,763 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:03:55,776 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:03:55,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:03:55,778 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:03:55,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:03:55" (1/1) ... [2022-02-21 03:03:55,780 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71682463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:55, skipping insertion in model container [2022-02-21 03:03:55,780 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:03:55" (1/1) ... [2022-02-21 03:03:55,784 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:03:55,806 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:03:55,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:03:55,979 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:03:55,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:03:56,008 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:03:56,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:56 WrapperNode [2022-02-21 03:03:56,009 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:03:56,010 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:03:56,010 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:03:56,010 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:03:56,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:56" (1/1) ... [2022-02-21 03:03:56,019 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:56" (1/1) ... [2022-02-21 03:03:56,032 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 29 [2022-02-21 03:03:56,033 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:03:56,040 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:03:56,040 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:03:56,040 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:03:56,050 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:56" (1/1) ... [2022-02-21 03:03:56,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:56" (1/1) ... [2022-02-21 03:03:56,052 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:56" (1/1) ... [2022-02-21 03:03:56,052 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:56" (1/1) ... [2022-02-21 03:03:56,055 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:56" (1/1) ... [2022-02-21 03:03:56,060 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:56" (1/1) ... [2022-02-21 03:03:56,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:56" (1/1) ... [2022-02-21 03:03:56,064 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:03:56,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:03:56,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:03:56,066 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:03:56,066 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:56" (1/1) ... [2022-02-21 03:03:56,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:03:56,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:56,117 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-21 03:03:56,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-21 03:03:56,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:03:56,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:03:56,238 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:03:56,239 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:03:56,343 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:03:56,348 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:03:56,348 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:03:56,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:03:56 BoogieIcfgContainer [2022-02-21 03:03:56,349 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:03:56,351 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:03:56,351 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:03:56,353 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:03:56,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:03:55" (1/3) ... [2022-02-21 03:03:56,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@438c67f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:03:56, skipping insertion in model container [2022-02-21 03:03:56,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:56" (2/3) ... [2022-02-21 03:03:56,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@438c67f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:03:56, skipping insertion in model container [2022-02-21 03:03:56,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:03:56" (3/3) ... [2022-02-21 03:03:56,356 INFO L111 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-speedpldi3.c [2022-02-21 03:03:56,375 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:03:56,375 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-02-21 03:03:56,433 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:03:56,438 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-21 03:03:56,439 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-21 03:03:56,465 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:56,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 03:03:56,469 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:56,469 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:03:56,470 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:03:56,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:56,487 INFO L85 PathProgramCache]: Analyzing trace with hash 889513677, now seen corresponding path program 1 times [2022-02-21 03:03:56,494 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:56,494 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669595296] [2022-02-21 03:03:56,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:56,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:56,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:56,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {20#true} assume { :begin_inline_ULTIMATE.init } true; {20#true} is VALID [2022-02-21 03:03:56,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {20#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~m~0#1;havoc main_~n~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {20#true} is VALID [2022-02-21 03:03:56,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {20#true} assume main_~m~0#1 > 0 && main_~n~0#1 > main_~m~0#1;main_~i~0#1 := 0;main_~j~0#1 := 0; {22#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:03:56,683 INFO L290 TraceCheckUtils]: 3: Hoare triple {22#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume !!(main_~i~0#1 < main_~n~0#1); {22#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:03:56,683 INFO L290 TraceCheckUtils]: 4: Hoare triple {22#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume main_~j~0#1 < main_~m~0#1; {22#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:03:56,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume !(1 + main_~j~0#1 <= 2147483647); {21#false} is VALID [2022-02-21 03:03:56,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:03:56,686 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:56,687 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669595296] [2022-02-21 03:03:56,688 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669595296] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:56,688 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:56,689 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:03:56,690 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207898793] [2022-02-21 03:03:56,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:56,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-21 03:03:56,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:56,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:56,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:56,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:03:56,710 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:56,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:03:56,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:03:56,731 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:56,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:56,808 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-02-21 03:03:56,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:03:56,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-21 03:03:56,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:56,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:56,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-02-21 03:03:56,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:56,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-02-21 03:03:56,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 35 transitions. [2022-02-21 03:03:56,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:56,866 INFO L225 Difference]: With dead ends: 30 [2022-02-21 03:03:56,866 INFO L226 Difference]: Without dead ends: 17 [2022-02-21 03:03:56,869 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:03:56,874 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:56,884 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 24 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:56,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-02-21 03:03:56,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-02-21 03:03:56,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:56,908 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 16 states, 12 states have (on average 1.5) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:56,908 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 16 states, 12 states have (on average 1.5) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:56,909 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 16 states, 12 states have (on average 1.5) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:56,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:56,913 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-02-21 03:03:56,913 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-21 03:03:56,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:56,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:56,914 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 12 states have (on average 1.5) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 17 states. [2022-02-21 03:03:56,915 INFO L87 Difference]: Start difference. First operand has 16 states, 12 states have (on average 1.5) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 17 states. [2022-02-21 03:03:56,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:56,916 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-02-21 03:03:56,916 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-21 03:03:56,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:56,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:56,916 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:56,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:56,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.5) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:56,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-02-21 03:03:56,919 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 6 [2022-02-21 03:03:56,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:56,919 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-02-21 03:03:56,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:56,920 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-02-21 03:03:56,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 03:03:56,920 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:56,920 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:03:56,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:03:56,921 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:03:56,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:56,922 INFO L85 PathProgramCache]: Analyzing trace with hash 889513869, now seen corresponding path program 1 times [2022-02-21 03:03:56,922 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:56,922 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462753778] [2022-02-21 03:03:56,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:56,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:56,948 INFO L290 TraceCheckUtils]: 0: Hoare triple {112#true} assume { :begin_inline_ULTIMATE.init } true; {112#true} is VALID [2022-02-21 03:03:56,948 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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~m~0#1;havoc main_~n~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {112#true} is VALID [2022-02-21 03:03:56,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {112#true} assume main_~m~0#1 > 0 && main_~n~0#1 > main_~m~0#1;main_~i~0#1 := 0;main_~j~0#1 := 0; {114#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-21 03:03:56,949 INFO L290 TraceCheckUtils]: 3: Hoare triple {114#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1); {114#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-21 03:03:56,950 INFO L290 TraceCheckUtils]: 4: Hoare triple {114#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 0; {113#false} is VALID [2022-02-21 03:03:56,950 INFO L290 TraceCheckUtils]: 5: Hoare triple {113#false} assume !(1 + main_~i~0#1 <= 2147483647); {113#false} is VALID [2022-02-21 03:03:56,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:03:56,951 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:56,951 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462753778] [2022-02-21 03:03:56,951 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462753778] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:56,951 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:56,951 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:03:56,952 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270445959] [2022-02-21 03:03:56,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:56,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-21 03:03:56,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:56,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:56,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:56,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:03:56,959 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:56,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:03:56,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:03:56,960 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:56,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:56,983 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-02-21 03:03:56,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:03:56,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-21 03:03:56,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:56,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:56,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-02-21 03:03:56,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:56,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-02-21 03:03:56,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 28 transitions. [2022-02-21 03:03:57,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:57,007 INFO L225 Difference]: With dead ends: 31 [2022-02-21 03:03:57,007 INFO L226 Difference]: Without dead ends: 18 [2022-02-21 03:03:57,008 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:03:57,009 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 4 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:57,009 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 15 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:57,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-21 03:03:57,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-21 03:03:57,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:57,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:57,014 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:57,015 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:57,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:57,031 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-02-21 03:03:57,031 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-02-21 03:03:57,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:57,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:57,032 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states. [2022-02-21 03:03:57,032 INFO L87 Difference]: Start difference. First operand has 18 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 18 states. [2022-02-21 03:03:57,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:57,033 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-02-21 03:03:57,034 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-02-21 03:03:57,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:57,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:57,034 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:57,034 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:57,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:57,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-02-21 03:03:57,036 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 6 [2022-02-21 03:03:57,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:57,036 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-02-21 03:03:57,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:57,036 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-02-21 03:03:57,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-21 03:03:57,037 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:57,037 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:57,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:03:57,037 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:03:57,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:57,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1805120262, now seen corresponding path program 1 times [2022-02-21 03:03:57,038 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:57,038 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102065669] [2022-02-21 03:03:57,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:57,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:57,063 INFO L290 TraceCheckUtils]: 0: Hoare triple {210#true} assume { :begin_inline_ULTIMATE.init } true; {210#true} is VALID [2022-02-21 03:03:57,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {210#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~m~0#1;havoc main_~n~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {210#true} is VALID [2022-02-21 03:03:57,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {210#true} assume main_~m~0#1 > 0 && main_~n~0#1 > main_~m~0#1;main_~i~0#1 := 0;main_~j~0#1 := 0; {212#(<= 0 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:03:57,065 INFO L290 TraceCheckUtils]: 3: Hoare triple {212#(<= 0 |ULTIMATE.start_main_~j~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1); {212#(<= 0 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:03:57,065 INFO L290 TraceCheckUtils]: 4: Hoare triple {212#(<= 0 |ULTIMATE.start_main_~j~0#1|)} assume main_~j~0#1 < main_~m~0#1; {212#(<= 0 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:03:57,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {212#(<= 0 |ULTIMATE.start_main_~j~0#1|)} assume 1 + main_~j~0#1 <= 2147483647; {212#(<= 0 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:03:57,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {212#(<= 0 |ULTIMATE.start_main_~j~0#1|)} assume !(1 + main_~j~0#1 >= -2147483648); {211#false} is VALID [2022-02-21 03:03:57,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:03:57,067 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:57,068 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102065669] [2022-02-21 03:03:57,068 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102065669] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:57,069 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:57,069 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:03:57,069 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031490715] [2022-02-21 03:03:57,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:57,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-02-21 03:03:57,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:57,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:57,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:57,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:03:57,077 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:57,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:03:57,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:03:57,078 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:57,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:57,102 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-02-21 03:03:57,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:03:57,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-02-21 03:03:57,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:57,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:57,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2022-02-21 03:03:57,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:57,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2022-02-21 03:03:57,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 14 transitions. [2022-02-21 03:03:57,115 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:03:57,116 INFO L225 Difference]: With dead ends: 18 [2022-02-21 03:03:57,116 INFO L226 Difference]: Without dead ends: 17 [2022-02-21 03:03:57,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:03:57,117 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 5 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:57,118 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 9 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:57,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-02-21 03:03:57,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-02-21 03:03:57,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:57,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 16 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:03:57,124 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 16 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:03:57,125 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 16 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:03:57,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:57,126 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-02-21 03:03:57,126 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-02-21 03:03:57,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:57,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:57,126 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 16 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 17 states. [2022-02-21 03:03:57,127 INFO L87 Difference]: Start difference. First operand has 17 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 16 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 17 states. [2022-02-21 03:03:57,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:57,128 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-02-21 03:03:57,128 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-02-21 03:03:57,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:57,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:57,128 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:57,128 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:57,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 16 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:03:57,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-02-21 03:03:57,129 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 7 [2022-02-21 03:03:57,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:57,130 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-02-21 03:03:57,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:57,130 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-02-21 03:03:57,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-21 03:03:57,131 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:57,131 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:57,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:03:57,131 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:03:57,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:57,132 INFO L85 PathProgramCache]: Analyzing trace with hash -947744184, now seen corresponding path program 1 times [2022-02-21 03:03:57,132 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:57,132 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174324955] [2022-02-21 03:03:57,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:57,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:57,163 INFO L290 TraceCheckUtils]: 0: Hoare triple {290#true} assume { :begin_inline_ULTIMATE.init } true; {290#true} is VALID [2022-02-21 03:03:57,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {290#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~m~0#1;havoc main_~n~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {290#true} is VALID [2022-02-21 03:03:57,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {290#true} assume main_~m~0#1 > 0 && main_~n~0#1 > main_~m~0#1;main_~i~0#1 := 0;main_~j~0#1 := 0; {292#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:03:57,165 INFO L290 TraceCheckUtils]: 3: Hoare triple {292#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume !!(main_~i~0#1 < main_~n~0#1); {292#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:03:57,165 INFO L290 TraceCheckUtils]: 4: Hoare triple {292#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume main_~j~0#1 < main_~m~0#1; {292#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:03:57,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {292#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume 1 + main_~j~0#1 <= 2147483647; {292#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:03:57,166 INFO L290 TraceCheckUtils]: 6: Hoare triple {292#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {293#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-21 03:03:57,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {293#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume !!(main_~i~0#1 < main_~n~0#1); {293#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-21 03:03:57,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {293#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume main_~j~0#1 < main_~m~0#1; {293#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-21 03:03:57,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {293#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume !(1 + main_~j~0#1 <= 2147483647); {291#false} is VALID [2022-02-21 03:03:57,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:03:57,168 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:57,168 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174324955] [2022-02-21 03:03:57,169 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174324955] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:03:57,169 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528963155] [2022-02-21 03:03:57,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:57,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:57,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:57,192 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:03:57,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-21 03:03:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:57,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:03:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:57,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:03:57,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {290#true} assume { :begin_inline_ULTIMATE.init } true; {290#true} is VALID [2022-02-21 03:03:57,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {290#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~m~0#1;havoc main_~n~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {290#true} is VALID [2022-02-21 03:03:57,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {290#true} assume main_~m~0#1 > 0 && main_~n~0#1 > main_~m~0#1;main_~i~0#1 := 0;main_~j~0#1 := 0; {292#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:03:57,317 INFO L290 TraceCheckUtils]: 3: Hoare triple {292#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume !!(main_~i~0#1 < main_~n~0#1); {292#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:03:57,317 INFO L290 TraceCheckUtils]: 4: Hoare triple {292#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume main_~j~0#1 < main_~m~0#1; {292#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:03:57,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {292#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume 1 + main_~j~0#1 <= 2147483647; {292#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:03:57,318 INFO L290 TraceCheckUtils]: 6: Hoare triple {292#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {293#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-21 03:03:57,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {293#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume !!(main_~i~0#1 < main_~n~0#1); {293#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-21 03:03:57,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {293#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume main_~j~0#1 < main_~m~0#1; {293#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-21 03:03:57,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {293#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume !(1 + main_~j~0#1 <= 2147483647); {291#false} is VALID [2022-02-21 03:03:57,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:03:57,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:03:57,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {324#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} assume !(1 + main_~j~0#1 <= 2147483647); {291#false} is VALID [2022-02-21 03:03:57,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {324#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} assume main_~j~0#1 < main_~m~0#1; {324#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} is VALID [2022-02-21 03:03:57,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {324#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} assume !!(main_~i~0#1 < main_~n~0#1); {324#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} is VALID [2022-02-21 03:03:57,375 INFO L290 TraceCheckUtils]: 6: Hoare triple {334#(<= |ULTIMATE.start_main_~j~0#1| 2147483645)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {324#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} is VALID [2022-02-21 03:03:57,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {334#(<= |ULTIMATE.start_main_~j~0#1| 2147483645)} assume 1 + main_~j~0#1 <= 2147483647; {334#(<= |ULTIMATE.start_main_~j~0#1| 2147483645)} is VALID [2022-02-21 03:03:57,376 INFO L290 TraceCheckUtils]: 4: Hoare triple {334#(<= |ULTIMATE.start_main_~j~0#1| 2147483645)} assume main_~j~0#1 < main_~m~0#1; {334#(<= |ULTIMATE.start_main_~j~0#1| 2147483645)} is VALID [2022-02-21 03:03:57,376 INFO L290 TraceCheckUtils]: 3: Hoare triple {334#(<= |ULTIMATE.start_main_~j~0#1| 2147483645)} assume !!(main_~i~0#1 < main_~n~0#1); {334#(<= |ULTIMATE.start_main_~j~0#1| 2147483645)} is VALID [2022-02-21 03:03:57,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {290#true} assume main_~m~0#1 > 0 && main_~n~0#1 > main_~m~0#1;main_~i~0#1 := 0;main_~j~0#1 := 0; {334#(<= |ULTIMATE.start_main_~j~0#1| 2147483645)} is VALID [2022-02-21 03:03:57,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {290#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~m~0#1;havoc main_~n~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {290#true} is VALID [2022-02-21 03:03:57,377 INFO L290 TraceCheckUtils]: 0: Hoare triple {290#true} assume { :begin_inline_ULTIMATE.init } true; {290#true} is VALID [2022-02-21 03:03:57,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:03:57,378 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528963155] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:03:57,378 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:03:57,378 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-02-21 03:03:57,378 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672898820] [2022-02-21 03:03:57,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:03:57,379 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-21 03:03:57,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:57,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:57,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:57,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:03:57,392 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:57,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:03:57,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:03:57,393 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:57,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:57,453 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-02-21 03:03:57,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:03:57,453 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-21 03:03:57,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:57,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:57,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-02-21 03:03:57,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:57,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-02-21 03:03:57,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2022-02-21 03:03:57,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:57,480 INFO L225 Difference]: With dead ends: 30 [2022-02-21 03:03:57,480 INFO L226 Difference]: Without dead ends: 29 [2022-02-21 03:03:57,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:03:57,481 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 18 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:57,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 14 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:57,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-21 03:03:57,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-02-21 03:03:57,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:57,491 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:57,491 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:57,491 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:57,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:57,492 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-02-21 03:03:57,492 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-02-21 03:03:57,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:57,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:57,493 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 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 29 states. [2022-02-21 03:03:57,493 INFO L87 Difference]: Start difference. First operand has 29 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 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 29 states. [2022-02-21 03:03:57,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:57,494 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-02-21 03:03:57,494 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-02-21 03:03:57,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:57,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:57,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:57,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:57,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:57,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-02-21 03:03:57,496 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 10 [2022-02-21 03:03:57,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:57,496 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-02-21 03:03:57,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:57,497 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-02-21 03:03:57,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-21 03:03:57,497 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:57,497 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:57,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:03:57,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:57,715 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:03:57,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:57,716 INFO L85 PathProgramCache]: Analyzing trace with hash -947743992, now seen corresponding path program 1 times [2022-02-21 03:03:57,716 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:57,716 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879895027] [2022-02-21 03:03:57,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:57,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:57,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {481#true} assume { :begin_inline_ULTIMATE.init } true; {481#true} is VALID [2022-02-21 03:03:57,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {481#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~m~0#1;havoc main_~n~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {481#true} is VALID [2022-02-21 03:03:57,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {481#true} assume main_~m~0#1 > 0 && main_~n~0#1 > main_~m~0#1;main_~i~0#1 := 0;main_~j~0#1 := 0; {483#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:57,754 INFO L290 TraceCheckUtils]: 3: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~n~0#1); {483#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:57,754 INFO L290 TraceCheckUtils]: 4: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_~j~0#1 < main_~m~0#1; {483#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:57,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 1 + main_~j~0#1 <= 2147483647; {483#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:57,755 INFO L290 TraceCheckUtils]: 6: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {483#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:57,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~n~0#1); {483#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:57,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 0; {483#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:57,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {483#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(1 + main_~i~0#1 <= 2147483647); {482#false} is VALID [2022-02-21 03:03:57,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:03:57,757 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:57,757 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879895027] [2022-02-21 03:03:57,757 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879895027] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:57,757 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:57,757 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:03:57,757 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29947623] [2022-02-21 03:03:57,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:57,758 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 10 [2022-02-21 03:03:57,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:57,758 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:03:57,769 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:03:57,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:03:57,770 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:57,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:03:57,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:03:57,770 INFO L87 Difference]: Start difference. First operand 29 states and 34 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:03:57,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:57,815 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2022-02-21 03:03:57,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:03:57,815 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 10 [2022-02-21 03:03:57,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:57,816 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:03:57,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-02-21 03:03:57,817 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:03:57,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-02-21 03:03:57,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 23 transitions. [2022-02-21 03:03:57,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:57,838 INFO L225 Difference]: With dead ends: 50 [2022-02-21 03:03:57,838 INFO L226 Difference]: Without dead ends: 49 [2022-02-21 03:03:57,839 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:03:57,841 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:57,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 15 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:57,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-02-21 03:03:57,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2022-02-21 03:03:57,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:57,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 47 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 46 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:57,865 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 47 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 46 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:57,865 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 47 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 46 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:57,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:57,867 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2022-02-21 03:03:57,867 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2022-02-21 03:03:57,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:57,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:57,868 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 46 states have internal predecessors, (57), 0 states have call successors, (0), 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 49 states. [2022-02-21 03:03:57,868 INFO L87 Difference]: Start difference. First operand has 47 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 46 states have internal predecessors, (57), 0 states have call successors, (0), 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 49 states. [2022-02-21 03:03:57,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:57,869 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2022-02-21 03:03:57,869 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2022-02-21 03:03:57,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:57,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:57,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:57,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:57,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 46 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:57,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2022-02-21 03:03:57,871 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 10 [2022-02-21 03:03:57,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:57,871 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2022-02-21 03:03:57,872 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:03:57,872 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-02-21 03:03:57,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-21 03:03:57,872 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:57,872 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:57,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-21 03:03:57,872 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:03:57,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:57,873 INFO L85 PathProgramCache]: Analyzing trace with hash 684707377, now seen corresponding path program 1 times [2022-02-21 03:03:57,873 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:57,873 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006813] [2022-02-21 03:03:57,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:57,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:57,912 INFO L290 TraceCheckUtils]: 0: Hoare triple {701#true} assume { :begin_inline_ULTIMATE.init } true; {701#true} is VALID [2022-02-21 03:03:57,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {701#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~m~0#1;havoc main_~n~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {701#true} is VALID [2022-02-21 03:03:57,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {701#true} assume main_~m~0#1 > 0 && main_~n~0#1 > main_~m~0#1;main_~i~0#1 := 0;main_~j~0#1 := 0; {703#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:03:57,913 INFO L290 TraceCheckUtils]: 3: Hoare triple {703#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1); {703#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:03:57,913 INFO L290 TraceCheckUtils]: 4: Hoare triple {703#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_~j~0#1 < main_~m~0#1; {703#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:03:57,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {703#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume 1 + main_~j~0#1 <= 2147483647; {703#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:03:57,914 INFO L290 TraceCheckUtils]: 6: Hoare triple {703#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {703#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:03:57,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {703#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1); {703#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:03:57,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {703#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 0; {703#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:03:57,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {703#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume 1 + main_~i~0#1 <= 2147483647; {703#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:03:57,916 INFO L290 TraceCheckUtils]: 10: Hoare triple {703#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(1 + main_~i~0#1 >= -2147483648); {702#false} is VALID [2022-02-21 03:03:57,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:03:57,916 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:57,916 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006813] [2022-02-21 03:03:57,916 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006813] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:57,916 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:57,916 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:03:57,917 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230544673] [2022-02-21 03:03:57,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:57,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-21 03:03:57,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:57,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:57,924 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:57,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:03:57,925 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:57,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:03:57,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:03:57,925 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:57,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:57,961 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-02-21 03:03:57,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:03:57,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-21 03:03:57,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:57,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:57,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2022-02-21 03:03:57,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:57,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2022-02-21 03:03:57,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 13 transitions. [2022-02-21 03:03:57,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:57,984 INFO L225 Difference]: With dead ends: 47 [2022-02-21 03:03:57,985 INFO L226 Difference]: Without dead ends: 46 [2022-02-21 03:03:57,985 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:03:57,986 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:57,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 9 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:57,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-21 03:03:58,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-02-21 03:03:58,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:58,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 45 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:58,007 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 45 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:58,007 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 45 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:58,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:58,009 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-02-21 03:03:58,009 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2022-02-21 03:03:58,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:58,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:58,010 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 45 states have internal predecessors, (56), 0 states have call successors, (0), 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 46 states. [2022-02-21 03:03:58,010 INFO L87 Difference]: Start difference. First operand has 46 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 45 states have internal predecessors, (56), 0 states have call successors, (0), 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 46 states. [2022-02-21 03:03:58,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:58,011 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-02-21 03:03:58,011 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2022-02-21 03:03:58,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:58,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:58,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:58,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:58,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 45 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:58,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2022-02-21 03:03:58,013 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 11 [2022-02-21 03:03:58,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:58,014 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2022-02-21 03:03:58,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:58,014 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2022-02-21 03:03:58,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-21 03:03:58,015 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:58,015 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:58,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-21 03:03:58,015 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:03:58,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:58,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1317823485, now seen corresponding path program 1 times [2022-02-21 03:03:58,016 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:58,016 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177955953] [2022-02-21 03:03:58,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:58,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:58,046 INFO L290 TraceCheckUtils]: 0: Hoare triple {911#true} assume { :begin_inline_ULTIMATE.init } true; {911#true} is VALID [2022-02-21 03:03:58,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {911#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~m~0#1;havoc main_~n~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {911#true} is VALID [2022-02-21 03:03:58,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {911#true} assume main_~m~0#1 > 0 && main_~n~0#1 > main_~m~0#1;main_~i~0#1 := 0;main_~j~0#1 := 0; {913#(<= 1 |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-21 03:03:58,047 INFO L290 TraceCheckUtils]: 3: Hoare triple {913#(<= 1 |ULTIMATE.start_main_~m~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1); {913#(<= 1 |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-21 03:03:58,048 INFO L290 TraceCheckUtils]: 4: Hoare triple {913#(<= 1 |ULTIMATE.start_main_~m~0#1|)} assume main_~j~0#1 < main_~m~0#1; {913#(<= 1 |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-21 03:03:58,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {913#(<= 1 |ULTIMATE.start_main_~m~0#1|)} assume 1 + main_~j~0#1 <= 2147483647; {913#(<= 1 |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-21 03:03:58,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {913#(<= 1 |ULTIMATE.start_main_~m~0#1|)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {913#(<= 1 |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-21 03:03:58,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {913#(<= 1 |ULTIMATE.start_main_~m~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1); {913#(<= 1 |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-21 03:03:58,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {913#(<= 1 |ULTIMATE.start_main_~m~0#1|)} assume !(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 0; {914#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-21 03:03:58,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {914#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume 1 + main_~i~0#1 <= 2147483647; {914#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-21 03:03:58,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {914#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1; {914#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-21 03:03:58,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {914#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1); {914#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-21 03:03:58,051 INFO L290 TraceCheckUtils]: 12: Hoare triple {914#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 0; {912#false} is VALID [2022-02-21 03:03:58,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {912#false} assume !(1 + main_~i~0#1 <= 2147483647); {912#false} is VALID [2022-02-21 03:03:58,051 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:03:58,051 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:58,052 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177955953] [2022-02-21 03:03:58,052 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177955953] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:03:58,052 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361054225] [2022-02-21 03:03:58,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:58,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:58,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:58,067 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:03:58,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-21 03:03:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:58,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:03:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:58,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:03:58,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {911#true} assume { :begin_inline_ULTIMATE.init } true; {911#true} is VALID [2022-02-21 03:03:58,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {911#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~m~0#1;havoc main_~n~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {911#true} is VALID [2022-02-21 03:03:58,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {911#true} assume main_~m~0#1 > 0 && main_~n~0#1 > main_~m~0#1;main_~i~0#1 := 0;main_~j~0#1 := 0; {924#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:58,153 INFO L290 TraceCheckUtils]: 3: Hoare triple {924#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~n~0#1); {924#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:58,153 INFO L290 TraceCheckUtils]: 4: Hoare triple {924#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_~j~0#1 < main_~m~0#1; {924#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:58,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {924#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 1 + main_~j~0#1 <= 2147483647; {924#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:58,154 INFO L290 TraceCheckUtils]: 6: Hoare triple {924#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {924#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:58,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {924#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~n~0#1); {924#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:58,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {924#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 0; {924#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:58,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {924#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 1 + main_~i~0#1 <= 2147483647; {924#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:58,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {924#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1; {949#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:03:58,156 INFO L290 TraceCheckUtils]: 11: Hoare triple {949#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~n~0#1); {949#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:03:58,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {949#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 0; {949#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:03:58,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {949#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(1 + main_~i~0#1 <= 2147483647); {912#false} is VALID [2022-02-21 03:03:58,157 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:03:58,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:03:58,215 INFO L290 TraceCheckUtils]: 13: Hoare triple {959#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !(1 + main_~i~0#1 <= 2147483647); {912#false} is VALID [2022-02-21 03:03:58,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {959#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 0; {959#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:03:58,216 INFO L290 TraceCheckUtils]: 11: Hoare triple {959#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !!(main_~i~0#1 < main_~n~0#1); {959#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:03:58,216 INFO L290 TraceCheckUtils]: 10: Hoare triple {969#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1; {959#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:03:58,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {969#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume 1 + main_~i~0#1 <= 2147483647; {969#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:03:58,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {969#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume !(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 0; {969#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:03:58,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {969#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume !!(main_~i~0#1 < main_~n~0#1); {969#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:03:58,218 INFO L290 TraceCheckUtils]: 6: Hoare triple {969#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {969#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:03:58,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {969#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume 1 + main_~j~0#1 <= 2147483647; {969#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:03:58,218 INFO L290 TraceCheckUtils]: 4: Hoare triple {969#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume main_~j~0#1 < main_~m~0#1; {969#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:03:58,219 INFO L290 TraceCheckUtils]: 3: Hoare triple {969#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume !!(main_~i~0#1 < main_~n~0#1); {969#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:03:58,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {911#true} assume main_~m~0#1 > 0 && main_~n~0#1 > main_~m~0#1;main_~i~0#1 := 0;main_~j~0#1 := 0; {969#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:03:58,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {911#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~m~0#1;havoc main_~n~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {911#true} is VALID [2022-02-21 03:03:58,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {911#true} assume { :begin_inline_ULTIMATE.init } true; {911#true} is VALID [2022-02-21 03:03:58,219 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:03:58,220 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361054225] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:03:58,220 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:03:58,220 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2022-02-21 03:03:58,220 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320517526] [2022-02-21 03:03:58,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:03:58,221 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 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 14 [2022-02-21 03:03:58,221 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:58,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:58,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:58,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-21 03:03:58,242 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:58,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 03:03:58,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:03:58,243 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:58,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:58,504 INFO L93 Difference]: Finished difference Result 136 states and 168 transitions. [2022-02-21 03:03:58,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 03:03:58,504 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 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 14 [2022-02-21 03:03:58,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:58,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:58,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-02-21 03:03:58,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:58,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-02-21 03:03:58,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 69 transitions. [2022-02-21 03:03:58,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:58,587 INFO L225 Difference]: With dead ends: 136 [2022-02-21 03:03:58,587 INFO L226 Difference]: Without dead ends: 113 [2022-02-21 03:03:58,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2022-02-21 03:03:58,588 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 54 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:58,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 8 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:58,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-02-21 03:03:58,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2022-02-21 03:03:58,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:58,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 109 states, 107 states have (on average 1.2429906542056075) internal successors, (133), 108 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:58,656 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 109 states, 107 states have (on average 1.2429906542056075) internal successors, (133), 108 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:58,657 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 109 states, 107 states have (on average 1.2429906542056075) internal successors, (133), 108 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:58,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:58,660 INFO L93 Difference]: Finished difference Result 113 states and 133 transitions. [2022-02-21 03:03:58,660 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 133 transitions. [2022-02-21 03:03:58,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:58,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:58,661 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 107 states have (on average 1.2429906542056075) internal successors, (133), 108 states have internal predecessors, (133), 0 states have call successors, (0), 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 113 states. [2022-02-21 03:03:58,661 INFO L87 Difference]: Start difference. First operand has 109 states, 107 states have (on average 1.2429906542056075) internal successors, (133), 108 states have internal predecessors, (133), 0 states have call successors, (0), 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 113 states. [2022-02-21 03:03:58,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:58,664 INFO L93 Difference]: Finished difference Result 113 states and 133 transitions. [2022-02-21 03:03:58,664 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 133 transitions. [2022-02-21 03:03:58,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:58,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:58,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:58,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:58,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 107 states have (on average 1.2429906542056075) internal successors, (133), 108 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:58,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2022-02-21 03:03:58,667 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 14 [2022-02-21 03:03:58,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:58,667 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2022-02-21 03:03:58,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:58,668 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2022-02-21 03:03:58,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-21 03:03:58,668 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:58,668 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1] [2022-02-21 03:03:58,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:03:58,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-02-21 03:03:58,885 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:03:58,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:58,886 INFO L85 PathProgramCache]: Analyzing trace with hash -641379399, now seen corresponding path program 2 times [2022-02-21 03:03:58,886 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:58,886 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544402959] [2022-02-21 03:03:58,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:58,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:58,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:58,919 INFO L290 TraceCheckUtils]: 0: Hoare triple {1543#true} assume { :begin_inline_ULTIMATE.init } true; {1543#true} is VALID [2022-02-21 03:03:58,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {1543#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~m~0#1;havoc main_~n~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:58,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~m~0#1 > 0 && main_~n~0#1 > main_~m~0#1;main_~i~0#1 := 0;main_~j~0#1 := 0; {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:58,920 INFO L290 TraceCheckUtils]: 3: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:58,920 INFO L290 TraceCheckUtils]: 4: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~j~0#1 < main_~m~0#1; {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:58,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:58,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:58,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:58,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~j~0#1 < main_~m~0#1; {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:58,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:58,922 INFO L290 TraceCheckUtils]: 10: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:58,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:58,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~j~0#1 < main_~m~0#1; {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:58,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:58,923 INFO L290 TraceCheckUtils]: 14: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:58,924 INFO L290 TraceCheckUtils]: 15: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:58,924 INFO L290 TraceCheckUtils]: 16: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~j~0#1 < main_~m~0#1; {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:58,924 INFO L290 TraceCheckUtils]: 17: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:58,925 INFO L290 TraceCheckUtils]: 18: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:58,925 INFO L290 TraceCheckUtils]: 19: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:58,925 INFO L290 TraceCheckUtils]: 20: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~j~0#1 < main_~m~0#1; {1546#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} is VALID [2022-02-21 03:03:58,926 INFO L290 TraceCheckUtils]: 21: Hoare triple {1546#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} assume !(1 + main_~j~0#1 <= 2147483647); {1544#false} is VALID [2022-02-21 03:03:58,926 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-02-21 03:03:58,926 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:58,926 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544402959] [2022-02-21 03:03:58,926 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544402959] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:03:58,926 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505250457] [2022-02-21 03:03:58,927 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:03:58,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:58,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:58,928 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:03:58,980 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-21 03:03:58,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:03:58,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:03:58,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:58,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:03:58,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-21 03:03:59,072 INFO L290 TraceCheckUtils]: 0: Hoare triple {1543#true} assume { :begin_inline_ULTIMATE.init } true; {1543#true} is VALID [2022-02-21 03:03:59,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {1543#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~m~0#1;havoc main_~n~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~m~0#1 > 0 && main_~n~0#1 > main_~m~0#1;main_~i~0#1 := 0;main_~j~0#1 := 0; {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,073 INFO L290 TraceCheckUtils]: 3: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,073 INFO L290 TraceCheckUtils]: 4: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~j~0#1 < main_~m~0#1; {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,074 INFO L290 TraceCheckUtils]: 6: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,074 INFO L290 TraceCheckUtils]: 7: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~j~0#1 < main_~m~0#1; {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,075 INFO L290 TraceCheckUtils]: 10: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,076 INFO L290 TraceCheckUtils]: 11: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,076 INFO L290 TraceCheckUtils]: 12: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~j~0#1 < main_~m~0#1; {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,076 INFO L290 TraceCheckUtils]: 13: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,077 INFO L290 TraceCheckUtils]: 14: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,077 INFO L290 TraceCheckUtils]: 15: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,077 INFO L290 TraceCheckUtils]: 16: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~j~0#1 < main_~m~0#1; {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,078 INFO L290 TraceCheckUtils]: 17: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,078 INFO L290 TraceCheckUtils]: 18: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,078 INFO L290 TraceCheckUtils]: 19: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,079 INFO L290 TraceCheckUtils]: 20: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~j~0#1 < main_~m~0#1; {1546#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} is VALID [2022-02-21 03:03:59,079 INFO L290 TraceCheckUtils]: 21: Hoare triple {1546#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} assume !(1 + main_~j~0#1 <= 2147483647); {1544#false} is VALID [2022-02-21 03:03:59,079 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-02-21 03:03:59,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:03:59,171 INFO L290 TraceCheckUtils]: 21: Hoare triple {1546#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} assume !(1 + main_~j~0#1 <= 2147483647); {1544#false} is VALID [2022-02-21 03:03:59,172 INFO L290 TraceCheckUtils]: 20: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~j~0#1 < main_~m~0#1; {1546#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} is VALID [2022-02-21 03:03:59,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,173 INFO L290 TraceCheckUtils]: 16: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~j~0#1 < main_~m~0#1; {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,174 INFO L290 TraceCheckUtils]: 13: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,174 INFO L290 TraceCheckUtils]: 12: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~j~0#1 < main_~m~0#1; {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,174 INFO L290 TraceCheckUtils]: 11: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~j~0#1 < main_~m~0#1; {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,186 INFO L290 TraceCheckUtils]: 4: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~j~0#1 < main_~m~0#1; {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,187 INFO L290 TraceCheckUtils]: 3: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~m~0#1 > 0 && main_~n~0#1 > main_~m~0#1;main_~i~0#1 := 0;main_~j~0#1 := 0; {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {1543#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~m~0#1;havoc main_~n~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {1545#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {1543#true} assume { :begin_inline_ULTIMATE.init } true; {1543#true} is VALID [2022-02-21 03:03:59,189 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-02-21 03:03:59,189 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505250457] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:03:59,189 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:03:59,189 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2022-02-21 03:03:59,189 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009743266] [2022-02-21 03:03:59,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:03:59,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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 22 [2022-02-21 03:03:59,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:59,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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:03:59,196 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:03:59,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:03:59,196 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:59,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:03:59,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:03:59,196 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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:03:59,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:59,298 INFO L93 Difference]: Finished difference Result 109 states and 133 transitions. [2022-02-21 03:03:59,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:03:59,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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 22 [2022-02-21 03:03:59,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:59,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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:03:59,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2022-02-21 03:03:59,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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:03:59,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2022-02-21 03:03:59,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 14 transitions. [2022-02-21 03:03:59,307 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:03:59,308 INFO L225 Difference]: With dead ends: 109 [2022-02-21 03:03:59,308 INFO L226 Difference]: Without dead ends: 108 [2022-02-21 03:03:59,308 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:03:59,309 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:59,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 9 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:59,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-02-21 03:03:59,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 43. [2022-02-21 03:03:59,343 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:59,343 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 43 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 42 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:59,343 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 43 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 42 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:59,344 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 43 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 42 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:59,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:59,346 INFO L93 Difference]: Finished difference Result 108 states and 128 transitions. [2022-02-21 03:03:59,346 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 128 transitions. [2022-02-21 03:03:59,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:59,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:59,346 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 42 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 108 states. [2022-02-21 03:03:59,346 INFO L87 Difference]: Start difference. First operand has 43 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 42 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 108 states. [2022-02-21 03:03:59,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:59,348 INFO L93 Difference]: Finished difference Result 108 states and 128 transitions. [2022-02-21 03:03:59,348 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 128 transitions. [2022-02-21 03:03:59,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:59,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:59,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:59,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:59,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 42 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:59,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-02-21 03:03:59,349 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 22 [2022-02-21 03:03:59,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:59,349 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-02-21 03:03:59,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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:03:59,349 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-02-21 03:03:59,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-21 03:03:59,350 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:59,350 INFO L514 BasicCegarLoop]: trace histogram [10, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1] [2022-02-21 03:03:59,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:03:59,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:59,550 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:03:59,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:59,551 INFO L85 PathProgramCache]: Analyzing trace with hash -14875448, now seen corresponding path program 2 times [2022-02-21 03:03:59,552 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:59,552 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688145999] [2022-02-21 03:03:59,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:59,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:59,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {2080#true} assume { :begin_inline_ULTIMATE.init } true; {2080#true} is VALID [2022-02-21 03:03:59,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {2080#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~m~0#1;havoc main_~n~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~m~0#1 > 0 && main_~n~0#1 > main_~m~0#1;main_~i~0#1 := 0;main_~j~0#1 := 0; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,620 INFO L290 TraceCheckUtils]: 3: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,621 INFO L290 TraceCheckUtils]: 4: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~j~0#1 < main_~m~0#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,621 INFO L290 TraceCheckUtils]: 6: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 0; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~i~0#1 <= 2147483647; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,623 INFO L290 TraceCheckUtils]: 10: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,623 INFO L290 TraceCheckUtils]: 11: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,623 INFO L290 TraceCheckUtils]: 12: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~j~0#1 < main_~m~0#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,624 INFO L290 TraceCheckUtils]: 15: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,624 INFO L290 TraceCheckUtils]: 16: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 0; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,625 INFO L290 TraceCheckUtils]: 17: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~i~0#1 <= 2147483647; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,625 INFO L290 TraceCheckUtils]: 18: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,625 INFO L290 TraceCheckUtils]: 19: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,626 INFO L290 TraceCheckUtils]: 20: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~j~0#1 < main_~m~0#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,628 INFO L290 TraceCheckUtils]: 21: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,629 INFO L290 TraceCheckUtils]: 22: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,629 INFO L290 TraceCheckUtils]: 23: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,629 INFO L290 TraceCheckUtils]: 24: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 0; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,630 INFO L290 TraceCheckUtils]: 25: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~i~0#1 <= 2147483647; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,630 INFO L290 TraceCheckUtils]: 26: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,630 INFO L290 TraceCheckUtils]: 27: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,631 INFO L290 TraceCheckUtils]: 28: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~j~0#1 < main_~m~0#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,631 INFO L290 TraceCheckUtils]: 29: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,631 INFO L290 TraceCheckUtils]: 30: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,632 INFO L290 TraceCheckUtils]: 31: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,632 INFO L290 TraceCheckUtils]: 32: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 0; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,633 INFO L290 TraceCheckUtils]: 33: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~i~0#1 <= 2147483647; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,633 INFO L290 TraceCheckUtils]: 34: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,634 INFO L290 TraceCheckUtils]: 35: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {2083#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:03:59,634 INFO L290 TraceCheckUtils]: 36: Hoare triple {2083#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume main_~j~0#1 < main_~m~0#1; {2083#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:03:59,634 INFO L290 TraceCheckUtils]: 37: Hoare triple {2083#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume 1 + main_~j~0#1 <= 2147483647; {2083#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:03:59,635 INFO L290 TraceCheckUtils]: 38: Hoare triple {2083#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {2083#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:03:59,635 INFO L290 TraceCheckUtils]: 39: Hoare triple {2083#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !!(main_~i~0#1 < main_~n~0#1); {2083#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:03:59,635 INFO L290 TraceCheckUtils]: 40: Hoare triple {2083#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 0; {2083#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:03:59,635 INFO L290 TraceCheckUtils]: 41: Hoare triple {2083#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !(1 + main_~i~0#1 <= 2147483647); {2081#false} is VALID [2022-02-21 03:03:59,636 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-02-21 03:03:59,636 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:59,636 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688145999] [2022-02-21 03:03:59,636 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688145999] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:03:59,636 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300857765] [2022-02-21 03:03:59,636 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:03:59,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:59,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:59,657 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:03:59,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-21 03:03:59,723 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-21 03:03:59,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:03:59,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:03:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:59,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:03:59,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {2080#true} assume { :begin_inline_ULTIMATE.init } true; {2080#true} is VALID [2022-02-21 03:03:59,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {2080#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~m~0#1;havoc main_~n~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~m~0#1 > 0 && main_~n~0#1 > main_~m~0#1;main_~i~0#1 := 0;main_~j~0#1 := 0; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,876 INFO L290 TraceCheckUtils]: 3: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,877 INFO L290 TraceCheckUtils]: 4: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~j~0#1 < main_~m~0#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,877 INFO L290 TraceCheckUtils]: 6: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,878 INFO L290 TraceCheckUtils]: 8: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 0; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~i~0#1 <= 2147483647; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,879 INFO L290 TraceCheckUtils]: 10: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,879 INFO L290 TraceCheckUtils]: 11: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~j~0#1 < main_~m~0#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,880 INFO L290 TraceCheckUtils]: 15: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,880 INFO L290 TraceCheckUtils]: 16: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 0; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,881 INFO L290 TraceCheckUtils]: 17: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~i~0#1 <= 2147483647; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,881 INFO L290 TraceCheckUtils]: 18: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,881 INFO L290 TraceCheckUtils]: 19: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,886 INFO L290 TraceCheckUtils]: 20: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~j~0#1 < main_~m~0#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,886 INFO L290 TraceCheckUtils]: 21: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,887 INFO L290 TraceCheckUtils]: 22: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,889 INFO L290 TraceCheckUtils]: 23: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,889 INFO L290 TraceCheckUtils]: 24: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 0; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,889 INFO L290 TraceCheckUtils]: 25: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~i~0#1 <= 2147483647; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,890 INFO L290 TraceCheckUtils]: 26: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,890 INFO L290 TraceCheckUtils]: 27: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,890 INFO L290 TraceCheckUtils]: 28: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~j~0#1 < main_~m~0#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,891 INFO L290 TraceCheckUtils]: 29: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,891 INFO L290 TraceCheckUtils]: 30: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,891 INFO L290 TraceCheckUtils]: 31: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,892 INFO L290 TraceCheckUtils]: 32: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 0; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,892 INFO L290 TraceCheckUtils]: 33: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~i~0#1 <= 2147483647; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,892 INFO L290 TraceCheckUtils]: 34: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,893 INFO L290 TraceCheckUtils]: 35: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,893 INFO L290 TraceCheckUtils]: 36: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~j~0#1 < main_~m~0#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,893 INFO L290 TraceCheckUtils]: 37: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,894 INFO L290 TraceCheckUtils]: 38: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:59,894 INFO L290 TraceCheckUtils]: 39: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {2083#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:03:59,894 INFO L290 TraceCheckUtils]: 40: Hoare triple {2083#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 0; {2083#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:03:59,895 INFO L290 TraceCheckUtils]: 41: Hoare triple {2083#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !(1 + main_~i~0#1 <= 2147483647); {2081#false} is VALID [2022-02-21 03:03:59,895 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2022-02-21 03:03:59,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:04:00,054 INFO L290 TraceCheckUtils]: 41: Hoare triple {2083#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !(1 + main_~i~0#1 <= 2147483647); {2081#false} is VALID [2022-02-21 03:04:00,054 INFO L290 TraceCheckUtils]: 40: Hoare triple {2083#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 0; {2083#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:00,055 INFO L290 TraceCheckUtils]: 39: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {2083#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:04:00,055 INFO L290 TraceCheckUtils]: 38: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:00,055 INFO L290 TraceCheckUtils]: 37: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:00,056 INFO L290 TraceCheckUtils]: 36: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~j~0#1 < main_~m~0#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:00,056 INFO L290 TraceCheckUtils]: 35: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:00,056 INFO L290 TraceCheckUtils]: 34: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:00,057 INFO L290 TraceCheckUtils]: 33: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~i~0#1 <= 2147483647; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:00,057 INFO L290 TraceCheckUtils]: 32: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 0; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:00,057 INFO L290 TraceCheckUtils]: 31: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:00,058 INFO L290 TraceCheckUtils]: 30: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:00,058 INFO L290 TraceCheckUtils]: 29: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:00,058 INFO L290 TraceCheckUtils]: 28: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~j~0#1 < main_~m~0#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:00,059 INFO L290 TraceCheckUtils]: 27: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:00,059 INFO L290 TraceCheckUtils]: 26: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:00,059 INFO L290 TraceCheckUtils]: 25: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~i~0#1 <= 2147483647; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:00,060 INFO L290 TraceCheckUtils]: 24: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 0; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:00,060 INFO L290 TraceCheckUtils]: 23: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:00,060 INFO L290 TraceCheckUtils]: 22: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:00,061 INFO L290 TraceCheckUtils]: 21: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:00,061 INFO L290 TraceCheckUtils]: 20: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~j~0#1 < main_~m~0#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:00,061 INFO L290 TraceCheckUtils]: 19: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:00,062 INFO L290 TraceCheckUtils]: 18: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:00,062 INFO L290 TraceCheckUtils]: 17: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~i~0#1 <= 2147483647; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:00,062 INFO L290 TraceCheckUtils]: 16: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 0; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:00,063 INFO L290 TraceCheckUtils]: 15: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:00,063 INFO L290 TraceCheckUtils]: 14: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:00,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:00,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~j~0#1 < main_~m~0#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:00,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:00,064 INFO L290 TraceCheckUtils]: 10: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:00,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~i~0#1 <= 2147483647; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:00,066 INFO L290 TraceCheckUtils]: 8: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 0; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:00,067 INFO L290 TraceCheckUtils]: 7: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:00,067 INFO L290 TraceCheckUtils]: 6: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:00,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:00,068 INFO L290 TraceCheckUtils]: 4: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~j~0#1 < main_~m~0#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:00,068 INFO L290 TraceCheckUtils]: 3: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1); {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:00,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~m~0#1 > 0 && main_~n~0#1 > main_~m~0#1;main_~i~0#1 := 0;main_~j~0#1 := 0; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:00,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {2080#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~m~0#1;havoc main_~n~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {2082#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:00,069 INFO L290 TraceCheckUtils]: 0: Hoare triple {2080#true} assume { :begin_inline_ULTIMATE.init } true; {2080#true} is VALID [2022-02-21 03:04:00,069 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2022-02-21 03:04:00,069 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300857765] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:04:00,069 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:04:00,070 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2022-02-21 03:04:00,070 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718180386] [2022-02-21 03:04:00,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:04:00,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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) Word has length 42 [2022-02-21 03:04:00,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:00,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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:04:00,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:00,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:04:00,082 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:00,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:04:00,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:04:00,083 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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:04:00,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:00,139 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-02-21 03:04:00,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:04:00,139 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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) Word has length 42 [2022-02-21 03:04:00,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:00,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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:04:00,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2022-02-21 03:04:00,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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:04:00,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2022-02-21 03:04:00,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 12 transitions. [2022-02-21 03:04:00,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:00,148 INFO L225 Difference]: With dead ends: 43 [2022-02-21 03:04:00,148 INFO L226 Difference]: Without dead ends: 0 [2022-02-21 03:04:00,149 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:04:00,149 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 1 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:00,150 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 8 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:00,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-21 03:04:00,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-21 03:04:00,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:00,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:00,151 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:00,151 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:00,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:00,151 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:04:00,151 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:04:00,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:00,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:00,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-21 03:04:00,152 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-21 03:04:00,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:00,152 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:04:00,152 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:04:00,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:00,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:00,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:00,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:00,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:00,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 03:04:00,153 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2022-02-21 03:04:00,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:00,153 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:04:00,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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:04:00,153 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:04:00,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:00,155 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-02-21 03:04:00,156 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-02-21 03:04:00,156 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-02-21 03:04:00,156 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-02-21 03:04:00,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-02-21 03:04:00,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:00,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-21 03:04:00,498 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2022-02-21 03:04:00,498 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-21 03:04:00,498 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 25) no Hoare annotation was computed. [2022-02-21 03:04:00,499 INFO L861 garLoopResultBuilder]: At program point L29(lines 13 30) the Hoare annotation is: true [2022-02-21 03:04:00,499 INFO L858 garLoopResultBuilder]: For program point L25(line 25) no Hoare annotation was computed. [2022-02-21 03:04:00,499 INFO L858 garLoopResultBuilder]: For program point L25-1(line 25) no Hoare annotation was computed. [2022-02-21 03:04:00,499 INFO L858 garLoopResultBuilder]: For program point L21(lines 21 26) no Hoare annotation was computed. [2022-02-21 03:04:00,499 INFO L854 garLoopResultBuilder]: At program point L21-2(lines 20 27) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~n~0#1| 2147483647)) (.cse1 (<= 1 |ULTIMATE.start_main_~m~0#1|)) (.cse2 (<= 0 |ULTIMATE.start_main_~j~0#1|)) (.cse3 (<= 0 |ULTIMATE.start_main_~i~0#1|)) (.cse4 (<= |ULTIMATE.start_main_~m~0#1| 2147483647))) (or (and .cse0 (<= |ULTIMATE.start_main_~i~0#1| 2147483646) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= |ULTIMATE.start_main_~j~0#1| 0)))) [2022-02-21 03:04:00,499 INFO L858 garLoopResultBuilder]: For program point L17(lines 17 28) no Hoare annotation was computed. [2022-02-21 03:04:00,499 INFO L858 garLoopResultBuilder]: For program point L17-1(lines 17 28) no Hoare annotation was computed. [2022-02-21 03:04:00,499 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-21 03:04:00,500 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2022-02-21 03:04:00,500 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 25) no Hoare annotation was computed. [2022-02-21 03:04:00,500 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-21 03:04:00,500 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-21 03:04:00,500 INFO L858 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2022-02-21 03:04:00,500 INFO L858 garLoopResultBuilder]: For program point L22-1(line 22) no Hoare annotation was computed. [2022-02-21 03:04:00,502 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2022-02-21 03:04:00,503 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 03:04:00,506 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-21 03:04:00,506 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-21 03:04:00,506 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-02-21 03:04:00,506 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-02-21 03:04:00,506 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2022-02-21 03:04:00,506 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2022-02-21 03:04:00,506 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-21 03:04:00,506 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2022-02-21 03:04:00,506 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-21 03:04:00,506 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-21 03:04:00,507 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-21 03:04:00,507 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-21 03:04:00,507 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-21 03:04:00,507 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-02-21 03:04:00,507 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-02-21 03:04:00,507 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-21 03:04:00,507 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-21 03:04:00,507 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-21 03:04:00,507 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-02-21 03:04:00,507 WARN L170 areAnnotationChecker]: L25-1 has no Hoare annotation [2022-02-21 03:04:00,507 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-21 03:04:00,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 03:04:00 BoogieIcfgContainer [2022-02-21 03:04:00,514 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-21 03:04:00,515 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:04:00,515 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:04:00,515 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:04:00,515 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:03:56" (3/4) ... [2022-02-21 03:04:00,517 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-21 03:04:00,524 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-21 03:04:00,524 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-02-21 03:04:00,524 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-21 03:04:00,542 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 03:04:00,542 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:04:00,543 INFO L158 Benchmark]: Toolchain (without parser) took 4779.98ms. Allocated memory was 104.9MB in the beginning and 201.3MB in the end (delta: 96.5MB). Free memory was 77.3MB in the beginning and 135.0MB in the end (delta: -57.7MB). Peak memory consumption was 39.2MB. Max. memory is 16.1GB. [2022-02-21 03:04:00,543 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory is still 62.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:04:00,544 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.99ms. Allocated memory was 104.9MB in the beginning and 157.3MB in the end (delta: 52.4MB). Free memory was 77.1MB in the beginning and 133.6MB in the end (delta: -56.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:04:00,544 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.31ms. Allocated memory is still 157.3MB. Free memory was 133.6MB in the beginning and 132.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:04:00,544 INFO L158 Benchmark]: Boogie Preprocessor took 24.18ms. Allocated memory is still 157.3MB. Free memory was 132.4MB in the beginning and 131.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:04:00,544 INFO L158 Benchmark]: RCFGBuilder took 284.39ms. Allocated memory is still 157.3MB. Free memory was 131.1MB in the beginning and 121.1MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 03:04:00,544 INFO L158 Benchmark]: TraceAbstraction took 4163.71ms. Allocated memory was 157.3MB in the beginning and 201.3MB in the end (delta: 44.0MB). Free memory was 120.6MB in the beginning and 137.1MB in the end (delta: -16.5MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2022-02-21 03:04:00,545 INFO L158 Benchmark]: Witness Printer took 27.66ms. Allocated memory is still 201.3MB. Free memory was 137.1MB in the beginning and 135.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:04:00,546 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 104.9MB. Free memory is still 62.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 233.99ms. Allocated memory was 104.9MB in the beginning and 157.3MB in the end (delta: 52.4MB). Free memory was 77.1MB in the beginning and 133.6MB in the end (delta: -56.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.31ms. Allocated memory is still 157.3MB. Free memory was 133.6MB in the beginning and 132.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.18ms. Allocated memory is still 157.3MB. Free memory was 132.4MB in the beginning and 131.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 284.39ms. Allocated memory is still 157.3MB. Free memory was 131.1MB in the beginning and 121.1MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 4163.71ms. Allocated memory was 157.3MB in the beginning and 201.3MB in the end (delta: 44.0MB). Free memory was 120.6MB in the beginning and 137.1MB in the end (delta: -16.5MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. * Witness Printer took 27.66ms. Allocated memory is still 201.3MB. Free memory was 137.1MB in the beginning and 135.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: 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, 17 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 9, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 106 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 106 mSDsluCounter, 111 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 116 IncrementalHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 76 mSDtfsCounter, 116 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 203 GetRequests, 171 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=7, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 72 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 14 NumberOfFragments, 40 HoareAnnotationTreeSize, 2 FomulaSimplifications, 18 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 487 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 216 NumberOfCodeBlocks, 164 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 287 ConstructedInterpolants, 0 QuantifiedInterpolants, 813 SizeOfPredicates, 4 NumberOfNonLiveVariables, 88 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 422/520 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: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((((n <= 2147483647 && i <= 2147483646) && 1 <= m) && 0 <= j) && 0 <= i) && m <= 2147483647) || (((((n <= 2147483647 && 1 <= m) && 0 <= j) && 0 <= i) && m <= 2147483647) && j <= 0) RESULT: Ultimate proved your program to be correct! [2022-02-21 03:04:00,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE