./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.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-nestedLoop-1.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 fb567b374acd8bb9754dd21f812a202296c7800faf8be127cd0c1294b076cd75 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:03:43,710 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:03:43,712 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:03:43,747 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:03:43,748 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:03:43,751 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:03:43,753 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:03:43,755 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:03:43,756 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:03:43,761 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:03:43,762 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:03:43,763 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:03:43,763 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:03:43,765 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:03:43,766 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:03:43,769 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:03:43,770 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:03:43,770 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:03:43,772 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:03:43,778 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:03:43,779 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:03:43,779 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:03:43,781 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:03:43,781 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:03:43,783 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:03:43,783 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:03:43,784 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:03:43,785 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:03:43,785 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:03:43,786 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:03:43,786 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:03:43,787 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:03:43,788 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:03:43,789 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:03:43,790 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:03:43,790 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:03:43,790 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:03:43,791 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:03:43,791 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:03:43,791 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:03:43,792 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:03:43,792 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:43,820 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:03:43,820 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:03:43,821 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:03:43,821 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:03:43,822 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:03:43,822 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:03:43,823 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:03:43,823 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:03:43,823 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:03:43,823 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:03:43,824 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:03:43,825 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:03:43,825 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:03:43,825 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:03:43,825 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:03:43,825 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:03:43,825 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:03:43,825 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:03:43,826 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:03:43,826 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:03:43,826 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:03:43,826 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:03:43,826 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:03:43,826 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:03:43,827 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:03:43,827 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:03:43,827 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:03:43,828 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:03:43,828 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:03:43,829 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:03:43,829 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 -> fb567b374acd8bb9754dd21f812a202296c7800faf8be127cd0c1294b076cd75 [2022-02-21 03:03:44,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:03:44,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:03:44,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:03:44,037 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:03:44,037 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:03:44,038 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2022-02-21 03:03:44,090 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aff1c0d33/e37cf4846dd846b7b14be76bd2e1f286/FLAGa89085e2b [2022-02-21 03:03:44,434 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:03:44,435 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2022-02-21 03:03:44,439 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aff1c0d33/e37cf4846dd846b7b14be76bd2e1f286/FLAGa89085e2b [2022-02-21 03:03:44,447 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aff1c0d33/e37cf4846dd846b7b14be76bd2e1f286 [2022-02-21 03:03:44,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:03:44,450 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:03:44,459 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:03:44,459 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:03:44,461 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:03:44,462 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:03:44" (1/1) ... [2022-02-21 03:03:44,463 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@676597a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:44, skipping insertion in model container [2022-02-21 03:03:44,463 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:03:44" (1/1) ... [2022-02-21 03:03:44,467 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:03:44,478 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:03:44,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:03:44,606 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:03:44,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:03:44,624 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:03:44,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:44 WrapperNode [2022-02-21 03:03:44,625 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:03:44,626 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:03:44,626 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:03:44,626 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:03:44,630 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:44" (1/1) ... [2022-02-21 03:03:44,633 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:44" (1/1) ... [2022-02-21 03:03:44,647 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2022-02-21 03:03:44,648 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:03:44,648 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:03:44,648 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:03:44,648 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:03:44,654 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:44" (1/1) ... [2022-02-21 03:03:44,654 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:44" (1/1) ... [2022-02-21 03:03:44,656 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:44" (1/1) ... [2022-02-21 03:03:44,656 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:44" (1/1) ... [2022-02-21 03:03:44,658 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:44" (1/1) ... [2022-02-21 03:03:44,668 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:44" (1/1) ... [2022-02-21 03:03:44,669 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:44" (1/1) ... [2022-02-21 03:03:44,670 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:03:44,670 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:03:44,671 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:03:44,671 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:03:44,673 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:44" (1/1) ... [2022-02-21 03:03:44,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:03:44,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:44,698 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:44,700 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:44,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:03:44,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:03:44,762 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:03:44,764 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:03:44,967 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:03:44,982 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:03:44,983 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-21 03:03:44,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:03:44 BoogieIcfgContainer [2022-02-21 03:03:44,985 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:03:44,986 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:03:44,986 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:03:44,989 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:03:44,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:03:44" (1/3) ... [2022-02-21 03:03:44,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a8635b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:03:44, skipping insertion in model container [2022-02-21 03:03:44,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:44" (2/3) ... [2022-02-21 03:03:44,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a8635b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:03:44, skipping insertion in model container [2022-02-21 03:03:44,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:03:44" (3/3) ... [2022-02-21 03:03:44,992 INFO L111 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2022-02-21 03:03:44,998 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:03:44,998 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-02-21 03:03:45,029 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:03:45,033 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:45,034 INFO L340 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-02-21 03:03:45,045 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 26 states have internal predecessors, (33), 0 states have call successors, (0), 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:45,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 03:03:45,048 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:45,049 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:03:45,049 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:03:45,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:45,054 INFO L85 PathProgramCache]: Analyzing trace with hash 889514734, now seen corresponding path program 1 times [2022-02-21 03:03:45,061 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:45,061 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5932839] [2022-02-21 03:03:45,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:45,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:45,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#true} assume { :begin_inline_ULTIMATE.init } true; {30#true} is VALID [2022-02-21 03:03:45,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {30#true} is VALID [2022-02-21 03:03:45,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#true} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {30#true} is VALID [2022-02-21 03:03:45,182 INFO L290 TraceCheckUtils]: 3: Hoare triple {30#true} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {30#true} is VALID [2022-02-21 03:03:45,182 INFO L290 TraceCheckUtils]: 4: Hoare triple {30#true} assume !true; {31#false} is VALID [2022-02-21 03:03:45,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#false} assume !(1 + main_~i~0#1 <= 2147483647); {31#false} is VALID [2022-02-21 03:03:45,184 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:45,184 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:45,185 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5932839] [2022-02-21 03:03:45,186 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5932839] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:45,186 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:45,186 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:03:45,188 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544223062] [2022-02-21 03:03:45,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:45,193 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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:45,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:45,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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:45,226 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:45,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-21 03:03:45,227 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:45,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 03:03:45,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:03:45,247 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 26 states have internal predecessors, (33), 0 states have call successors, (0), 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 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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:45,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:45,284 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2022-02-21 03:03:45,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:03:45,285 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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:45,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:45,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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:45,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2022-02-21 03:03:45,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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:45,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2022-02-21 03:03:45,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 62 transitions. [2022-02-21 03:03:45,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:45,364 INFO L225 Difference]: With dead ends: 51 [2022-02-21 03:03:45,364 INFO L226 Difference]: Without dead ends: 23 [2022-02-21 03:03:45,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:03:45,371 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:45,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:45,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-21 03:03:45,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-02-21 03:03:45,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:45,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 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:45,398 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 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:45,398 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 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:45,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:45,401 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-02-21 03:03:45,401 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-02-21 03:03:45,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:45,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:45,402 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 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 23 states. [2022-02-21 03:03:45,402 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 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 23 states. [2022-02-21 03:03:45,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:45,404 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-02-21 03:03:45,404 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-02-21 03:03:45,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:45,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:45,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:45,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:45,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 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:45,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-02-21 03:03:45,409 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 6 [2022-02-21 03:03:45,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:45,410 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-02-21 03:03:45,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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:45,411 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-02-21 03:03:45,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 03:03:45,412 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:45,412 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:03:45,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:03:45,413 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:03:45,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:45,416 INFO L85 PathProgramCache]: Analyzing trace with hash 889513835, now seen corresponding path program 1 times [2022-02-21 03:03:45,416 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:45,417 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951956089] [2022-02-21 03:03:45,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:45,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:45,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {165#true} assume { :begin_inline_ULTIMATE.init } true; {165#true} is VALID [2022-02-21 03:03:45,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {165#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {165#true} is VALID [2022-02-21 03:03:45,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {165#true} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {167#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:45,487 INFO L290 TraceCheckUtils]: 3: Hoare triple {167#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {167#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:45,487 INFO L290 TraceCheckUtils]: 4: Hoare triple {167#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~j~0#1 < main_~m~0#1); {167#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:45,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {167#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(1 + main_~i~0#1 <= 2147483647); {166#false} is VALID [2022-02-21 03:03:45,488 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:45,489 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:45,489 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951956089] [2022-02-21 03:03:45,491 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951956089] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:45,492 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:45,492 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:03:45,492 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214989400] [2022-02-21 03:03:45,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:45,494 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:45,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:45,495 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:45,501 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:45,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:03:45,506 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:45,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:03:45,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:03:45,507 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:45,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:45,555 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-02-21 03:03:45,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:03:45,555 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:45,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:45,556 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:45,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-02-21 03:03:45,557 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:45,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-02-21 03:03:45,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2022-02-21 03:03:45,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:45,594 INFO L225 Difference]: With dead ends: 42 [2022-02-21 03:03:45,594 INFO L226 Difference]: Without dead ends: 41 [2022-02-21 03:03:45,594 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:45,601 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 17 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:45,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 36 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:45,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-02-21 03:03:45,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2022-02-21 03:03:45,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:45,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 26 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 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:45,606 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 26 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 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:45,606 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 26 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 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:45,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:45,607 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-02-21 03:03:45,608 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-02-21 03:03:45,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:45,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:45,608 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 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 41 states. [2022-02-21 03:03:45,608 INFO L87 Difference]: Start difference. First operand has 26 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 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 41 states. [2022-02-21 03:03:45,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:45,609 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-02-21 03:03:45,610 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-02-21 03:03:45,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:45,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:45,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:45,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:45,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 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:45,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-02-21 03:03:45,611 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 6 [2022-02-21 03:03:45,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:45,611 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-02-21 03:03:45,611 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:45,611 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-02-21 03:03:45,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 03:03:45,612 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:45,612 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:03:45,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:03:45,612 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:03:45,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:45,612 INFO L85 PathProgramCache]: Analyzing trace with hash 889513869, now seen corresponding path program 1 times [2022-02-21 03:03:45,612 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:45,613 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085043734] [2022-02-21 03:03:45,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:45,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:45,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:45,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {331#true} assume { :begin_inline_ULTIMATE.init } true; {331#true} is VALID [2022-02-21 03:03:45,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {331#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {331#true} is VALID [2022-02-21 03:03:45,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {331#true} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {331#true} is VALID [2022-02-21 03:03:45,636 INFO L290 TraceCheckUtils]: 3: Hoare triple {331#true} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {333#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:03:45,636 INFO L290 TraceCheckUtils]: 4: Hoare triple {333#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume !!(main_~j~0#1 < main_~m~0#1); {333#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:03:45,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {333#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume !(1 + main_~j~0#1 <= 2147483647); {332#false} is VALID [2022-02-21 03:03:45,637 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:45,637 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:45,637 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085043734] [2022-02-21 03:03:45,637 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085043734] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:45,637 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:45,637 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:03:45,637 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974543373] [2022-02-21 03:03:45,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:45,638 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:45,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:45,638 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:45,642 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:45,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:03:45,642 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:45,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:03:45,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:03:45,643 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:45,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:45,676 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-02-21 03:03:45,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:03:45,676 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:45,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:45,676 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:45,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-02-21 03:03:45,677 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:45,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-02-21 03:03:45,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2022-02-21 03:03:45,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:45,701 INFO L225 Difference]: With dead ends: 35 [2022-02-21 03:03:45,701 INFO L226 Difference]: Without dead ends: 34 [2022-02-21 03:03:45,701 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:45,702 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:45,702 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 38 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:45,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-21 03:03:45,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2022-02-21 03:03:45,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:45,707 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 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:45,707 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 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:45,707 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 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:45,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:45,708 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-02-21 03:03:45,708 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-02-21 03:03:45,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:45,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:45,709 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 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 34 states. [2022-02-21 03:03:45,709 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 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 34 states. [2022-02-21 03:03:45,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:45,710 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-02-21 03:03:45,711 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-02-21 03:03:45,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:45,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:45,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:45,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:45,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 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:45,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-02-21 03:03:45,712 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 6 [2022-02-21 03:03:45,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:45,712 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-02-21 03:03:45,712 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:45,712 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-02-21 03:03:45,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-21 03:03:45,712 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:45,713 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:45,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:03:45,713 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:03:45,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:45,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1805125194, now seen corresponding path program 1 times [2022-02-21 03:03:45,713 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:45,714 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536219651] [2022-02-21 03:03:45,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:45,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:45,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {480#true} assume { :begin_inline_ULTIMATE.init } true; {480#true} is VALID [2022-02-21 03:03:45,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {480#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {480#true} is VALID [2022-02-21 03:03:45,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {480#true} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {482#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:03:45,738 INFO L290 TraceCheckUtils]: 3: Hoare triple {482#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {482#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:03:45,738 INFO L290 TraceCheckUtils]: 4: Hoare triple {482#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~j~0#1 < main_~m~0#1); {482#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:03:45,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {482#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume 1 + main_~i~0#1 <= 2147483647; {482#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:03:45,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {482#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(1 + main_~i~0#1 >= -2147483648); {481#false} is VALID [2022-02-21 03:03:45,739 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:45,739 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:45,739 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536219651] [2022-02-21 03:03:45,739 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536219651] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:45,739 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:45,740 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:03:45,740 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899386545] [2022-02-21 03:03:45,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:45,740 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:45,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:45,740 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:45,745 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:45,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:03:45,746 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:45,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:03:45,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:03:45,746 INFO L87 Difference]: Start difference. First operand 28 states and 32 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:45,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:45,786 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-02-21 03:03:45,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:03:45,786 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:45,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:45,786 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:45,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-02-21 03:03:45,787 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:45,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-02-21 03:03:45,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 46 transitions. [2022-02-21 03:03:45,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:45,818 INFO L225 Difference]: With dead ends: 46 [2022-02-21 03:03:45,818 INFO L226 Difference]: Without dead ends: 45 [2022-02-21 03:03:45,818 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:45,819 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 15 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:45,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 36 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:45,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-21 03:03:45,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2022-02-21 03:03:45,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:45,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 32 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 31 states have internal predecessors, (38), 0 states have call successors, (0), 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:45,827 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 32 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 31 states have internal predecessors, (38), 0 states have call successors, (0), 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:45,827 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 32 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 31 states have internal predecessors, (38), 0 states have call successors, (0), 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:45,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:45,828 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2022-02-21 03:03:45,828 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2022-02-21 03:03:45,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:45,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:45,829 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 31 states have internal predecessors, (38), 0 states have call successors, (0), 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 45 states. [2022-02-21 03:03:45,829 INFO L87 Difference]: Start difference. First operand has 32 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 31 states have internal predecessors, (38), 0 states have call successors, (0), 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 45 states. [2022-02-21 03:03:45,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:45,830 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2022-02-21 03:03:45,830 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2022-02-21 03:03:45,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:45,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:45,830 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:45,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:45,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 31 states have internal predecessors, (38), 0 states have call successors, (0), 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:45,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-02-21 03:03:45,831 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 7 [2022-02-21 03:03:45,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:45,831 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-02-21 03:03:45,832 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:45,832 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-02-21 03:03:45,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-21 03:03:45,832 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:45,832 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:45,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 03:03:45,832 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:03:45,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:45,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1805126220, now seen corresponding path program 1 times [2022-02-21 03:03:45,833 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:45,833 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620120570] [2022-02-21 03:03:45,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:45,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:45,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:45,855 INFO L290 TraceCheckUtils]: 0: Hoare triple {670#true} assume { :begin_inline_ULTIMATE.init } true; {670#true} is VALID [2022-02-21 03:03:45,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {670#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {670#true} is VALID [2022-02-21 03:03:45,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {670#true} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {670#true} is VALID [2022-02-21 03:03:45,856 INFO L290 TraceCheckUtils]: 3: Hoare triple {670#true} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {672#(<= 0 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:03:45,856 INFO L290 TraceCheckUtils]: 4: Hoare triple {672#(<= 0 |ULTIMATE.start_main_~j~0#1|)} assume !!(main_~j~0#1 < main_~m~0#1); {672#(<= 0 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:03:45,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {672#(<= 0 |ULTIMATE.start_main_~j~0#1|)} assume 1 + main_~j~0#1 <= 2147483647; {672#(<= 0 |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:03:45,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {672#(<= 0 |ULTIMATE.start_main_~j~0#1|)} assume !(1 + main_~j~0#1 >= -2147483648); {671#false} is VALID [2022-02-21 03:03:45,857 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:45,857 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:45,857 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620120570] [2022-02-21 03:03:45,857 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620120570] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:45,857 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:45,858 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:03:45,858 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324949477] [2022-02-21 03:03:45,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:45,858 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:45,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:45,858 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:45,863 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:45,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:03:45,864 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:45,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:03:45,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:03:45,864 INFO L87 Difference]: Start difference. First operand 32 states and 38 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:45,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:45,894 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-02-21 03:03:45,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:03:45,894 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:45,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:45,895 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:45,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-02-21 03:03:45,895 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:45,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-02-21 03:03:45,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 26 transitions. [2022-02-21 03:03:45,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:45,914 INFO L225 Difference]: With dead ends: 32 [2022-02-21 03:03:45,914 INFO L226 Difference]: Without dead ends: 31 [2022-02-21 03:03:45,914 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:45,915 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 17 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 22 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:03:45,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 22 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:45,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-21 03:03:45,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-02-21 03:03:45,926 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:45,926 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 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:45,926 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 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:45,926 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 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:45,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:45,927 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2022-02-21 03:03:45,927 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-02-21 03:03:45,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:45,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:45,928 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 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 31 states. [2022-02-21 03:03:45,928 INFO L87 Difference]: Start difference. First operand has 31 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 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 31 states. [2022-02-21 03:03:45,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:45,928 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2022-02-21 03:03:45,928 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-02-21 03:03:45,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:45,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:45,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:45,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:45,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 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:45,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-02-21 03:03:45,930 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 7 [2022-02-21 03:03:45,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:45,930 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-02-21 03:03:45,930 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:45,930 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-02-21 03:03:45,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-21 03:03:45,930 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:45,930 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:45,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-21 03:03:45,931 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:03:45,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:45,931 INFO L85 PathProgramCache]: Analyzing trace with hash 124338035, now seen corresponding path program 1 times [2022-02-21 03:03:45,931 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:45,931 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780988851] [2022-02-21 03:03:45,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:45,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:45,956 INFO L290 TraceCheckUtils]: 0: Hoare triple {816#true} assume { :begin_inline_ULTIMATE.init } true; {816#true} is VALID [2022-02-21 03:03:45,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {816#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {818#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:03:45,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {818#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {818#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:03:45,957 INFO L290 TraceCheckUtils]: 3: Hoare triple {818#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {818#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:03:45,958 INFO L290 TraceCheckUtils]: 4: Hoare triple {818#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume !!(main_~j~0#1 < main_~m~0#1); {818#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:03:45,958 INFO L290 TraceCheckUtils]: 5: Hoare triple {818#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {818#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:03:45,958 INFO L290 TraceCheckUtils]: 6: Hoare triple {818#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {818#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:03:45,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {818#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume !(main_~N~0#1 - 1 <= 2147483647); {817#false} is VALID [2022-02-21 03:03:45,959 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:45,959 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:45,959 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780988851] [2022-02-21 03:03:45,959 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780988851] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:45,959 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:45,959 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:03:45,959 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108292762] [2022-02-21 03:03:45,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:45,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-21 03:03:45,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:45,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:45,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:45,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:03:45,966 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:45,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:03:45,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:03:45,966 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:45,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:45,997 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2022-02-21 03:03:45,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:03:45,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-21 03:03:45,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:45,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:45,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-02-21 03:03:45,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:45,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-02-21 03:03:45,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 24 transitions. [2022-02-21 03:03:46,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:46,016 INFO L225 Difference]: With dead ends: 31 [2022-02-21 03:03:46,016 INFO L226 Difference]: Without dead ends: 30 [2022-02-21 03:03:46,017 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:46,019 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 16 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:46,020 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 18 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:46,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-21 03:03:46,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-21 03:03:46,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:46,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 24 states have (on average 1.5) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 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:46,040 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 24 states have (on average 1.5) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 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:46,041 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 24 states have (on average 1.5) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 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:46,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:46,041 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-02-21 03:03:46,042 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-21 03:03:46,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:46,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:46,042 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 24 states have (on average 1.5) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 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 30 states. [2022-02-21 03:03:46,042 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.5) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 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 30 states. [2022-02-21 03:03:46,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:46,043 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-02-21 03:03:46,043 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-21 03:03:46,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:46,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:46,043 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:46,043 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:46,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.5) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 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:46,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-02-21 03:03:46,044 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 8 [2022-02-21 03:03:46,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:46,044 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-02-21 03:03:46,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:46,045 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-21 03:03:46,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-21 03:03:46,045 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:46,045 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:46,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-21 03:03:46,045 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:03:46,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:46,046 INFO L85 PathProgramCache]: Analyzing trace with hash -440488146, now seen corresponding path program 1 times [2022-02-21 03:03:46,046 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:46,046 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050210860] [2022-02-21 03:03:46,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:46,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:46,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {958#true} assume { :begin_inline_ULTIMATE.init } true; {958#true} is VALID [2022-02-21 03:03:46,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {958#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {958#true} is VALID [2022-02-21 03:03:46,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {958#true} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {960#(<= 0 |ULTIMATE.start_main_~N~0#1|)} is VALID [2022-02-21 03:03:46,088 INFO L290 TraceCheckUtils]: 3: Hoare triple {960#(<= 0 |ULTIMATE.start_main_~N~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {960#(<= 0 |ULTIMATE.start_main_~N~0#1|)} is VALID [2022-02-21 03:03:46,089 INFO L290 TraceCheckUtils]: 4: Hoare triple {960#(<= 0 |ULTIMATE.start_main_~N~0#1|)} assume !!(main_~j~0#1 < main_~m~0#1); {960#(<= 0 |ULTIMATE.start_main_~N~0#1|)} is VALID [2022-02-21 03:03:46,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {960#(<= 0 |ULTIMATE.start_main_~N~0#1|)} assume 1 + main_~j~0#1 <= 2147483647; {960#(<= 0 |ULTIMATE.start_main_~N~0#1|)} is VALID [2022-02-21 03:03:46,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {960#(<= 0 |ULTIMATE.start_main_~N~0#1|)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {960#(<= 0 |ULTIMATE.start_main_~N~0#1|)} is VALID [2022-02-21 03:03:46,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {960#(<= 0 |ULTIMATE.start_main_~N~0#1|)} assume main_~N~0#1 - 1 <= 2147483647; {960#(<= 0 |ULTIMATE.start_main_~N~0#1|)} is VALID [2022-02-21 03:03:46,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {960#(<= 0 |ULTIMATE.start_main_~N~0#1|)} assume !(main_~N~0#1 - 1 >= -2147483648); {959#false} is VALID [2022-02-21 03:03:46,091 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:46,091 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:46,091 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050210860] [2022-02-21 03:03:46,091 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050210860] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:46,091 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:46,091 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:03:46,091 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255595129] [2022-02-21 03:03:46,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:46,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-21 03:03:46,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:46,092 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:46,102 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:46,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:03:46,103 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:46,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:03:46,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:03:46,103 INFO L87 Difference]: Start difference. First operand 30 states and 36 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:46,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:46,146 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-02-21 03:03:46,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:03:46,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-21 03:03:46,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:46,147 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:46,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-02-21 03:03:46,148 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:46,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-02-21 03:03:46,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 23 transitions. [2022-02-21 03:03:46,162 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:46,162 INFO L225 Difference]: With dead ends: 30 [2022-02-21 03:03:46,162 INFO L226 Difference]: Without dead ends: 29 [2022-02-21 03:03:46,163 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:46,163 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 14 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:46,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 19 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:46,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-21 03:03:46,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-02-21 03:03:46,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:46,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 28 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:46,179 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 28 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:46,180 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 28 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:46,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:46,180 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-02-21 03:03:46,180 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-02-21 03:03:46,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:46,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:46,181 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 28 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) Second operand 29 states. [2022-02-21 03:03:46,181 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 28 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) Second operand 29 states. [2022-02-21 03:03:46,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:46,182 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-02-21 03:03:46,182 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-02-21 03:03:46,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:46,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:46,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:46,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:46,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 28 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:46,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-02-21 03:03:46,183 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 9 [2022-02-21 03:03:46,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:46,184 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-02-21 03:03:46,184 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:46,184 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-02-21 03:03:46,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-21 03:03:46,184 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:46,185 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:46,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-21 03:03:46,185 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:03:46,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:46,185 INFO L85 PathProgramCache]: Analyzing trace with hash -800814814, now seen corresponding path program 1 times [2022-02-21 03:03:46,186 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:46,186 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773888978] [2022-02-21 03:03:46,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:46,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:46,213 INFO L290 TraceCheckUtils]: 0: Hoare triple {1096#true} assume { :begin_inline_ULTIMATE.init } true; {1096#true} is VALID [2022-02-21 03:03:46,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {1096#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1096#true} is VALID [2022-02-21 03:03:46,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {1096#true} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {1098#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:46,216 INFO L290 TraceCheckUtils]: 3: Hoare triple {1098#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {1098#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:46,216 INFO L290 TraceCheckUtils]: 4: Hoare triple {1098#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~j~0#1 < main_~m~0#1); {1098#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:46,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {1098#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 1 + main_~i~0#1 <= 2147483647; {1098#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:46,218 INFO L290 TraceCheckUtils]: 6: Hoare triple {1098#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1; {1099#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:03:46,219 INFO L290 TraceCheckUtils]: 7: Hoare triple {1099#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {1099#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:03:46,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {1099#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~j~0#1 < main_~m~0#1); {1099#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:03:46,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {1099#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(1 + main_~i~0#1 <= 2147483647); {1097#false} is VALID [2022-02-21 03:03:46,220 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:46,220 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:46,220 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773888978] [2022-02-21 03:03:46,221 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773888978] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:03:46,221 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807467139] [2022-02-21 03:03:46,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:46,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:46,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:46,223 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:46,237 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:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:46,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:03:46,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:46,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:03:46,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {1096#true} assume { :begin_inline_ULTIMATE.init } true; {1096#true} is VALID [2022-02-21 03:03:46,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {1096#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1096#true} is VALID [2022-02-21 03:03:46,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {1096#true} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {1098#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:46,377 INFO L290 TraceCheckUtils]: 3: Hoare triple {1098#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {1098#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:46,377 INFO L290 TraceCheckUtils]: 4: Hoare triple {1098#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~j~0#1 < main_~m~0#1); {1098#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:46,378 INFO L290 TraceCheckUtils]: 5: Hoare triple {1098#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 1 + main_~i~0#1 <= 2147483647; {1098#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:46,378 INFO L290 TraceCheckUtils]: 6: Hoare triple {1098#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1; {1099#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:03:46,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {1099#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {1099#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:03:46,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {1099#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~j~0#1 < main_~m~0#1); {1099#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:03:46,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {1099#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(1 + main_~i~0#1 <= 2147483647); {1097#false} is VALID [2022-02-21 03:03:46,379 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:46,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:03:46,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {1130#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !(1 + main_~i~0#1 <= 2147483647); {1097#false} is VALID [2022-02-21 03:03:46,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {1130#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !(main_~j~0#1 < main_~m~0#1); {1130#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:03:46,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {1130#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {1130#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:03:46,437 INFO L290 TraceCheckUtils]: 6: Hoare triple {1140#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1; {1130#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:03:46,437 INFO L290 TraceCheckUtils]: 5: Hoare triple {1140#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume 1 + main_~i~0#1 <= 2147483647; {1140#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:03:46,437 INFO L290 TraceCheckUtils]: 4: Hoare triple {1140#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume !(main_~j~0#1 < main_~m~0#1); {1140#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:03:46,438 INFO L290 TraceCheckUtils]: 3: Hoare triple {1140#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {1140#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:03:46,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {1096#true} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {1140#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:03:46,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {1096#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1096#true} is VALID [2022-02-21 03:03:46,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {1096#true} assume { :begin_inline_ULTIMATE.init } true; {1096#true} is VALID [2022-02-21 03:03:46,438 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:46,439 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807467139] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:03:46,439 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:03:46,439 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-02-21 03:03:46,439 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959156676] [2022-02-21 03:03:46,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:03:46,439 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:46,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:46,440 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:46,453 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:46,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:03:46,453 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:46,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:03:46,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:03:46,454 INFO L87 Difference]: Start difference. First operand 29 states and 35 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:46,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:46,581 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2022-02-21 03:03:46,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:03:46,581 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:46,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:46,582 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:46,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2022-02-21 03:03:46,583 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:46,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2022-02-21 03:03:46,583 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 88 transitions. [2022-02-21 03:03:46,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:46,649 INFO L225 Difference]: With dead ends: 82 [2022-02-21 03:03:46,649 INFO L226 Difference]: Without dead ends: 81 [2022-02-21 03:03:46,649 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:46,650 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 79 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:46,650 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 76 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:46,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-02-21 03:03:46,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 41. [2022-02-21 03:03:46,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:46,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 41 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 40 states have internal predecessors, (50), 0 states have call successors, (0), 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:46,692 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 41 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 40 states have internal predecessors, (50), 0 states have call successors, (0), 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:46,693 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 41 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 40 states have internal predecessors, (50), 0 states have call successors, (0), 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:46,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:46,695 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2022-02-21 03:03:46,695 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2022-02-21 03:03:46,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:46,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:46,695 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 40 states have internal predecessors, (50), 0 states have call successors, (0), 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 81 states. [2022-02-21 03:03:46,695 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 40 states have internal predecessors, (50), 0 states have call successors, (0), 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 81 states. [2022-02-21 03:03:46,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:46,698 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2022-02-21 03:03:46,698 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2022-02-21 03:03:46,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:46,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:46,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:46,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:46,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 40 states have internal predecessors, (50), 0 states have call successors, (0), 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:46,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2022-02-21 03:03:46,700 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 10 [2022-02-21 03:03:46,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:46,700 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2022-02-21 03:03:46,700 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:46,701 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2022-02-21 03:03:46,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-21 03:03:46,701 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:46,701 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:46,720 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:46,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:46,920 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:03:46,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:46,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1892656240, now seen corresponding path program 1 times [2022-02-21 03:03:46,920 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:46,920 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872921869] [2022-02-21 03:03:46,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:46,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:46,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {1475#true} assume { :begin_inline_ULTIMATE.init } true; {1475#true} is VALID [2022-02-21 03:03:46,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {1475#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1475#true} is VALID [2022-02-21 03:03:46,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {1475#true} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {1477#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:46,966 INFO L290 TraceCheckUtils]: 3: Hoare triple {1477#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {1477#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:46,966 INFO L290 TraceCheckUtils]: 4: Hoare triple {1477#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~0#1 < main_~m~0#1); {1477#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:46,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {1477#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 1 + main_~j~0#1 <= 2147483647; {1477#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:46,967 INFO L290 TraceCheckUtils]: 6: Hoare triple {1477#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {1478#(<= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-21 03:03:46,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {1478#(<= |ULTIMATE.start_main_~k~0#1| 0)} assume main_~N~0#1 - 1 <= 2147483647; {1478#(<= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-21 03:03:46,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {1478#(<= |ULTIMATE.start_main_~k~0#1| 0)} assume main_~N~0#1 - 1 >= -2147483648; {1478#(<= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-21 03:03:46,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {1478#(<= |ULTIMATE.start_main_~k~0#1| 0)} assume !!(main_~k~0#1 < main_~N~0#1 - 1); {1478#(<= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-21 03:03:46,969 INFO L290 TraceCheckUtils]: 10: Hoare triple {1478#(<= |ULTIMATE.start_main_~k~0#1| 0)} assume !(1 + main_~k~0#1 <= 2147483647); {1476#false} is VALID [2022-02-21 03:03:46,969 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:46,969 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:46,969 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872921869] [2022-02-21 03:03:46,969 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872921869] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:46,969 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:46,969 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:03:46,969 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305036121] [2022-02-21 03:03:46,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:46,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-21 03:03:46,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:46,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:46,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:46,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:03:46,976 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:46,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:03:46,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:03:46,976 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:47,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:47,093 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2022-02-21 03:03:47,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:03:47,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-21 03:03:47,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:47,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:47,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-02-21 03:03:47,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:47,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-02-21 03:03:47,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-02-21 03:03:47,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:47,127 INFO L225 Difference]: With dead ends: 73 [2022-02-21 03:03:47,127 INFO L226 Difference]: Without dead ends: 71 [2022-02-21 03:03:47,127 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:03:47,129 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 36 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:47,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 45 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:47,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-02-21 03:03:47,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 51. [2022-02-21 03:03:47,173 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:47,173 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 51 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 50 states have internal predecessors, (63), 0 states have call successors, (0), 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:47,173 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 51 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 50 states have internal predecessors, (63), 0 states have call successors, (0), 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:47,173 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 51 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 50 states have internal predecessors, (63), 0 states have call successors, (0), 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:47,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:47,178 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2022-02-21 03:03:47,178 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2022-02-21 03:03:47,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:47,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:47,184 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 50 states have internal predecessors, (63), 0 states have call successors, (0), 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 71 states. [2022-02-21 03:03:47,184 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 50 states have internal predecessors, (63), 0 states have call successors, (0), 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 71 states. [2022-02-21 03:03:47,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:47,186 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2022-02-21 03:03:47,186 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2022-02-21 03:03:47,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:47,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:47,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:47,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:47,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 50 states have internal predecessors, (63), 0 states have call successors, (0), 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:47,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2022-02-21 03:03:47,187 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 11 [2022-02-21 03:03:47,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:47,187 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2022-02-21 03:03:47,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:47,187 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-02-21 03:03:47,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-21 03:03:47,188 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:47,188 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:47,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-21 03:03:47,188 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:03:47,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:47,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1457198630, now seen corresponding path program 1 times [2022-02-21 03:03:47,188 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:47,188 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390061402] [2022-02-21 03:03:47,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:47,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:47,223 INFO L290 TraceCheckUtils]: 0: Hoare triple {1784#true} assume { :begin_inline_ULTIMATE.init } true; {1784#true} is VALID [2022-02-21 03:03:47,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {1784#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1784#true} is VALID [2022-02-21 03:03:47,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {1784#true} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {1786#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:03:47,224 INFO L290 TraceCheckUtils]: 3: Hoare triple {1786#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {1786#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:03:47,224 INFO L290 TraceCheckUtils]: 4: Hoare triple {1786#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~j~0#1 < main_~m~0#1); {1786#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:03:47,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {1786#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume 1 + main_~j~0#1 <= 2147483647; {1786#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:03:47,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {1786#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {1787#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-21 03:03:47,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {1787#(<= 0 |ULTIMATE.start_main_~k~0#1|)} assume main_~N~0#1 - 1 <= 2147483647; {1787#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-21 03:03:47,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {1787#(<= 0 |ULTIMATE.start_main_~k~0#1|)} assume main_~N~0#1 - 1 >= -2147483648; {1787#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-21 03:03:47,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {1787#(<= 0 |ULTIMATE.start_main_~k~0#1|)} assume !!(main_~k~0#1 < main_~N~0#1 - 1); {1787#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-21 03:03:47,226 INFO L290 TraceCheckUtils]: 10: Hoare triple {1787#(<= 0 |ULTIMATE.start_main_~k~0#1|)} assume 1 + main_~k~0#1 <= 2147483647; {1787#(<= 0 |ULTIMATE.start_main_~k~0#1|)} is VALID [2022-02-21 03:03:47,226 INFO L290 TraceCheckUtils]: 11: Hoare triple {1787#(<= 0 |ULTIMATE.start_main_~k~0#1|)} assume !(1 + main_~k~0#1 >= -2147483648); {1785#false} is VALID [2022-02-21 03:03:47,227 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:47,227 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:47,227 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390061402] [2022-02-21 03:03:47,227 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390061402] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:47,227 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:47,227 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:03:47,227 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22518962] [2022-02-21 03:03:47,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:47,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-21 03:03:47,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:47,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:47,234 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:03:47,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:03:47,234 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:47,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:03:47,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:03:47,234 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:47,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:47,341 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2022-02-21 03:03:47,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:03:47,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-21 03:03:47,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:47,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:47,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-02-21 03:03:47,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:47,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-02-21 03:03:47,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 30 transitions. [2022-02-21 03:03:47,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:47,365 INFO L225 Difference]: With dead ends: 55 [2022-02-21 03:03:47,365 INFO L226 Difference]: Without dead ends: 53 [2022-02-21 03:03:47,365 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:03:47,365 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 21 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:47,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 18 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:47,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-02-21 03:03:47,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2022-02-21 03:03:47,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:47,405 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 44 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 43 states have internal predecessors, (54), 0 states have call successors, (0), 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:47,405 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 44 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 43 states have internal predecessors, (54), 0 states have call successors, (0), 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:47,406 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 44 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 43 states have internal predecessors, (54), 0 states have call successors, (0), 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:47,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:47,406 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2022-02-21 03:03:47,406 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2022-02-21 03:03:47,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:47,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:47,407 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 43 states have internal predecessors, (54), 0 states have call successors, (0), 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 53 states. [2022-02-21 03:03:47,407 INFO L87 Difference]: Start difference. First operand has 44 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 43 states have internal predecessors, (54), 0 states have call successors, (0), 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 53 states. [2022-02-21 03:03:47,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:47,407 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2022-02-21 03:03:47,408 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2022-02-21 03:03:47,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:47,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:47,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:47,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:47,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 43 states have internal predecessors, (54), 0 states have call successors, (0), 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:47,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2022-02-21 03:03:47,408 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 12 [2022-02-21 03:03:47,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:47,409 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2022-02-21 03:03:47,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:47,409 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2022-02-21 03:03:47,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-21 03:03:47,409 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:47,409 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:47,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-21 03:03:47,409 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:03:47,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:47,410 INFO L85 PathProgramCache]: Analyzing trace with hash 2071428314, now seen corresponding path program 1 times [2022-02-21 03:03:47,410 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:47,410 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328503884] [2022-02-21 03:03:47,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:47,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:47,453 INFO L290 TraceCheckUtils]: 0: Hoare triple {2027#true} assume { :begin_inline_ULTIMATE.init } true; {2027#true} is VALID [2022-02-21 03:03:47,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {2027#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2027#true} is VALID [2022-02-21 03:03:47,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {2027#true} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {2027#true} is VALID [2022-02-21 03:03:47,453 INFO L290 TraceCheckUtils]: 3: Hoare triple {2027#true} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {2029#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:03:47,454 INFO L290 TraceCheckUtils]: 4: Hoare triple {2029#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume !!(main_~j~0#1 < main_~m~0#1); {2029#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:03:47,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {2029#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume 1 + main_~j~0#1 <= 2147483647; {2029#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:03:47,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {2029#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {2030#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-21 03:03:47,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {2030#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume main_~N~0#1 - 1 <= 2147483647; {2030#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-21 03:03:47,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {2030#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume main_~N~0#1 - 1 >= -2147483648; {2030#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-21 03:03:47,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {2030#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {2030#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-21 03:03:47,457 INFO L290 TraceCheckUtils]: 10: Hoare triple {2030#(<= |ULTIMATE.start_main_~j~0#1| 1)} main_~i~0#1 := main_~k~0#1; {2030#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-21 03:03:47,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {2030#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume !!(main_~j~0#1 < main_~m~0#1); {2030#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-21 03:03:47,457 INFO L290 TraceCheckUtils]: 12: Hoare triple {2030#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume !(1 + main_~j~0#1 <= 2147483647); {2028#false} is VALID [2022-02-21 03:03:47,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:03:47,458 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:47,458 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328503884] [2022-02-21 03:03:47,458 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328503884] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:03:47,458 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453446969] [2022-02-21 03:03:47,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:47,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:47,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:47,461 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:47,463 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:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:47,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:03:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:47,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:03:47,539 INFO L290 TraceCheckUtils]: 0: Hoare triple {2027#true} assume { :begin_inline_ULTIMATE.init } true; {2027#true} is VALID [2022-02-21 03:03:47,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {2027#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2027#true} is VALID [2022-02-21 03:03:47,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {2027#true} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {2027#true} is VALID [2022-02-21 03:03:47,541 INFO L290 TraceCheckUtils]: 3: Hoare triple {2027#true} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {2029#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:03:47,541 INFO L290 TraceCheckUtils]: 4: Hoare triple {2029#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume !!(main_~j~0#1 < main_~m~0#1); {2029#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:03:47,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {2029#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume 1 + main_~j~0#1 <= 2147483647; {2029#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:03:47,563 INFO L290 TraceCheckUtils]: 6: Hoare triple {2029#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {2030#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-21 03:03:47,563 INFO L290 TraceCheckUtils]: 7: Hoare triple {2030#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume main_~N~0#1 - 1 <= 2147483647; {2030#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-21 03:03:47,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {2030#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume main_~N~0#1 - 1 >= -2147483648; {2030#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-21 03:03:47,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {2030#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {2030#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-21 03:03:47,565 INFO L290 TraceCheckUtils]: 10: Hoare triple {2030#(<= |ULTIMATE.start_main_~j~0#1| 1)} main_~i~0#1 := main_~k~0#1; {2030#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-21 03:03:47,565 INFO L290 TraceCheckUtils]: 11: Hoare triple {2030#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume !!(main_~j~0#1 < main_~m~0#1); {2030#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-21 03:03:47,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {2030#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume !(1 + main_~j~0#1 <= 2147483647); {2028#false} is VALID [2022-02-21 03:03:47,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:03:47,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:03:47,620 INFO L290 TraceCheckUtils]: 12: Hoare triple {2070#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} assume !(1 + main_~j~0#1 <= 2147483647); {2028#false} is VALID [2022-02-21 03:03:47,620 INFO L290 TraceCheckUtils]: 11: Hoare triple {2070#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} assume !!(main_~j~0#1 < main_~m~0#1); {2070#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} is VALID [2022-02-21 03:03:47,621 INFO L290 TraceCheckUtils]: 10: Hoare triple {2070#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} main_~i~0#1 := main_~k~0#1; {2070#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} is VALID [2022-02-21 03:03:47,621 INFO L290 TraceCheckUtils]: 9: Hoare triple {2070#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {2070#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} is VALID [2022-02-21 03:03:47,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {2070#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} assume main_~N~0#1 - 1 >= -2147483648; {2070#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} is VALID [2022-02-21 03:03:47,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {2070#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} assume main_~N~0#1 - 1 <= 2147483647; {2070#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} is VALID [2022-02-21 03:03:47,622 INFO L290 TraceCheckUtils]: 6: Hoare triple {2089#(<= |ULTIMATE.start_main_~j~0#1| 2147483645)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {2070#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} is VALID [2022-02-21 03:03:47,622 INFO L290 TraceCheckUtils]: 5: Hoare triple {2089#(<= |ULTIMATE.start_main_~j~0#1| 2147483645)} assume 1 + main_~j~0#1 <= 2147483647; {2089#(<= |ULTIMATE.start_main_~j~0#1| 2147483645)} is VALID [2022-02-21 03:03:47,623 INFO L290 TraceCheckUtils]: 4: Hoare triple {2089#(<= |ULTIMATE.start_main_~j~0#1| 2147483645)} assume !!(main_~j~0#1 < main_~m~0#1); {2089#(<= |ULTIMATE.start_main_~j~0#1| 2147483645)} is VALID [2022-02-21 03:03:47,624 INFO L290 TraceCheckUtils]: 3: Hoare triple {2027#true} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {2089#(<= |ULTIMATE.start_main_~j~0#1| 2147483645)} is VALID [2022-02-21 03:03:47,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {2027#true} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {2027#true} is VALID [2022-02-21 03:03:47,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {2027#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2027#true} is VALID [2022-02-21 03:03:47,624 INFO L290 TraceCheckUtils]: 0: Hoare triple {2027#true} assume { :begin_inline_ULTIMATE.init } true; {2027#true} is VALID [2022-02-21 03:03:47,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:03:47,625 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453446969] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:03:47,625 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:03:47,625 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-02-21 03:03:47,625 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217839834] [2022-02-21 03:03:47,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:03:47,625 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 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 13 [2022-02-21 03:03:47,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:47,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 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:47,639 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:47,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:03:47,639 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:47,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:03:47,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:03:47,640 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 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:47,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:47,844 INFO L93 Difference]: Finished difference Result 119 states and 146 transitions. [2022-02-21 03:03:47,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:03:47,845 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 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 13 [2022-02-21 03:03:47,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:47,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 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:47,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-02-21 03:03:47,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 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:47,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-02-21 03:03:47,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 78 transitions. [2022-02-21 03:03:47,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:47,914 INFO L225 Difference]: With dead ends: 119 [2022-02-21 03:03:47,914 INFO L226 Difference]: Without dead ends: 118 [2022-02-21 03:03:47,915 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 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:47,915 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 43 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:47,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 68 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:47,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-02-21 03:03:48,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 95. [2022-02-21 03:03:48,024 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:48,024 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 95 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 94 states have internal predecessors, (120), 0 states have call successors, (0), 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:48,024 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 95 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 94 states have internal predecessors, (120), 0 states have call successors, (0), 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:48,025 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 95 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 94 states have internal predecessors, (120), 0 states have call successors, (0), 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:48,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:48,028 INFO L93 Difference]: Finished difference Result 118 states and 140 transitions. [2022-02-21 03:03:48,028 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 140 transitions. [2022-02-21 03:03:48,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:48,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:48,028 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 94 states have internal predecessors, (120), 0 states have call successors, (0), 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 118 states. [2022-02-21 03:03:48,028 INFO L87 Difference]: Start difference. First operand has 95 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 94 states have internal predecessors, (120), 0 states have call successors, (0), 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 118 states. [2022-02-21 03:03:48,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:48,030 INFO L93 Difference]: Finished difference Result 118 states and 140 transitions. [2022-02-21 03:03:48,030 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 140 transitions. [2022-02-21 03:03:48,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:48,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:48,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:48,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:48,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 94 states have internal predecessors, (120), 0 states have call successors, (0), 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:48,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 120 transitions. [2022-02-21 03:03:48,040 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 120 transitions. Word has length 13 [2022-02-21 03:03:48,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:48,041 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 120 transitions. [2022-02-21 03:03:48,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 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:48,041 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 120 transitions. [2022-02-21 03:03:48,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-21 03:03:48,041 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:48,041 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:48,060 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:48,241 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,SelfDestructingSolverStorable10 [2022-02-21 03:03:48,242 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:03:48,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:48,242 INFO L85 PathProgramCache]: Analyzing trace with hash -109871847, now seen corresponding path program 1 times [2022-02-21 03:03:48,242 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:48,242 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415472664] [2022-02-21 03:03:48,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:48,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:48,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {2613#true} assume { :begin_inline_ULTIMATE.init } true; {2613#true} is VALID [2022-02-21 03:03:48,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {2613#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2615#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:03:48,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {2615#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {2615#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:03:48,284 INFO L290 TraceCheckUtils]: 3: Hoare triple {2615#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {2615#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:03:48,284 INFO L290 TraceCheckUtils]: 4: Hoare triple {2615#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume !(main_~j~0#1 < main_~m~0#1); {2615#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:03:48,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {2615#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume 1 + main_~i~0#1 <= 2147483647; {2615#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:03:48,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {2615#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1; {2615#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:03:48,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {2615#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {2615#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:03:48,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {2615#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume !!(main_~j~0#1 < main_~m~0#1); {2615#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:03:48,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {2615#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {2615#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:03:48,286 INFO L290 TraceCheckUtils]: 10: Hoare triple {2615#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {2615#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:03:48,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {2615#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume main_~N~0#1 - 1 <= 2147483647; {2615#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:03:48,286 INFO L290 TraceCheckUtils]: 12: Hoare triple {2615#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume main_~N~0#1 - 1 >= -2147483648; {2615#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:03:48,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {2615#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume !!(main_~k~0#1 < main_~N~0#1 - 1); {2616#(<= |ULTIMATE.start_main_~k~0#1| 2147483645)} is VALID [2022-02-21 03:03:48,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {2616#(<= |ULTIMATE.start_main_~k~0#1| 2147483645)} assume !(1 + main_~k~0#1 <= 2147483647); {2614#false} is VALID [2022-02-21 03:03:48,287 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:48,288 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:48,288 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415472664] [2022-02-21 03:03:48,288 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415472664] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:48,288 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:48,288 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:03:48,288 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532232988] [2022-02-21 03:03:48,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:48,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-21 03:03:48,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:48,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:48,306 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:48,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:03:48,307 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:48,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:03:48,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:03:48,307 INFO L87 Difference]: Start difference. First operand 95 states and 120 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:48,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:48,440 INFO L93 Difference]: Finished difference Result 95 states and 120 transitions. [2022-02-21 03:03:48,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:03:48,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-21 03:03:48,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:48,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:48,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2022-02-21 03:03:48,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:48,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2022-02-21 03:03:48,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 20 transitions. [2022-02-21 03:03:48,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:48,457 INFO L225 Difference]: With dead ends: 95 [2022-02-21 03:03:48,457 INFO L226 Difference]: Without dead ends: 94 [2022-02-21 03:03:48,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:03:48,458 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:48,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 22 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:48,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-02-21 03:03:48,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2022-02-21 03:03:48,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:48,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 90 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 89 states have internal predecessors, (112), 0 states have call successors, (0), 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:48,573 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 90 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 89 states have internal predecessors, (112), 0 states have call successors, (0), 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:48,574 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 90 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 89 states have internal predecessors, (112), 0 states have call successors, (0), 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:48,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:48,576 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2022-02-21 03:03:48,576 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-02-21 03:03:48,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:48,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:48,576 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 89 states have internal predecessors, (112), 0 states have call successors, (0), 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 94 states. [2022-02-21 03:03:48,576 INFO L87 Difference]: Start difference. First operand has 90 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 89 states have internal predecessors, (112), 0 states have call successors, (0), 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 94 states. [2022-02-21 03:03:48,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:48,578 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2022-02-21 03:03:48,578 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 116 transitions. [2022-02-21 03:03:48,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:48,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:48,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:48,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:48,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 89 states have internal predecessors, (112), 0 states have call successors, (0), 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:48,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 112 transitions. [2022-02-21 03:03:48,581 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 112 transitions. Word has length 15 [2022-02-21 03:03:48,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:48,581 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 112 transitions. [2022-02-21 03:03:48,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:48,581 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 112 transitions. [2022-02-21 03:03:48,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-21 03:03:48,581 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:48,581 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:48,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-21 03:03:48,582 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:03:48,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:48,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1787285281, now seen corresponding path program 1 times [2022-02-21 03:03:48,582 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:48,582 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201967301] [2022-02-21 03:03:48,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:48,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:48,634 INFO L290 TraceCheckUtils]: 0: Hoare triple {3046#true} assume { :begin_inline_ULTIMATE.init } true; {3046#true} is VALID [2022-02-21 03:03:48,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {3046#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {3046#true} is VALID [2022-02-21 03:03:48,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {3046#true} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {3046#true} is VALID [2022-02-21 03:03:48,635 INFO L290 TraceCheckUtils]: 3: Hoare triple {3046#true} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {3048#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:03:48,635 INFO L290 TraceCheckUtils]: 4: Hoare triple {3048#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume !(main_~j~0#1 < main_~m~0#1); {3049#(<= |ULTIMATE.start_main_~m~0#1| 0)} is VALID [2022-02-21 03:03:48,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {3049#(<= |ULTIMATE.start_main_~m~0#1| 0)} assume 1 + main_~i~0#1 <= 2147483647; {3049#(<= |ULTIMATE.start_main_~m~0#1| 0)} is VALID [2022-02-21 03:03:48,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {3049#(<= |ULTIMATE.start_main_~m~0#1| 0)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1; {3049#(<= |ULTIMATE.start_main_~m~0#1| 0)} is VALID [2022-02-21 03:03:48,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {3049#(<= |ULTIMATE.start_main_~m~0#1| 0)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {3050#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:03:48,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {3050#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~j~0#1|)} assume !!(main_~j~0#1 < main_~m~0#1); {3047#false} is VALID [2022-02-21 03:03:48,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {3047#false} assume 1 + main_~j~0#1 <= 2147483647; {3047#false} is VALID [2022-02-21 03:03:48,637 INFO L290 TraceCheckUtils]: 10: Hoare triple {3047#false} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {3047#false} is VALID [2022-02-21 03:03:48,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {3047#false} assume main_~N~0#1 - 1 <= 2147483647; {3047#false} is VALID [2022-02-21 03:03:48,637 INFO L290 TraceCheckUtils]: 12: Hoare triple {3047#false} assume main_~N~0#1 - 1 >= -2147483648; {3047#false} is VALID [2022-02-21 03:03:48,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {3047#false} assume !(main_~k~0#1 < main_~N~0#1 - 1); {3047#false} is VALID [2022-02-21 03:03:48,637 INFO L290 TraceCheckUtils]: 14: Hoare triple {3047#false} main_~i~0#1 := main_~k~0#1; {3047#false} is VALID [2022-02-21 03:03:48,637 INFO L290 TraceCheckUtils]: 15: Hoare triple {3047#false} assume !(main_~j~0#1 < main_~m~0#1); {3047#false} is VALID [2022-02-21 03:03:48,637 INFO L290 TraceCheckUtils]: 16: Hoare triple {3047#false} assume !(1 + main_~i~0#1 <= 2147483647); {3047#false} is VALID [2022-02-21 03:03:48,637 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:03:48,637 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:48,637 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201967301] [2022-02-21 03:03:48,637 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201967301] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:03:48,637 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552252533] [2022-02-21 03:03:48,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:48,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:48,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:48,652 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:48,653 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:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:48,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:03:48,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:48,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:03:48,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {3046#true} assume { :begin_inline_ULTIMATE.init } true; {3046#true} is VALID [2022-02-21 03:03:48,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {3046#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {3046#true} is VALID [2022-02-21 03:03:48,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {3046#true} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {3046#true} is VALID [2022-02-21 03:03:48,769 INFO L290 TraceCheckUtils]: 3: Hoare triple {3046#true} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {3048#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:03:48,769 INFO L290 TraceCheckUtils]: 4: Hoare triple {3048#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume !(main_~j~0#1 < main_~m~0#1); {3049#(<= |ULTIMATE.start_main_~m~0#1| 0)} is VALID [2022-02-21 03:03:48,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {3049#(<= |ULTIMATE.start_main_~m~0#1| 0)} assume 1 + main_~i~0#1 <= 2147483647; {3049#(<= |ULTIMATE.start_main_~m~0#1| 0)} is VALID [2022-02-21 03:03:48,771 INFO L290 TraceCheckUtils]: 6: Hoare triple {3049#(<= |ULTIMATE.start_main_~m~0#1| 0)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1; {3049#(<= |ULTIMATE.start_main_~m~0#1| 0)} is VALID [2022-02-21 03:03:48,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {3049#(<= |ULTIMATE.start_main_~m~0#1| 0)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {3075#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~m~0#1| 0))} is VALID [2022-02-21 03:03:48,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {3075#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~m~0#1| 0))} assume !!(main_~j~0#1 < main_~m~0#1); {3047#false} is VALID [2022-02-21 03:03:48,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {3047#false} assume 1 + main_~j~0#1 <= 2147483647; {3047#false} is VALID [2022-02-21 03:03:48,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {3047#false} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {3047#false} is VALID [2022-02-21 03:03:48,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {3047#false} assume main_~N~0#1 - 1 <= 2147483647; {3047#false} is VALID [2022-02-21 03:03:48,772 INFO L290 TraceCheckUtils]: 12: Hoare triple {3047#false} assume main_~N~0#1 - 1 >= -2147483648; {3047#false} is VALID [2022-02-21 03:03:48,772 INFO L290 TraceCheckUtils]: 13: Hoare triple {3047#false} assume !(main_~k~0#1 < main_~N~0#1 - 1); {3047#false} is VALID [2022-02-21 03:03:48,772 INFO L290 TraceCheckUtils]: 14: Hoare triple {3047#false} main_~i~0#1 := main_~k~0#1; {3047#false} is VALID [2022-02-21 03:03:48,772 INFO L290 TraceCheckUtils]: 15: Hoare triple {3047#false} assume !(main_~j~0#1 < main_~m~0#1); {3047#false} is VALID [2022-02-21 03:03:48,772 INFO L290 TraceCheckUtils]: 16: Hoare triple {3047#false} assume !(1 + main_~i~0#1 <= 2147483647); {3047#false} is VALID [2022-02-21 03:03:48,773 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:03:48,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:03:48,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {3047#false} assume !(1 + main_~i~0#1 <= 2147483647); {3047#false} is VALID [2022-02-21 03:03:48,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {3047#false} assume !(main_~j~0#1 < main_~m~0#1); {3047#false} is VALID [2022-02-21 03:03:48,844 INFO L290 TraceCheckUtils]: 14: Hoare triple {3047#false} main_~i~0#1 := main_~k~0#1; {3047#false} is VALID [2022-02-21 03:03:48,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {3047#false} assume !(main_~k~0#1 < main_~N~0#1 - 1); {3047#false} is VALID [2022-02-21 03:03:48,844 INFO L290 TraceCheckUtils]: 12: Hoare triple {3047#false} assume main_~N~0#1 - 1 >= -2147483648; {3047#false} is VALID [2022-02-21 03:03:48,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {3047#false} assume main_~N~0#1 - 1 <= 2147483647; {3047#false} is VALID [2022-02-21 03:03:48,845 INFO L290 TraceCheckUtils]: 10: Hoare triple {3047#false} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {3047#false} is VALID [2022-02-21 03:03:48,845 INFO L290 TraceCheckUtils]: 9: Hoare triple {3047#false} assume 1 + main_~j~0#1 <= 2147483647; {3047#false} is VALID [2022-02-21 03:03:48,845 INFO L290 TraceCheckUtils]: 8: Hoare triple {3050#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~j~0#1|)} assume !!(main_~j~0#1 < main_~m~0#1); {3047#false} is VALID [2022-02-21 03:03:48,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {3049#(<= |ULTIMATE.start_main_~m~0#1| 0)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {3050#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:03:48,846 INFO L290 TraceCheckUtils]: 6: Hoare triple {3049#(<= |ULTIMATE.start_main_~m~0#1| 0)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1; {3049#(<= |ULTIMATE.start_main_~m~0#1| 0)} is VALID [2022-02-21 03:03:48,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {3049#(<= |ULTIMATE.start_main_~m~0#1| 0)} assume 1 + main_~i~0#1 <= 2147483647; {3049#(<= |ULTIMATE.start_main_~m~0#1| 0)} is VALID [2022-02-21 03:03:48,847 INFO L290 TraceCheckUtils]: 4: Hoare triple {3048#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume !(main_~j~0#1 < main_~m~0#1); {3049#(<= |ULTIMATE.start_main_~m~0#1| 0)} is VALID [2022-02-21 03:03:48,847 INFO L290 TraceCheckUtils]: 3: Hoare triple {3046#true} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {3048#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:03:48,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {3046#true} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {3046#true} is VALID [2022-02-21 03:03:48,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {3046#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {3046#true} is VALID [2022-02-21 03:03:48,847 INFO L290 TraceCheckUtils]: 0: Hoare triple {3046#true} assume { :begin_inline_ULTIMATE.init } true; {3046#true} is VALID [2022-02-21 03:03:48,847 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:03:48,848 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552252533] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:03:48,848 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:03:48,848 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-02-21 03:03:48,848 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647145230] [2022-02-21 03:03:48,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:03:48,848 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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) Word has length 17 [2022-02-21 03:03:48,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:48,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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:48,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:48,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:03:48,862 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:48,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:03:48,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:03:48,862 INFO L87 Difference]: Start difference. First operand 90 states and 112 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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:49,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:49,041 INFO L93 Difference]: Finished difference Result 143 states and 175 transitions. [2022-02-21 03:03:49,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:03:49,041 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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) Word has length 17 [2022-02-21 03:03:49,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:49,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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:49,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2022-02-21 03:03:49,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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:49,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2022-02-21 03:03:49,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 50 transitions. [2022-02-21 03:03:49,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:49,076 INFO L225 Difference]: With dead ends: 143 [2022-02-21 03:03:49,076 INFO L226 Difference]: Without dead ends: 100 [2022-02-21 03:03:49,076 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:03:49,077 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 18 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:49,077 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 57 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:49,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-02-21 03:03:49,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2022-02-21 03:03:49,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:49,178 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 95 states, 93 states have (on average 1.2365591397849462) internal successors, (115), 94 states have internal predecessors, (115), 0 states have call successors, (0), 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:49,178 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 95 states, 93 states have (on average 1.2365591397849462) internal successors, (115), 94 states have internal predecessors, (115), 0 states have call successors, (0), 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:49,179 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 95 states, 93 states have (on average 1.2365591397849462) internal successors, (115), 94 states have internal predecessors, (115), 0 states have call successors, (0), 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:49,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:49,180 INFO L93 Difference]: Finished difference Result 100 states and 119 transitions. [2022-02-21 03:03:49,180 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2022-02-21 03:03:49,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:49,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:49,181 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 93 states have (on average 1.2365591397849462) internal successors, (115), 94 states have internal predecessors, (115), 0 states have call successors, (0), 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 100 states. [2022-02-21 03:03:49,181 INFO L87 Difference]: Start difference. First operand has 95 states, 93 states have (on average 1.2365591397849462) internal successors, (115), 94 states have internal predecessors, (115), 0 states have call successors, (0), 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 100 states. [2022-02-21 03:03:49,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:49,182 INFO L93 Difference]: Finished difference Result 100 states and 119 transitions. [2022-02-21 03:03:49,182 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2022-02-21 03:03:49,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:49,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:49,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:49,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:49,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 93 states have (on average 1.2365591397849462) internal successors, (115), 94 states have internal predecessors, (115), 0 states have call successors, (0), 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:49,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 115 transitions. [2022-02-21 03:03:49,184 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 115 transitions. Word has length 17 [2022-02-21 03:03:49,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:49,185 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 115 transitions. [2022-02-21 03:03:49,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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:49,185 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 115 transitions. [2022-02-21 03:03:49,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-21 03:03:49,185 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:49,185 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:49,202 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:49,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:49,406 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:03:49,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:49,407 INFO L85 PathProgramCache]: Analyzing trace with hash -979259409, now seen corresponding path program 2 times [2022-02-21 03:03:49,407 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:49,407 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774380317] [2022-02-21 03:03:49,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:49,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:49,440 INFO L290 TraceCheckUtils]: 0: Hoare triple {3659#true} assume { :begin_inline_ULTIMATE.init } true; {3659#true} is VALID [2022-02-21 03:03:49,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {3659#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:49,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:49,442 INFO L290 TraceCheckUtils]: 3: Hoare triple {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:49,442 INFO L290 TraceCheckUtils]: 4: Hoare triple {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~j~0#1 < main_~m~0#1); {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:49,442 INFO L290 TraceCheckUtils]: 5: Hoare triple {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:49,442 INFO L290 TraceCheckUtils]: 6: Hoare triple {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:49,443 INFO L290 TraceCheckUtils]: 7: Hoare triple {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~N~0#1 - 1 <= 2147483647; {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:49,443 INFO L290 TraceCheckUtils]: 8: Hoare triple {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~N~0#1 - 1 >= -2147483648; {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:49,443 INFO L290 TraceCheckUtils]: 9: Hoare triple {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:49,444 INFO L290 TraceCheckUtils]: 10: Hoare triple {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} main_~i~0#1 := main_~k~0#1; {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:49,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !(main_~j~0#1 < main_~m~0#1); {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:49,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~i~0#1 <= 2147483647; {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:49,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1; {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:49,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {3662#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:03:49,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {3662#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !(main_~j~0#1 < main_~m~0#1); {3662#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:03:49,445 INFO L290 TraceCheckUtils]: 16: Hoare triple {3662#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !(1 + main_~i~0#1 <= 2147483647); {3660#false} is VALID [2022-02-21 03:03:49,446 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:03:49,446 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:49,446 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774380317] [2022-02-21 03:03:49,446 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774380317] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:03:49,446 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766161284] [2022-02-21 03:03:49,446 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:03:49,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:49,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:49,448 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:49,448 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:49,471 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-21 03:03:49,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:03:49,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:03:49,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:49,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:03:49,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {3659#true} assume { :begin_inline_ULTIMATE.init } true; {3659#true} is VALID [2022-02-21 03:03:49,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {3659#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:49,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:49,543 INFO L290 TraceCheckUtils]: 3: Hoare triple {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:49,543 INFO L290 TraceCheckUtils]: 4: Hoare triple {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~j~0#1 < main_~m~0#1); {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:49,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:49,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:49,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~N~0#1 - 1 <= 2147483647; {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:49,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~N~0#1 - 1 >= -2147483648; {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:49,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:49,545 INFO L290 TraceCheckUtils]: 10: Hoare triple {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} main_~i~0#1 := main_~k~0#1; {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:49,545 INFO L290 TraceCheckUtils]: 11: Hoare triple {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !(main_~j~0#1 < main_~m~0#1); {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:49,545 INFO L290 TraceCheckUtils]: 12: Hoare triple {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~i~0#1 <= 2147483647; {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:49,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1; {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:49,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {3662#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:03:49,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {3662#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !(main_~j~0#1 < main_~m~0#1); {3662#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:03:49,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {3662#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !(1 + main_~i~0#1 <= 2147483647); {3660#false} is VALID [2022-02-21 03:03:49,547 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:03:49,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:03:49,620 INFO L290 TraceCheckUtils]: 16: Hoare triple {3662#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !(1 + main_~i~0#1 <= 2147483647); {3660#false} is VALID [2022-02-21 03:03:49,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {3662#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !(main_~j~0#1 < main_~m~0#1); {3662#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:03:49,625 INFO L290 TraceCheckUtils]: 14: Hoare triple {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {3662#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:03:49,625 INFO L290 TraceCheckUtils]: 13: Hoare triple {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1; {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:49,626 INFO L290 TraceCheckUtils]: 12: Hoare triple {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~i~0#1 <= 2147483647; {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:49,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !(main_~j~0#1 < main_~m~0#1); {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:49,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} main_~i~0#1 := main_~k~0#1; {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:49,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:49,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~N~0#1 - 1 >= -2147483648; {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:49,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~N~0#1 - 1 <= 2147483647; {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:49,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:49,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:49,628 INFO L290 TraceCheckUtils]: 4: Hoare triple {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~j~0#1 < main_~m~0#1); {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:49,628 INFO L290 TraceCheckUtils]: 3: Hoare triple {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:49,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:49,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {3659#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {3661#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:03:49,629 INFO L290 TraceCheckUtils]: 0: Hoare triple {3659#true} assume { :begin_inline_ULTIMATE.init } true; {3659#true} is VALID [2022-02-21 03:03:49,629 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:03:49,629 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766161284] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:03:49,629 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:03:49,629 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2022-02-21 03:03:49,630 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559361676] [2022-02-21 03:03:49,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:03:49,630 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 17 [2022-02-21 03:03:49,630 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:49,630 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:03:49,640 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:03:49,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:03:49,640 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:49,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:03:49,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:03:49,641 INFO L87 Difference]: Start difference. First operand 95 states and 115 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:03:49,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:49,784 INFO L93 Difference]: Finished difference Result 96 states and 115 transitions. [2022-02-21 03:03:49,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:03:49,784 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 17 [2022-02-21 03:03:49,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:49,784 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:03:49,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-02-21 03:03:49,785 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:03:49,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-02-21 03:03:49,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 33 transitions. [2022-02-21 03:03:49,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:49,805 INFO L225 Difference]: With dead ends: 96 [2022-02-21 03:03:49,805 INFO L226 Difference]: Without dead ends: 78 [2022-02-21 03:03:49,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 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:49,806 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:49,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 26 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:49,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-02-21 03:03:49,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-02-21 03:03:49,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:49,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 78 states, 76 states have (on average 1.25) internal successors, (95), 77 states have internal predecessors, (95), 0 states have call successors, (0), 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:49,882 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 78 states, 76 states have (on average 1.25) internal successors, (95), 77 states have internal predecessors, (95), 0 states have call successors, (0), 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:49,882 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 78 states, 76 states have (on average 1.25) internal successors, (95), 77 states have internal predecessors, (95), 0 states have call successors, (0), 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:49,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:49,883 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2022-02-21 03:03:49,883 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2022-02-21 03:03:49,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:49,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:49,884 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 76 states have (on average 1.25) internal successors, (95), 77 states have internal predecessors, (95), 0 states have call successors, (0), 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 78 states. [2022-02-21 03:03:49,884 INFO L87 Difference]: Start difference. First operand has 78 states, 76 states have (on average 1.25) internal successors, (95), 77 states have internal predecessors, (95), 0 states have call successors, (0), 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 78 states. [2022-02-21 03:03:49,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:49,885 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2022-02-21 03:03:49,885 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2022-02-21 03:03:49,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:49,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:49,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:49,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:49,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 76 states have (on average 1.25) internal successors, (95), 77 states have internal predecessors, (95), 0 states have call successors, (0), 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:49,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 95 transitions. [2022-02-21 03:03:49,886 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 95 transitions. Word has length 17 [2022-02-21 03:03:49,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:49,887 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 95 transitions. [2022-02-21 03:03:49,887 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:03:49,887 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2022-02-21 03:03:49,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-21 03:03:49,887 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:49,887 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:49,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:03:50,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:50,104 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:03:50,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:50,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1163262406, now seen corresponding path program 1 times [2022-02-21 03:03:50,105 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:50,105 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165164090] [2022-02-21 03:03:50,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:50,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:50,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:50,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {4141#true} assume { :begin_inline_ULTIMATE.init } true; {4141#true} is VALID [2022-02-21 03:03:50,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {4141#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {4141#true} is VALID [2022-02-21 03:03:50,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {4141#true} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {4143#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:50,153 INFO L290 TraceCheckUtils]: 3: Hoare triple {4143#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {4143#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:50,153 INFO L290 TraceCheckUtils]: 4: Hoare triple {4143#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~0#1 < main_~m~0#1); {4143#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:50,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {4143#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 1 + main_~j~0#1 <= 2147483647; {4143#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:50,154 INFO L290 TraceCheckUtils]: 6: Hoare triple {4143#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {4144#(<= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-21 03:03:50,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {4144#(<= |ULTIMATE.start_main_~k~0#1| 0)} assume main_~N~0#1 - 1 <= 2147483647; {4144#(<= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-21 03:03:50,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {4144#(<= |ULTIMATE.start_main_~k~0#1| 0)} assume main_~N~0#1 - 1 >= -2147483648; {4144#(<= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-21 03:03:50,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {4144#(<= |ULTIMATE.start_main_~k~0#1| 0)} assume !!(main_~k~0#1 < main_~N~0#1 - 1); {4144#(<= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-21 03:03:50,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {4144#(<= |ULTIMATE.start_main_~k~0#1| 0)} assume 1 + main_~k~0#1 <= 2147483647; {4144#(<= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-21 03:03:50,155 INFO L290 TraceCheckUtils]: 11: Hoare triple {4144#(<= |ULTIMATE.start_main_~k~0#1| 0)} assume 1 + main_~k~0#1 >= -2147483648;main_~k~0#1 := 1 + main_~k~0#1; {4145#(<= |ULTIMATE.start_main_~k~0#1| 1)} is VALID [2022-02-21 03:03:50,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {4145#(<= |ULTIMATE.start_main_~k~0#1| 1)} assume main_~N~0#1 - 1 <= 2147483647; {4145#(<= |ULTIMATE.start_main_~k~0#1| 1)} is VALID [2022-02-21 03:03:50,156 INFO L290 TraceCheckUtils]: 13: Hoare triple {4145#(<= |ULTIMATE.start_main_~k~0#1| 1)} assume main_~N~0#1 - 1 >= -2147483648; {4145#(<= |ULTIMATE.start_main_~k~0#1| 1)} is VALID [2022-02-21 03:03:50,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {4145#(<= |ULTIMATE.start_main_~k~0#1| 1)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {4145#(<= |ULTIMATE.start_main_~k~0#1| 1)} is VALID [2022-02-21 03:03:50,157 INFO L290 TraceCheckUtils]: 15: Hoare triple {4145#(<= |ULTIMATE.start_main_~k~0#1| 1)} main_~i~0#1 := main_~k~0#1; {4146#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:03:50,157 INFO L290 TraceCheckUtils]: 16: Hoare triple {4146#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~j~0#1 < main_~m~0#1); {4146#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:03:50,157 INFO L290 TraceCheckUtils]: 17: Hoare triple {4146#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(1 + main_~i~0#1 <= 2147483647); {4142#false} is VALID [2022-02-21 03:03:50,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:03:50,158 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:50,158 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165164090] [2022-02-21 03:03:50,158 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165164090] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:03:50,158 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237245775] [2022-02-21 03:03:50,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:50,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:50,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:50,159 INFO L229 MonitoredProcess]: Starting monitored process 6 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:50,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-21 03:03:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:50,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:03:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:50,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:03:50,287 INFO L290 TraceCheckUtils]: 0: Hoare triple {4141#true} assume { :begin_inline_ULTIMATE.init } true; {4141#true} is VALID [2022-02-21 03:03:50,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {4141#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {4153#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:03:50,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {4153#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {4153#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:03:50,288 INFO L290 TraceCheckUtils]: 3: Hoare triple {4153#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {4153#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:03:50,288 INFO L290 TraceCheckUtils]: 4: Hoare triple {4153#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume !!(main_~j~0#1 < main_~m~0#1); {4153#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:03:50,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {4153#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {4153#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:03:50,289 INFO L290 TraceCheckUtils]: 6: Hoare triple {4153#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {4153#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:03:50,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {4153#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume main_~N~0#1 - 1 <= 2147483647; {4153#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:03:50,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {4153#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume main_~N~0#1 - 1 >= -2147483648; {4153#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:03:50,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {4153#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume !!(main_~k~0#1 < main_~N~0#1 - 1); {4178#(< |ULTIMATE.start_main_~k~0#1| 2147483646)} is VALID [2022-02-21 03:03:50,290 INFO L290 TraceCheckUtils]: 10: Hoare triple {4178#(< |ULTIMATE.start_main_~k~0#1| 2147483646)} assume 1 + main_~k~0#1 <= 2147483647; {4178#(< |ULTIMATE.start_main_~k~0#1| 2147483646)} is VALID [2022-02-21 03:03:50,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {4178#(< |ULTIMATE.start_main_~k~0#1| 2147483646)} assume 1 + main_~k~0#1 >= -2147483648;main_~k~0#1 := 1 + main_~k~0#1; {4185#(< |ULTIMATE.start_main_~k~0#1| 2147483647)} is VALID [2022-02-21 03:03:50,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {4185#(< |ULTIMATE.start_main_~k~0#1| 2147483647)} assume main_~N~0#1 - 1 <= 2147483647; {4185#(< |ULTIMATE.start_main_~k~0#1| 2147483647)} is VALID [2022-02-21 03:03:50,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {4185#(< |ULTIMATE.start_main_~k~0#1| 2147483647)} assume main_~N~0#1 - 1 >= -2147483648; {4185#(< |ULTIMATE.start_main_~k~0#1| 2147483647)} is VALID [2022-02-21 03:03:50,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {4185#(< |ULTIMATE.start_main_~k~0#1| 2147483647)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {4185#(< |ULTIMATE.start_main_~k~0#1| 2147483647)} is VALID [2022-02-21 03:03:50,292 INFO L290 TraceCheckUtils]: 15: Hoare triple {4185#(< |ULTIMATE.start_main_~k~0#1| 2147483647)} main_~i~0#1 := main_~k~0#1; {4198#(< |ULTIMATE.start_main_~i~0#1| 2147483647)} is VALID [2022-02-21 03:03:50,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {4198#(< |ULTIMATE.start_main_~i~0#1| 2147483647)} assume !(main_~j~0#1 < main_~m~0#1); {4198#(< |ULTIMATE.start_main_~i~0#1| 2147483647)} is VALID [2022-02-21 03:03:50,293 INFO L290 TraceCheckUtils]: 17: Hoare triple {4198#(< |ULTIMATE.start_main_~i~0#1| 2147483647)} assume !(1 + main_~i~0#1 <= 2147483647); {4142#false} is VALID [2022-02-21 03:03:50,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:03:50,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:03:50,377 INFO L290 TraceCheckUtils]: 17: Hoare triple {4198#(< |ULTIMATE.start_main_~i~0#1| 2147483647)} assume !(1 + main_~i~0#1 <= 2147483647); {4142#false} is VALID [2022-02-21 03:03:50,377 INFO L290 TraceCheckUtils]: 16: Hoare triple {4198#(< |ULTIMATE.start_main_~i~0#1| 2147483647)} assume !(main_~j~0#1 < main_~m~0#1); {4198#(< |ULTIMATE.start_main_~i~0#1| 2147483647)} is VALID [2022-02-21 03:03:50,378 INFO L290 TraceCheckUtils]: 15: Hoare triple {4185#(< |ULTIMATE.start_main_~k~0#1| 2147483647)} main_~i~0#1 := main_~k~0#1; {4198#(< |ULTIMATE.start_main_~i~0#1| 2147483647)} is VALID [2022-02-21 03:03:50,378 INFO L290 TraceCheckUtils]: 14: Hoare triple {4185#(< |ULTIMATE.start_main_~k~0#1| 2147483647)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {4185#(< |ULTIMATE.start_main_~k~0#1| 2147483647)} is VALID [2022-02-21 03:03:50,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {4185#(< |ULTIMATE.start_main_~k~0#1| 2147483647)} assume main_~N~0#1 - 1 >= -2147483648; {4185#(< |ULTIMATE.start_main_~k~0#1| 2147483647)} is VALID [2022-02-21 03:03:50,379 INFO L290 TraceCheckUtils]: 12: Hoare triple {4185#(< |ULTIMATE.start_main_~k~0#1| 2147483647)} assume main_~N~0#1 - 1 <= 2147483647; {4185#(< |ULTIMATE.start_main_~k~0#1| 2147483647)} is VALID [2022-02-21 03:03:50,379 INFO L290 TraceCheckUtils]: 11: Hoare triple {4178#(< |ULTIMATE.start_main_~k~0#1| 2147483646)} assume 1 + main_~k~0#1 >= -2147483648;main_~k~0#1 := 1 + main_~k~0#1; {4185#(< |ULTIMATE.start_main_~k~0#1| 2147483647)} is VALID [2022-02-21 03:03:50,380 INFO L290 TraceCheckUtils]: 10: Hoare triple {4178#(< |ULTIMATE.start_main_~k~0#1| 2147483646)} assume 1 + main_~k~0#1 <= 2147483647; {4178#(< |ULTIMATE.start_main_~k~0#1| 2147483646)} is VALID [2022-02-21 03:03:50,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {4153#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume !!(main_~k~0#1 < main_~N~0#1 - 1); {4178#(< |ULTIMATE.start_main_~k~0#1| 2147483646)} is VALID [2022-02-21 03:03:50,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {4153#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume main_~N~0#1 - 1 >= -2147483648; {4153#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:03:50,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {4153#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume main_~N~0#1 - 1 <= 2147483647; {4153#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:03:50,382 INFO L290 TraceCheckUtils]: 6: Hoare triple {4153#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {4153#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:03:50,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {4153#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {4153#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:03:50,383 INFO L290 TraceCheckUtils]: 4: Hoare triple {4153#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume !!(main_~j~0#1 < main_~m~0#1); {4153#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:03:50,383 INFO L290 TraceCheckUtils]: 3: Hoare triple {4153#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {4153#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:03:50,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {4153#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {4153#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:03:50,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {4141#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {4153#(<= |ULTIMATE.start_main_~N~0#1| 2147483647)} is VALID [2022-02-21 03:03:50,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {4141#true} assume { :begin_inline_ULTIMATE.init } true; {4141#true} is VALID [2022-02-21 03:03:50,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:03:50,384 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237245775] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:03:50,384 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:03:50,384 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-02-21 03:03:50,385 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143185942] [2022-02-21 03:03:50,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:03:50,385 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 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 18 [2022-02-21 03:03:50,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:50,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 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:50,410 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:50,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-21 03:03:50,410 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:50,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-21 03:03:50,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-02-21 03:03:50,410 INFO L87 Difference]: Start difference. First operand 78 states and 95 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 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:51,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:51,138 INFO L93 Difference]: Finished difference Result 315 states and 377 transitions. [2022-02-21 03:03:51,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-21 03:03:51,138 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 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 18 [2022-02-21 03:03:51,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:51,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 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:51,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 127 transitions. [2022-02-21 03:03:51,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 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:51,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 127 transitions. [2022-02-21 03:03:51,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 127 transitions. [2022-02-21 03:03:51,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:51,221 INFO L225 Difference]: With dead ends: 315 [2022-02-21 03:03:51,221 INFO L226 Difference]: Without dead ends: 314 [2022-02-21 03:03:51,222 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=206, Invalid=394, Unknown=0, NotChecked=0, Total=600 [2022-02-21 03:03:51,222 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 230 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:51,222 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [230 Valid, 48 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:03:51,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2022-02-21 03:03:51,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 152. [2022-02-21 03:03:51,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:51,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 314 states. Second operand has 152 states, 150 states have (on average 1.2466666666666666) internal successors, (187), 151 states have internal predecessors, (187), 0 states have call successors, (0), 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:51,410 INFO L74 IsIncluded]: Start isIncluded. First operand 314 states. Second operand has 152 states, 150 states have (on average 1.2466666666666666) internal successors, (187), 151 states have internal predecessors, (187), 0 states have call successors, (0), 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:51,411 INFO L87 Difference]: Start difference. First operand 314 states. Second operand has 152 states, 150 states have (on average 1.2466666666666666) internal successors, (187), 151 states have internal predecessors, (187), 0 states have call successors, (0), 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:51,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:51,416 INFO L93 Difference]: Finished difference Result 314 states and 374 transitions. [2022-02-21 03:03:51,416 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 374 transitions. [2022-02-21 03:03:51,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:51,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:51,416 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 150 states have (on average 1.2466666666666666) internal successors, (187), 151 states have internal predecessors, (187), 0 states have call successors, (0), 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 314 states. [2022-02-21 03:03:51,417 INFO L87 Difference]: Start difference. First operand has 152 states, 150 states have (on average 1.2466666666666666) internal successors, (187), 151 states have internal predecessors, (187), 0 states have call successors, (0), 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 314 states. [2022-02-21 03:03:51,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:51,422 INFO L93 Difference]: Finished difference Result 314 states and 374 transitions. [2022-02-21 03:03:51,422 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 374 transitions. [2022-02-21 03:03:51,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:51,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:51,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:51,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:51,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 150 states have (on average 1.2466666666666666) internal successors, (187), 151 states have internal predecessors, (187), 0 states have call successors, (0), 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:51,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 187 transitions. [2022-02-21 03:03:51,425 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 187 transitions. Word has length 18 [2022-02-21 03:03:51,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:51,425 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 187 transitions. [2022-02-21 03:03:51,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 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:51,425 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 187 transitions. [2022-02-21 03:03:51,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-21 03:03:51,425 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:51,426 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2022-02-21 03:03:51,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:03:51,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-02-21 03:03:51,628 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:03:51,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:51,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1913405005, now seen corresponding path program 2 times [2022-02-21 03:03:51,628 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:51,628 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929336164] [2022-02-21 03:03:51,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:51,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:51,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {5492#true} assume { :begin_inline_ULTIMATE.init } true; {5492#true} is VALID [2022-02-21 03:03:51,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {5492#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,666 INFO L290 TraceCheckUtils]: 3: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,667 INFO L290 TraceCheckUtils]: 4: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~j~0#1 < main_~m~0#1); {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,667 INFO L290 TraceCheckUtils]: 6: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~N~0#1 - 1 <= 2147483647; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~N~0#1 - 1 >= -2147483648; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,668 INFO L290 TraceCheckUtils]: 10: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} main_~i~0#1 := main_~k~0#1; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~j~0#1 < main_~m~0#1); {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~N~0#1 - 1 <= 2147483647; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~N~0#1 - 1 >= -2147483648; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,671 INFO L290 TraceCheckUtils]: 17: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} main_~i~0#1 := main_~k~0#1; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~j~0#1 < main_~m~0#1); {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,671 INFO L290 TraceCheckUtils]: 19: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,672 INFO L290 TraceCheckUtils]: 21: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~N~0#1 - 1 <= 2147483647; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,672 INFO L290 TraceCheckUtils]: 22: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~N~0#1 - 1 >= -2147483648; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,673 INFO L290 TraceCheckUtils]: 23: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,673 INFO L290 TraceCheckUtils]: 24: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} main_~i~0#1 := main_~k~0#1; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,673 INFO L290 TraceCheckUtils]: 25: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~j~0#1 < main_~m~0#1); {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,673 INFO L290 TraceCheckUtils]: 26: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,674 INFO L290 TraceCheckUtils]: 27: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,674 INFO L290 TraceCheckUtils]: 28: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~N~0#1 - 1 <= 2147483647; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,674 INFO L290 TraceCheckUtils]: 29: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~N~0#1 - 1 >= -2147483648; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,675 INFO L290 TraceCheckUtils]: 30: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,675 INFO L290 TraceCheckUtils]: 31: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} main_~i~0#1 := main_~k~0#1; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,676 INFO L290 TraceCheckUtils]: 32: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~j~0#1 < main_~m~0#1); {5495#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} is VALID [2022-02-21 03:03:51,676 INFO L290 TraceCheckUtils]: 33: Hoare triple {5495#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} assume !(1 + main_~j~0#1 <= 2147483647); {5493#false} is VALID [2022-02-21 03:03:51,676 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-02-21 03:03:51,677 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:51,677 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929336164] [2022-02-21 03:03:51,677 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929336164] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:03:51,677 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289562894] [2022-02-21 03:03:51,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:03:51,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:51,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:51,682 INFO L229 MonitoredProcess]: Starting monitored process 7 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:51,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-21 03:03:51,716 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-21 03:03:51,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:03:51,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:03:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:51,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:03:51,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {5492#true} assume { :begin_inline_ULTIMATE.init } true; {5492#true} is VALID [2022-02-21 03:03:51,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {5492#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,832 INFO L290 TraceCheckUtils]: 3: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,832 INFO L290 TraceCheckUtils]: 4: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~j~0#1 < main_~m~0#1); {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,833 INFO L290 TraceCheckUtils]: 6: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~N~0#1 - 1 <= 2147483647; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~N~0#1 - 1 >= -2147483648; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,834 INFO L290 TraceCheckUtils]: 10: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} main_~i~0#1 := main_~k~0#1; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,834 INFO L290 TraceCheckUtils]: 11: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~j~0#1 < main_~m~0#1); {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,834 INFO L290 TraceCheckUtils]: 12: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,835 INFO L290 TraceCheckUtils]: 14: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~N~0#1 - 1 <= 2147483647; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,835 INFO L290 TraceCheckUtils]: 15: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~N~0#1 - 1 >= -2147483648; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,836 INFO L290 TraceCheckUtils]: 17: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} main_~i~0#1 := main_~k~0#1; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,836 INFO L290 TraceCheckUtils]: 18: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~j~0#1 < main_~m~0#1); {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,836 INFO L290 TraceCheckUtils]: 19: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,837 INFO L290 TraceCheckUtils]: 20: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,837 INFO L290 TraceCheckUtils]: 21: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~N~0#1 - 1 <= 2147483647; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,837 INFO L290 TraceCheckUtils]: 22: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~N~0#1 - 1 >= -2147483648; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,838 INFO L290 TraceCheckUtils]: 23: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,838 INFO L290 TraceCheckUtils]: 24: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} main_~i~0#1 := main_~k~0#1; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,839 INFO L290 TraceCheckUtils]: 25: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~j~0#1 < main_~m~0#1); {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,839 INFO L290 TraceCheckUtils]: 26: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,839 INFO L290 TraceCheckUtils]: 27: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,842 INFO L290 TraceCheckUtils]: 28: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~N~0#1 - 1 <= 2147483647; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,842 INFO L290 TraceCheckUtils]: 29: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~N~0#1 - 1 >= -2147483648; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,845 INFO L290 TraceCheckUtils]: 30: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,845 INFO L290 TraceCheckUtils]: 31: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} main_~i~0#1 := main_~k~0#1; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,845 INFO L290 TraceCheckUtils]: 32: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~j~0#1 < main_~m~0#1); {5495#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} is VALID [2022-02-21 03:03:51,846 INFO L290 TraceCheckUtils]: 33: Hoare triple {5495#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} assume !(1 + main_~j~0#1 <= 2147483647); {5493#false} is VALID [2022-02-21 03:03:51,846 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-02-21 03:03:51,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:03:51,987 INFO L290 TraceCheckUtils]: 33: Hoare triple {5495#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} assume !(1 + main_~j~0#1 <= 2147483647); {5493#false} is VALID [2022-02-21 03:03:51,988 INFO L290 TraceCheckUtils]: 32: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~j~0#1 < main_~m~0#1); {5495#(<= |ULTIMATE.start_main_~j~0#1| 2147483646)} is VALID [2022-02-21 03:03:51,988 INFO L290 TraceCheckUtils]: 31: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} main_~i~0#1 := main_~k~0#1; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,990 INFO L290 TraceCheckUtils]: 30: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,991 INFO L290 TraceCheckUtils]: 29: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~N~0#1 - 1 >= -2147483648; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,992 INFO L290 TraceCheckUtils]: 28: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~N~0#1 - 1 <= 2147483647; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,992 INFO L290 TraceCheckUtils]: 27: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,992 INFO L290 TraceCheckUtils]: 26: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,993 INFO L290 TraceCheckUtils]: 25: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~j~0#1 < main_~m~0#1); {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,993 INFO L290 TraceCheckUtils]: 24: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} main_~i~0#1 := main_~k~0#1; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,993 INFO L290 TraceCheckUtils]: 23: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,994 INFO L290 TraceCheckUtils]: 22: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~N~0#1 - 1 >= -2147483648; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,994 INFO L290 TraceCheckUtils]: 21: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~N~0#1 - 1 <= 2147483647; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,994 INFO L290 TraceCheckUtils]: 20: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,994 INFO L290 TraceCheckUtils]: 19: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,995 INFO L290 TraceCheckUtils]: 18: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~j~0#1 < main_~m~0#1); {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,995 INFO L290 TraceCheckUtils]: 17: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} main_~i~0#1 := main_~k~0#1; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,995 INFO L290 TraceCheckUtils]: 16: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,996 INFO L290 TraceCheckUtils]: 15: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~N~0#1 - 1 >= -2147483648; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,996 INFO L290 TraceCheckUtils]: 14: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~N~0#1 - 1 <= 2147483647; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,997 INFO L290 TraceCheckUtils]: 12: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,997 INFO L290 TraceCheckUtils]: 11: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~j~0#1 < main_~m~0#1); {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,997 INFO L290 TraceCheckUtils]: 10: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} main_~i~0#1 := main_~k~0#1; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~N~0#1 - 1 >= -2147483648; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,998 INFO L290 TraceCheckUtils]: 7: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume main_~N~0#1 - 1 <= 2147483647; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,998 INFO L290 TraceCheckUtils]: 6: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:51,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:52,002 INFO L290 TraceCheckUtils]: 4: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~j~0#1 < main_~m~0#1); {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:52,002 INFO L290 TraceCheckUtils]: 3: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:52,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:52,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {5492#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {5494#(<= |ULTIMATE.start_main_~m~0#1| 2147483647)} is VALID [2022-02-21 03:03:52,003 INFO L290 TraceCheckUtils]: 0: Hoare triple {5492#true} assume { :begin_inline_ULTIMATE.init } true; {5492#true} is VALID [2022-02-21 03:03:52,003 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-02-21 03:03:52,003 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289562894] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:03:52,003 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:03:52,003 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2022-02-21 03:03:52,003 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958980021] [2022-02-21 03:03:52,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:03:52,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-02-21 03:03:52,004 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:52,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:52,010 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:52,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:03:52,011 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:52,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:03:52,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:03:52,012 INFO L87 Difference]: Start difference. First operand 152 states and 187 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:52,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:52,221 INFO L93 Difference]: Finished difference Result 152 states and 187 transitions. [2022-02-21 03:03:52,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:03:52,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-02-21 03:03:52,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:52,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:52,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2022-02-21 03:03:52,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:52,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2022-02-21 03:03:52,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 20 transitions. [2022-02-21 03:03:52,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:52,234 INFO L225 Difference]: With dead ends: 152 [2022-02-21 03:03:52,234 INFO L226 Difference]: Without dead ends: 151 [2022-02-21 03:03:52,235 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 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:52,235 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 8 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 25 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:52,235 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 25 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:52,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-02-21 03:03:52,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 51. [2022-02-21 03:03:52,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:52,316 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand has 51 states, 50 states have (on average 1.18) internal successors, (59), 50 states have internal predecessors, (59), 0 states have call successors, (0), 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:52,316 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand has 51 states, 50 states have (on average 1.18) internal successors, (59), 50 states have internal predecessors, (59), 0 states have call successors, (0), 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:52,316 INFO L87 Difference]: Start difference. First operand 151 states. Second operand has 51 states, 50 states have (on average 1.18) internal successors, (59), 50 states have internal predecessors, (59), 0 states have call successors, (0), 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:52,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:52,319 INFO L93 Difference]: Finished difference Result 151 states and 183 transitions. [2022-02-21 03:03:52,319 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 183 transitions. [2022-02-21 03:03:52,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:52,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:52,319 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 50 states have (on average 1.18) internal successors, (59), 50 states have internal predecessors, (59), 0 states have call successors, (0), 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 151 states. [2022-02-21 03:03:52,334 INFO L87 Difference]: Start difference. First operand has 51 states, 50 states have (on average 1.18) internal successors, (59), 50 states have internal predecessors, (59), 0 states have call successors, (0), 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 151 states. [2022-02-21 03:03:52,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:52,341 INFO L93 Difference]: Finished difference Result 151 states and 183 transitions. [2022-02-21 03:03:52,341 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 183 transitions. [2022-02-21 03:03:52,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:52,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:52,342 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:52,342 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:52,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.18) internal successors, (59), 50 states have internal predecessors, (59), 0 states have call successors, (0), 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:52,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-02-21 03:03:52,344 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 34 [2022-02-21 03:03:52,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:52,345 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-02-21 03:03:52,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:03:52,345 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-02-21 03:03:52,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-21 03:03:52,346 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:52,346 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:52,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:03:52,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-02-21 03:03:52,547 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:03:52,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:52,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1880365324, now seen corresponding path program 1 times [2022-02-21 03:03:52,547 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:52,547 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893983707] [2022-02-21 03:03:52,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:52,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:52,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {6259#true} assume { :begin_inline_ULTIMATE.init } true; {6259#true} is VALID [2022-02-21 03:03:52,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {6259#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {6259#true} is VALID [2022-02-21 03:03:52,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {6259#true} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {6261#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:52,609 INFO L290 TraceCheckUtils]: 3: Hoare triple {6261#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {6261#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:52,609 INFO L290 TraceCheckUtils]: 4: Hoare triple {6261#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~0#1 < main_~m~0#1); {6261#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:52,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {6261#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 1 + main_~j~0#1 <= 2147483647; {6261#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:52,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {6261#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {6262#(<= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-21 03:03:52,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {6262#(<= |ULTIMATE.start_main_~k~0#1| 0)} assume main_~N~0#1 - 1 <= 2147483647; {6262#(<= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-21 03:03:52,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {6262#(<= |ULTIMATE.start_main_~k~0#1| 0)} assume main_~N~0#1 - 1 >= -2147483648; {6262#(<= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-21 03:03:52,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {6262#(<= |ULTIMATE.start_main_~k~0#1| 0)} assume !!(main_~k~0#1 < main_~N~0#1 - 1); {6262#(<= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-21 03:03:52,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {6262#(<= |ULTIMATE.start_main_~k~0#1| 0)} assume 1 + main_~k~0#1 <= 2147483647; {6262#(<= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-21 03:03:52,612 INFO L290 TraceCheckUtils]: 11: Hoare triple {6262#(<= |ULTIMATE.start_main_~k~0#1| 0)} assume 1 + main_~k~0#1 >= -2147483648;main_~k~0#1 := 1 + main_~k~0#1; {6263#(<= |ULTIMATE.start_main_~k~0#1| 1)} is VALID [2022-02-21 03:03:52,612 INFO L290 TraceCheckUtils]: 12: Hoare triple {6263#(<= |ULTIMATE.start_main_~k~0#1| 1)} assume main_~N~0#1 - 1 <= 2147483647; {6263#(<= |ULTIMATE.start_main_~k~0#1| 1)} is VALID [2022-02-21 03:03:52,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {6263#(<= |ULTIMATE.start_main_~k~0#1| 1)} assume main_~N~0#1 - 1 >= -2147483648; {6263#(<= |ULTIMATE.start_main_~k~0#1| 1)} is VALID [2022-02-21 03:03:52,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {6263#(<= |ULTIMATE.start_main_~k~0#1| 1)} assume !!(main_~k~0#1 < main_~N~0#1 - 1); {6263#(<= |ULTIMATE.start_main_~k~0#1| 1)} is VALID [2022-02-21 03:03:52,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {6263#(<= |ULTIMATE.start_main_~k~0#1| 1)} assume 1 + main_~k~0#1 <= 2147483647; {6263#(<= |ULTIMATE.start_main_~k~0#1| 1)} is VALID [2022-02-21 03:03:52,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {6263#(<= |ULTIMATE.start_main_~k~0#1| 1)} assume 1 + main_~k~0#1 >= -2147483648;main_~k~0#1 := 1 + main_~k~0#1; {6264#(<= |ULTIMATE.start_main_~k~0#1| 2)} is VALID [2022-02-21 03:03:52,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {6264#(<= |ULTIMATE.start_main_~k~0#1| 2)} assume main_~N~0#1 - 1 <= 2147483647; {6264#(<= |ULTIMATE.start_main_~k~0#1| 2)} is VALID [2022-02-21 03:03:52,614 INFO L290 TraceCheckUtils]: 18: Hoare triple {6264#(<= |ULTIMATE.start_main_~k~0#1| 2)} assume main_~N~0#1 - 1 >= -2147483648; {6264#(<= |ULTIMATE.start_main_~k~0#1| 2)} is VALID [2022-02-21 03:03:52,614 INFO L290 TraceCheckUtils]: 19: Hoare triple {6264#(<= |ULTIMATE.start_main_~k~0#1| 2)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {6264#(<= |ULTIMATE.start_main_~k~0#1| 2)} is VALID [2022-02-21 03:03:52,614 INFO L290 TraceCheckUtils]: 20: Hoare triple {6264#(<= |ULTIMATE.start_main_~k~0#1| 2)} main_~i~0#1 := main_~k~0#1; {6265#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:03:52,615 INFO L290 TraceCheckUtils]: 21: Hoare triple {6265#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~j~0#1 < main_~m~0#1); {6265#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:03:52,615 INFO L290 TraceCheckUtils]: 22: Hoare triple {6265#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume 1 + main_~i~0#1 <= 2147483647; {6265#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:03:52,615 INFO L290 TraceCheckUtils]: 23: Hoare triple {6265#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1; {6266#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:03:52,616 INFO L290 TraceCheckUtils]: 24: Hoare triple {6266#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {6266#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:03:52,616 INFO L290 TraceCheckUtils]: 25: Hoare triple {6266#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~j~0#1 < main_~m~0#1); {6266#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:03:52,616 INFO L290 TraceCheckUtils]: 26: Hoare triple {6266#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume 1 + main_~j~0#1 <= 2147483647; {6266#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:03:52,617 INFO L290 TraceCheckUtils]: 27: Hoare triple {6266#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {6267#(<= |ULTIMATE.start_main_~k~0#1| 3)} is VALID [2022-02-21 03:03:52,617 INFO L290 TraceCheckUtils]: 28: Hoare triple {6267#(<= |ULTIMATE.start_main_~k~0#1| 3)} assume main_~N~0#1 - 1 <= 2147483647; {6267#(<= |ULTIMATE.start_main_~k~0#1| 3)} is VALID [2022-02-21 03:03:52,617 INFO L290 TraceCheckUtils]: 29: Hoare triple {6267#(<= |ULTIMATE.start_main_~k~0#1| 3)} assume main_~N~0#1 - 1 >= -2147483648; {6267#(<= |ULTIMATE.start_main_~k~0#1| 3)} is VALID [2022-02-21 03:03:52,617 INFO L290 TraceCheckUtils]: 30: Hoare triple {6267#(<= |ULTIMATE.start_main_~k~0#1| 3)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {6267#(<= |ULTIMATE.start_main_~k~0#1| 3)} is VALID [2022-02-21 03:03:52,618 INFO L290 TraceCheckUtils]: 31: Hoare triple {6267#(<= |ULTIMATE.start_main_~k~0#1| 3)} main_~i~0#1 := main_~k~0#1; {6266#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:03:52,618 INFO L290 TraceCheckUtils]: 32: Hoare triple {6266#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !(main_~j~0#1 < main_~m~0#1); {6266#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:03:52,619 INFO L290 TraceCheckUtils]: 33: Hoare triple {6266#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !(1 + main_~i~0#1 <= 2147483647); {6260#false} is VALID [2022-02-21 03:03:52,619 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:03:52,619 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:52,619 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893983707] [2022-02-21 03:03:52,619 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893983707] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:03:52,619 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255717107] [2022-02-21 03:03:52,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:52,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:52,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:52,621 INFO L229 MonitoredProcess]: Starting monitored process 8 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:52,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-21 03:03:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:52,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-21 03:03:52,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:52,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:03:52,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {6259#true} assume { :begin_inline_ULTIMATE.init } true; {6259#true} is VALID [2022-02-21 03:03:52,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {6259#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {6259#true} is VALID [2022-02-21 03:03:52,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {6259#true} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {6261#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:52,805 INFO L290 TraceCheckUtils]: 3: Hoare triple {6261#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {6261#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:52,805 INFO L290 TraceCheckUtils]: 4: Hoare triple {6261#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~0#1 < main_~m~0#1); {6261#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:52,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {6261#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 1 + main_~j~0#1 <= 2147483647; {6261#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:52,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {6261#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {6262#(<= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-21 03:03:52,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {6262#(<= |ULTIMATE.start_main_~k~0#1| 0)} assume main_~N~0#1 - 1 <= 2147483647; {6262#(<= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-21 03:03:52,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {6262#(<= |ULTIMATE.start_main_~k~0#1| 0)} assume main_~N~0#1 - 1 >= -2147483648; {6262#(<= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-21 03:03:52,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {6262#(<= |ULTIMATE.start_main_~k~0#1| 0)} assume !!(main_~k~0#1 < main_~N~0#1 - 1); {6262#(<= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-21 03:03:52,806 INFO L290 TraceCheckUtils]: 10: Hoare triple {6262#(<= |ULTIMATE.start_main_~k~0#1| 0)} assume 1 + main_~k~0#1 <= 2147483647; {6262#(<= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-21 03:03:52,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {6262#(<= |ULTIMATE.start_main_~k~0#1| 0)} assume 1 + main_~k~0#1 >= -2147483648;main_~k~0#1 := 1 + main_~k~0#1; {6263#(<= |ULTIMATE.start_main_~k~0#1| 1)} is VALID [2022-02-21 03:03:52,807 INFO L290 TraceCheckUtils]: 12: Hoare triple {6263#(<= |ULTIMATE.start_main_~k~0#1| 1)} assume main_~N~0#1 - 1 <= 2147483647; {6263#(<= |ULTIMATE.start_main_~k~0#1| 1)} is VALID [2022-02-21 03:03:52,807 INFO L290 TraceCheckUtils]: 13: Hoare triple {6263#(<= |ULTIMATE.start_main_~k~0#1| 1)} assume main_~N~0#1 - 1 >= -2147483648; {6263#(<= |ULTIMATE.start_main_~k~0#1| 1)} is VALID [2022-02-21 03:03:52,808 INFO L290 TraceCheckUtils]: 14: Hoare triple {6263#(<= |ULTIMATE.start_main_~k~0#1| 1)} assume !!(main_~k~0#1 < main_~N~0#1 - 1); {6263#(<= |ULTIMATE.start_main_~k~0#1| 1)} is VALID [2022-02-21 03:03:52,808 INFO L290 TraceCheckUtils]: 15: Hoare triple {6263#(<= |ULTIMATE.start_main_~k~0#1| 1)} assume 1 + main_~k~0#1 <= 2147483647; {6263#(<= |ULTIMATE.start_main_~k~0#1| 1)} is VALID [2022-02-21 03:03:52,808 INFO L290 TraceCheckUtils]: 16: Hoare triple {6263#(<= |ULTIMATE.start_main_~k~0#1| 1)} assume 1 + main_~k~0#1 >= -2147483648;main_~k~0#1 := 1 + main_~k~0#1; {6264#(<= |ULTIMATE.start_main_~k~0#1| 2)} is VALID [2022-02-21 03:03:52,809 INFO L290 TraceCheckUtils]: 17: Hoare triple {6264#(<= |ULTIMATE.start_main_~k~0#1| 2)} assume main_~N~0#1 - 1 <= 2147483647; {6264#(<= |ULTIMATE.start_main_~k~0#1| 2)} is VALID [2022-02-21 03:03:52,809 INFO L290 TraceCheckUtils]: 18: Hoare triple {6264#(<= |ULTIMATE.start_main_~k~0#1| 2)} assume main_~N~0#1 - 1 >= -2147483648; {6264#(<= |ULTIMATE.start_main_~k~0#1| 2)} is VALID [2022-02-21 03:03:52,809 INFO L290 TraceCheckUtils]: 19: Hoare triple {6264#(<= |ULTIMATE.start_main_~k~0#1| 2)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {6264#(<= |ULTIMATE.start_main_~k~0#1| 2)} is VALID [2022-02-21 03:03:52,809 INFO L290 TraceCheckUtils]: 20: Hoare triple {6264#(<= |ULTIMATE.start_main_~k~0#1| 2)} main_~i~0#1 := main_~k~0#1; {6265#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:03:52,810 INFO L290 TraceCheckUtils]: 21: Hoare triple {6265#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~j~0#1 < main_~m~0#1); {6265#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:03:52,810 INFO L290 TraceCheckUtils]: 22: Hoare triple {6265#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume 1 + main_~i~0#1 <= 2147483647; {6265#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:03:52,810 INFO L290 TraceCheckUtils]: 23: Hoare triple {6265#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1; {6266#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:03:52,811 INFO L290 TraceCheckUtils]: 24: Hoare triple {6266#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {6266#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:03:52,811 INFO L290 TraceCheckUtils]: 25: Hoare triple {6266#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~j~0#1 < main_~m~0#1); {6266#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:03:52,811 INFO L290 TraceCheckUtils]: 26: Hoare triple {6266#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume 1 + main_~j~0#1 <= 2147483647; {6266#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:03:52,812 INFO L290 TraceCheckUtils]: 27: Hoare triple {6266#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {6267#(<= |ULTIMATE.start_main_~k~0#1| 3)} is VALID [2022-02-21 03:03:52,812 INFO L290 TraceCheckUtils]: 28: Hoare triple {6267#(<= |ULTIMATE.start_main_~k~0#1| 3)} assume main_~N~0#1 - 1 <= 2147483647; {6267#(<= |ULTIMATE.start_main_~k~0#1| 3)} is VALID [2022-02-21 03:03:52,812 INFO L290 TraceCheckUtils]: 29: Hoare triple {6267#(<= |ULTIMATE.start_main_~k~0#1| 3)} assume main_~N~0#1 - 1 >= -2147483648; {6267#(<= |ULTIMATE.start_main_~k~0#1| 3)} is VALID [2022-02-21 03:03:52,813 INFO L290 TraceCheckUtils]: 30: Hoare triple {6267#(<= |ULTIMATE.start_main_~k~0#1| 3)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {6267#(<= |ULTIMATE.start_main_~k~0#1| 3)} is VALID [2022-02-21 03:03:52,813 INFO L290 TraceCheckUtils]: 31: Hoare triple {6267#(<= |ULTIMATE.start_main_~k~0#1| 3)} main_~i~0#1 := main_~k~0#1; {6266#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:03:52,813 INFO L290 TraceCheckUtils]: 32: Hoare triple {6266#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !(main_~j~0#1 < main_~m~0#1); {6266#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:03:52,814 INFO L290 TraceCheckUtils]: 33: Hoare triple {6266#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !(1 + main_~i~0#1 <= 2147483647); {6260#false} is VALID [2022-02-21 03:03:52,814 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:03:52,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:03:53,022 INFO L290 TraceCheckUtils]: 33: Hoare triple {6370#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !(1 + main_~i~0#1 <= 2147483647); {6260#false} is VALID [2022-02-21 03:03:53,022 INFO L290 TraceCheckUtils]: 32: Hoare triple {6370#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !(main_~j~0#1 < main_~m~0#1); {6370#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:03:53,023 INFO L290 TraceCheckUtils]: 31: Hoare triple {6377#(<= |ULTIMATE.start_main_~k~0#1| 2147483646)} main_~i~0#1 := main_~k~0#1; {6370#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:03:53,024 INFO L290 TraceCheckUtils]: 30: Hoare triple {6377#(<= |ULTIMATE.start_main_~k~0#1| 2147483646)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {6377#(<= |ULTIMATE.start_main_~k~0#1| 2147483646)} is VALID [2022-02-21 03:03:53,024 INFO L290 TraceCheckUtils]: 29: Hoare triple {6377#(<= |ULTIMATE.start_main_~k~0#1| 2147483646)} assume main_~N~0#1 - 1 >= -2147483648; {6377#(<= |ULTIMATE.start_main_~k~0#1| 2147483646)} is VALID [2022-02-21 03:03:53,024 INFO L290 TraceCheckUtils]: 28: Hoare triple {6377#(<= |ULTIMATE.start_main_~k~0#1| 2147483646)} assume main_~N~0#1 - 1 <= 2147483647; {6377#(<= |ULTIMATE.start_main_~k~0#1| 2147483646)} is VALID [2022-02-21 03:03:53,024 INFO L290 TraceCheckUtils]: 27: Hoare triple {6370#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {6377#(<= |ULTIMATE.start_main_~k~0#1| 2147483646)} is VALID [2022-02-21 03:03:53,025 INFO L290 TraceCheckUtils]: 26: Hoare triple {6370#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume 1 + main_~j~0#1 <= 2147483647; {6370#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:03:53,025 INFO L290 TraceCheckUtils]: 25: Hoare triple {6370#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !!(main_~j~0#1 < main_~m~0#1); {6370#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:03:53,025 INFO L290 TraceCheckUtils]: 24: Hoare triple {6370#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {6370#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:03:53,026 INFO L290 TraceCheckUtils]: 23: Hoare triple {6402#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1; {6370#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:03:53,026 INFO L290 TraceCheckUtils]: 22: Hoare triple {6402#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume 1 + main_~i~0#1 <= 2147483647; {6402#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:03:53,026 INFO L290 TraceCheckUtils]: 21: Hoare triple {6402#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume !(main_~j~0#1 < main_~m~0#1); {6402#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:03:53,026 INFO L290 TraceCheckUtils]: 20: Hoare triple {6412#(<= |ULTIMATE.start_main_~k~0#1| 2147483645)} main_~i~0#1 := main_~k~0#1; {6402#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:03:53,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {6412#(<= |ULTIMATE.start_main_~k~0#1| 2147483645)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {6412#(<= |ULTIMATE.start_main_~k~0#1| 2147483645)} is VALID [2022-02-21 03:03:53,027 INFO L290 TraceCheckUtils]: 18: Hoare triple {6412#(<= |ULTIMATE.start_main_~k~0#1| 2147483645)} assume main_~N~0#1 - 1 >= -2147483648; {6412#(<= |ULTIMATE.start_main_~k~0#1| 2147483645)} is VALID [2022-02-21 03:03:53,027 INFO L290 TraceCheckUtils]: 17: Hoare triple {6412#(<= |ULTIMATE.start_main_~k~0#1| 2147483645)} assume main_~N~0#1 - 1 <= 2147483647; {6412#(<= |ULTIMATE.start_main_~k~0#1| 2147483645)} is VALID [2022-02-21 03:03:53,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {6425#(<= |ULTIMATE.start_main_~k~0#1| 2147483644)} assume 1 + main_~k~0#1 >= -2147483648;main_~k~0#1 := 1 + main_~k~0#1; {6412#(<= |ULTIMATE.start_main_~k~0#1| 2147483645)} is VALID [2022-02-21 03:03:53,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {6425#(<= |ULTIMATE.start_main_~k~0#1| 2147483644)} assume 1 + main_~k~0#1 <= 2147483647; {6425#(<= |ULTIMATE.start_main_~k~0#1| 2147483644)} is VALID [2022-02-21 03:03:53,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {6425#(<= |ULTIMATE.start_main_~k~0#1| 2147483644)} assume !!(main_~k~0#1 < main_~N~0#1 - 1); {6425#(<= |ULTIMATE.start_main_~k~0#1| 2147483644)} is VALID [2022-02-21 03:03:53,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {6425#(<= |ULTIMATE.start_main_~k~0#1| 2147483644)} assume main_~N~0#1 - 1 >= -2147483648; {6425#(<= |ULTIMATE.start_main_~k~0#1| 2147483644)} is VALID [2022-02-21 03:03:53,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {6425#(<= |ULTIMATE.start_main_~k~0#1| 2147483644)} assume main_~N~0#1 - 1 <= 2147483647; {6425#(<= |ULTIMATE.start_main_~k~0#1| 2147483644)} is VALID [2022-02-21 03:03:53,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {6441#(<= |ULTIMATE.start_main_~k~0#1| 2147483643)} assume 1 + main_~k~0#1 >= -2147483648;main_~k~0#1 := 1 + main_~k~0#1; {6425#(<= |ULTIMATE.start_main_~k~0#1| 2147483644)} is VALID [2022-02-21 03:03:53,033 INFO L290 TraceCheckUtils]: 10: Hoare triple {6441#(<= |ULTIMATE.start_main_~k~0#1| 2147483643)} assume 1 + main_~k~0#1 <= 2147483647; {6441#(<= |ULTIMATE.start_main_~k~0#1| 2147483643)} is VALID [2022-02-21 03:03:53,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {6441#(<= |ULTIMATE.start_main_~k~0#1| 2147483643)} assume !!(main_~k~0#1 < main_~N~0#1 - 1); {6441#(<= |ULTIMATE.start_main_~k~0#1| 2147483643)} is VALID [2022-02-21 03:03:53,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {6441#(<= |ULTIMATE.start_main_~k~0#1| 2147483643)} assume main_~N~0#1 - 1 >= -2147483648; {6441#(<= |ULTIMATE.start_main_~k~0#1| 2147483643)} is VALID [2022-02-21 03:03:53,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {6441#(<= |ULTIMATE.start_main_~k~0#1| 2147483643)} assume main_~N~0#1 - 1 <= 2147483647; {6441#(<= |ULTIMATE.start_main_~k~0#1| 2147483643)} is VALID [2022-02-21 03:03:53,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {6457#(<= |ULTIMATE.start_main_~i~0#1| 2147483643)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {6441#(<= |ULTIMATE.start_main_~k~0#1| 2147483643)} is VALID [2022-02-21 03:03:53,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {6457#(<= |ULTIMATE.start_main_~i~0#1| 2147483643)} assume 1 + main_~j~0#1 <= 2147483647; {6457#(<= |ULTIMATE.start_main_~i~0#1| 2147483643)} is VALID [2022-02-21 03:03:53,034 INFO L290 TraceCheckUtils]: 4: Hoare triple {6457#(<= |ULTIMATE.start_main_~i~0#1| 2147483643)} assume !!(main_~j~0#1 < main_~m~0#1); {6457#(<= |ULTIMATE.start_main_~i~0#1| 2147483643)} is VALID [2022-02-21 03:03:53,034 INFO L290 TraceCheckUtils]: 3: Hoare triple {6457#(<= |ULTIMATE.start_main_~i~0#1| 2147483643)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {6457#(<= |ULTIMATE.start_main_~i~0#1| 2147483643)} is VALID [2022-02-21 03:03:53,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {6259#true} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {6457#(<= |ULTIMATE.start_main_~i~0#1| 2147483643)} is VALID [2022-02-21 03:03:53,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {6259#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {6259#true} is VALID [2022-02-21 03:03:53,035 INFO L290 TraceCheckUtils]: 0: Hoare triple {6259#true} assume { :begin_inline_ULTIMATE.init } true; {6259#true} is VALID [2022-02-21 03:03:53,035 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:03:53,035 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255717107] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:03:53,035 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:03:53,035 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2022-02-21 03:03:53,036 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502040194] [2022-02-21 03:03:53,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:03:53,036 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.4) internal successors, (66), 16 states have internal predecessors, (66), 0 states have call successors, (0), 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 34 [2022-02-21 03:03:53,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:53,036 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 4.4) internal successors, (66), 16 states have internal predecessors, (66), 0 states have call successors, (0), 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:53,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:53,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-21 03:03:53,075 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:53,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-21 03:03:53,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2022-02-21 03:03:53,076 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 16 states, 15 states have (on average 4.4) internal successors, (66), 16 states have internal predecessors, (66), 0 states have call successors, (0), 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:54,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:54,568 INFO L93 Difference]: Finished difference Result 333 states and 390 transitions. [2022-02-21 03:03:54,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-02-21 03:03:54,568 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.4) internal successors, (66), 16 states have internal predecessors, (66), 0 states have call successors, (0), 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 34 [2022-02-21 03:03:54,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:54,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 4.4) internal successors, (66), 16 states have internal predecessors, (66), 0 states have call successors, (0), 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:54,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 324 transitions. [2022-02-21 03:03:54,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 4.4) internal successors, (66), 16 states have internal predecessors, (66), 0 states have call successors, (0), 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:54,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 324 transitions. [2022-02-21 03:03:54,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 324 transitions. [2022-02-21 03:03:54,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 324 edges. 324 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:54,768 INFO L225 Difference]: With dead ends: 333 [2022-02-21 03:03:54,768 INFO L226 Difference]: Without dead ends: 332 [2022-02-21 03:03:54,769 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=871, Invalid=1679, Unknown=0, NotChecked=0, Total=2550 [2022-02-21 03:03:54,770 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 681 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:54,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [681 Valid, 90 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 03:03:54,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2022-02-21 03:03:54,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 100. [2022-02-21 03:03:54,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:54,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 332 states. Second operand has 100 states, 99 states have (on average 1.1717171717171717) internal successors, (116), 99 states have internal predecessors, (116), 0 states have call successors, (0), 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:54,953 INFO L74 IsIncluded]: Start isIncluded. First operand 332 states. Second operand has 100 states, 99 states have (on average 1.1717171717171717) internal successors, (116), 99 states have internal predecessors, (116), 0 states have call successors, (0), 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:54,953 INFO L87 Difference]: Start difference. First operand 332 states. Second operand has 100 states, 99 states have (on average 1.1717171717171717) internal successors, (116), 99 states have internal predecessors, (116), 0 states have call successors, (0), 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:54,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:54,958 INFO L93 Difference]: Finished difference Result 332 states and 386 transitions. [2022-02-21 03:03:54,958 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 386 transitions. [2022-02-21 03:03:54,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:54,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:54,958 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 99 states have (on average 1.1717171717171717) internal successors, (116), 99 states have internal predecessors, (116), 0 states have call successors, (0), 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 332 states. [2022-02-21 03:03:54,958 INFO L87 Difference]: Start difference. First operand has 100 states, 99 states have (on average 1.1717171717171717) internal successors, (116), 99 states have internal predecessors, (116), 0 states have call successors, (0), 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 332 states. [2022-02-21 03:03:54,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:54,963 INFO L93 Difference]: Finished difference Result 332 states and 386 transitions. [2022-02-21 03:03:54,963 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 386 transitions. [2022-02-21 03:03:54,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:54,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:54,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:54,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:54,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.1717171717171717) internal successors, (116), 99 states have internal predecessors, (116), 0 states have call successors, (0), 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:54,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 116 transitions. [2022-02-21 03:03:54,965 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 116 transitions. Word has length 34 [2022-02-21 03:03:54,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:54,965 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 116 transitions. [2022-02-21 03:03:54,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.4) internal successors, (66), 16 states have internal predecessors, (66), 0 states have call successors, (0), 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:54,965 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 116 transitions. [2022-02-21 03:03:54,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-21 03:03:54,966 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:54,966 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:54,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:03:55,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:55,183 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:03:55,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:55,183 INFO L85 PathProgramCache]: Analyzing trace with hash 454746150, now seen corresponding path program 2 times [2022-02-21 03:03:55,183 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:55,183 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944529946] [2022-02-21 03:03:55,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:55,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:55,314 INFO L290 TraceCheckUtils]: 0: Hoare triple {7748#true} assume { :begin_inline_ULTIMATE.init } true; {7748#true} is VALID [2022-02-21 03:03:55,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {7748#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {7748#true} is VALID [2022-02-21 03:03:55,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {7748#true} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {7750#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:55,315 INFO L290 TraceCheckUtils]: 3: Hoare triple {7750#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {7750#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:55,315 INFO L290 TraceCheckUtils]: 4: Hoare triple {7750#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~0#1 < main_~m~0#1); {7750#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:55,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {7750#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 1 + main_~j~0#1 <= 2147483647; {7750#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:55,316 INFO L290 TraceCheckUtils]: 6: Hoare triple {7750#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {7751#(<= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-21 03:03:55,316 INFO L290 TraceCheckUtils]: 7: Hoare triple {7751#(<= |ULTIMATE.start_main_~k~0#1| 0)} assume main_~N~0#1 - 1 <= 2147483647; {7751#(<= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-21 03:03:55,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {7751#(<= |ULTIMATE.start_main_~k~0#1| 0)} assume main_~N~0#1 - 1 >= -2147483648; {7751#(<= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-21 03:03:55,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {7751#(<= |ULTIMATE.start_main_~k~0#1| 0)} assume !!(main_~k~0#1 < main_~N~0#1 - 1); {7751#(<= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-21 03:03:55,317 INFO L290 TraceCheckUtils]: 10: Hoare triple {7751#(<= |ULTIMATE.start_main_~k~0#1| 0)} assume 1 + main_~k~0#1 <= 2147483647; {7751#(<= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-21 03:03:55,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {7751#(<= |ULTIMATE.start_main_~k~0#1| 0)} assume 1 + main_~k~0#1 >= -2147483648;main_~k~0#1 := 1 + main_~k~0#1; {7752#(<= |ULTIMATE.start_main_~k~0#1| 1)} is VALID [2022-02-21 03:03:55,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {7752#(<= |ULTIMATE.start_main_~k~0#1| 1)} assume main_~N~0#1 - 1 <= 2147483647; {7752#(<= |ULTIMATE.start_main_~k~0#1| 1)} is VALID [2022-02-21 03:03:55,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {7752#(<= |ULTIMATE.start_main_~k~0#1| 1)} assume main_~N~0#1 - 1 >= -2147483648; {7752#(<= |ULTIMATE.start_main_~k~0#1| 1)} is VALID [2022-02-21 03:03:55,318 INFO L290 TraceCheckUtils]: 14: Hoare triple {7752#(<= |ULTIMATE.start_main_~k~0#1| 1)} assume !!(main_~k~0#1 < main_~N~0#1 - 1); {7752#(<= |ULTIMATE.start_main_~k~0#1| 1)} is VALID [2022-02-21 03:03:55,319 INFO L290 TraceCheckUtils]: 15: Hoare triple {7752#(<= |ULTIMATE.start_main_~k~0#1| 1)} assume 1 + main_~k~0#1 <= 2147483647; {7752#(<= |ULTIMATE.start_main_~k~0#1| 1)} is VALID [2022-02-21 03:03:55,319 INFO L290 TraceCheckUtils]: 16: Hoare triple {7752#(<= |ULTIMATE.start_main_~k~0#1| 1)} assume 1 + main_~k~0#1 >= -2147483648;main_~k~0#1 := 1 + main_~k~0#1; {7753#(<= |ULTIMATE.start_main_~k~0#1| 2)} is VALID [2022-02-21 03:03:55,319 INFO L290 TraceCheckUtils]: 17: Hoare triple {7753#(<= |ULTIMATE.start_main_~k~0#1| 2)} assume main_~N~0#1 - 1 <= 2147483647; {7753#(<= |ULTIMATE.start_main_~k~0#1| 2)} is VALID [2022-02-21 03:03:55,320 INFO L290 TraceCheckUtils]: 18: Hoare triple {7753#(<= |ULTIMATE.start_main_~k~0#1| 2)} assume main_~N~0#1 - 1 >= -2147483648; {7753#(<= |ULTIMATE.start_main_~k~0#1| 2)} is VALID [2022-02-21 03:03:55,320 INFO L290 TraceCheckUtils]: 19: Hoare triple {7753#(<= |ULTIMATE.start_main_~k~0#1| 2)} assume !!(main_~k~0#1 < main_~N~0#1 - 1); {7753#(<= |ULTIMATE.start_main_~k~0#1| 2)} is VALID [2022-02-21 03:03:55,320 INFO L290 TraceCheckUtils]: 20: Hoare triple {7753#(<= |ULTIMATE.start_main_~k~0#1| 2)} assume 1 + main_~k~0#1 <= 2147483647; {7753#(<= |ULTIMATE.start_main_~k~0#1| 2)} is VALID [2022-02-21 03:03:55,321 INFO L290 TraceCheckUtils]: 21: Hoare triple {7753#(<= |ULTIMATE.start_main_~k~0#1| 2)} assume 1 + main_~k~0#1 >= -2147483648;main_~k~0#1 := 1 + main_~k~0#1; {7754#(<= |ULTIMATE.start_main_~k~0#1| 3)} is VALID [2022-02-21 03:03:55,321 INFO L290 TraceCheckUtils]: 22: Hoare triple {7754#(<= |ULTIMATE.start_main_~k~0#1| 3)} assume main_~N~0#1 - 1 <= 2147483647; {7754#(<= |ULTIMATE.start_main_~k~0#1| 3)} is VALID [2022-02-21 03:03:55,321 INFO L290 TraceCheckUtils]: 23: Hoare triple {7754#(<= |ULTIMATE.start_main_~k~0#1| 3)} assume main_~N~0#1 - 1 >= -2147483648; {7754#(<= |ULTIMATE.start_main_~k~0#1| 3)} is VALID [2022-02-21 03:03:55,322 INFO L290 TraceCheckUtils]: 24: Hoare triple {7754#(<= |ULTIMATE.start_main_~k~0#1| 3)} assume !!(main_~k~0#1 < main_~N~0#1 - 1); {7754#(<= |ULTIMATE.start_main_~k~0#1| 3)} is VALID [2022-02-21 03:03:55,322 INFO L290 TraceCheckUtils]: 25: Hoare triple {7754#(<= |ULTIMATE.start_main_~k~0#1| 3)} assume 1 + main_~k~0#1 <= 2147483647; {7754#(<= |ULTIMATE.start_main_~k~0#1| 3)} is VALID [2022-02-21 03:03:55,322 INFO L290 TraceCheckUtils]: 26: Hoare triple {7754#(<= |ULTIMATE.start_main_~k~0#1| 3)} assume 1 + main_~k~0#1 >= -2147483648;main_~k~0#1 := 1 + main_~k~0#1; {7755#(<= |ULTIMATE.start_main_~k~0#1| 4)} is VALID [2022-02-21 03:03:55,323 INFO L290 TraceCheckUtils]: 27: Hoare triple {7755#(<= |ULTIMATE.start_main_~k~0#1| 4)} assume main_~N~0#1 - 1 <= 2147483647; {7755#(<= |ULTIMATE.start_main_~k~0#1| 4)} is VALID [2022-02-21 03:03:55,323 INFO L290 TraceCheckUtils]: 28: Hoare triple {7755#(<= |ULTIMATE.start_main_~k~0#1| 4)} assume main_~N~0#1 - 1 >= -2147483648; {7755#(<= |ULTIMATE.start_main_~k~0#1| 4)} is VALID [2022-02-21 03:03:55,323 INFO L290 TraceCheckUtils]: 29: Hoare triple {7755#(<= |ULTIMATE.start_main_~k~0#1| 4)} assume !!(main_~k~0#1 < main_~N~0#1 - 1); {7755#(<= |ULTIMATE.start_main_~k~0#1| 4)} is VALID [2022-02-21 03:03:55,324 INFO L290 TraceCheckUtils]: 30: Hoare triple {7755#(<= |ULTIMATE.start_main_~k~0#1| 4)} assume 1 + main_~k~0#1 <= 2147483647; {7755#(<= |ULTIMATE.start_main_~k~0#1| 4)} is VALID [2022-02-21 03:03:55,324 INFO L290 TraceCheckUtils]: 31: Hoare triple {7755#(<= |ULTIMATE.start_main_~k~0#1| 4)} assume 1 + main_~k~0#1 >= -2147483648;main_~k~0#1 := 1 + main_~k~0#1; {7756#(<= |ULTIMATE.start_main_~k~0#1| 5)} is VALID [2022-02-21 03:03:55,325 INFO L290 TraceCheckUtils]: 32: Hoare triple {7756#(<= |ULTIMATE.start_main_~k~0#1| 5)} assume main_~N~0#1 - 1 <= 2147483647; {7756#(<= |ULTIMATE.start_main_~k~0#1| 5)} is VALID [2022-02-21 03:03:55,325 INFO L290 TraceCheckUtils]: 33: Hoare triple {7756#(<= |ULTIMATE.start_main_~k~0#1| 5)} assume main_~N~0#1 - 1 >= -2147483648; {7756#(<= |ULTIMATE.start_main_~k~0#1| 5)} is VALID [2022-02-21 03:03:55,325 INFO L290 TraceCheckUtils]: 34: Hoare triple {7756#(<= |ULTIMATE.start_main_~k~0#1| 5)} assume !!(main_~k~0#1 < main_~N~0#1 - 1); {7756#(<= |ULTIMATE.start_main_~k~0#1| 5)} is VALID [2022-02-21 03:03:55,326 INFO L290 TraceCheckUtils]: 35: Hoare triple {7756#(<= |ULTIMATE.start_main_~k~0#1| 5)} assume 1 + main_~k~0#1 <= 2147483647; {7756#(<= |ULTIMATE.start_main_~k~0#1| 5)} is VALID [2022-02-21 03:03:55,326 INFO L290 TraceCheckUtils]: 36: Hoare triple {7756#(<= |ULTIMATE.start_main_~k~0#1| 5)} assume 1 + main_~k~0#1 >= -2147483648;main_~k~0#1 := 1 + main_~k~0#1; {7757#(<= |ULTIMATE.start_main_~k~0#1| 6)} is VALID [2022-02-21 03:03:55,326 INFO L290 TraceCheckUtils]: 37: Hoare triple {7757#(<= |ULTIMATE.start_main_~k~0#1| 6)} assume main_~N~0#1 - 1 <= 2147483647; {7757#(<= |ULTIMATE.start_main_~k~0#1| 6)} is VALID [2022-02-21 03:03:55,327 INFO L290 TraceCheckUtils]: 38: Hoare triple {7757#(<= |ULTIMATE.start_main_~k~0#1| 6)} assume main_~N~0#1 - 1 >= -2147483648; {7757#(<= |ULTIMATE.start_main_~k~0#1| 6)} is VALID [2022-02-21 03:03:55,327 INFO L290 TraceCheckUtils]: 39: Hoare triple {7757#(<= |ULTIMATE.start_main_~k~0#1| 6)} assume !!(main_~k~0#1 < main_~N~0#1 - 1); {7757#(<= |ULTIMATE.start_main_~k~0#1| 6)} is VALID [2022-02-21 03:03:55,327 INFO L290 TraceCheckUtils]: 40: Hoare triple {7757#(<= |ULTIMATE.start_main_~k~0#1| 6)} assume 1 + main_~k~0#1 <= 2147483647; {7757#(<= |ULTIMATE.start_main_~k~0#1| 6)} is VALID [2022-02-21 03:03:55,328 INFO L290 TraceCheckUtils]: 41: Hoare triple {7757#(<= |ULTIMATE.start_main_~k~0#1| 6)} assume 1 + main_~k~0#1 >= -2147483648;main_~k~0#1 := 1 + main_~k~0#1; {7758#(<= |ULTIMATE.start_main_~k~0#1| 7)} is VALID [2022-02-21 03:03:55,328 INFO L290 TraceCheckUtils]: 42: Hoare triple {7758#(<= |ULTIMATE.start_main_~k~0#1| 7)} assume main_~N~0#1 - 1 <= 2147483647; {7758#(<= |ULTIMATE.start_main_~k~0#1| 7)} is VALID [2022-02-21 03:03:55,328 INFO L290 TraceCheckUtils]: 43: Hoare triple {7758#(<= |ULTIMATE.start_main_~k~0#1| 7)} assume main_~N~0#1 - 1 >= -2147483648; {7758#(<= |ULTIMATE.start_main_~k~0#1| 7)} is VALID [2022-02-21 03:03:55,329 INFO L290 TraceCheckUtils]: 44: Hoare triple {7758#(<= |ULTIMATE.start_main_~k~0#1| 7)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {7758#(<= |ULTIMATE.start_main_~k~0#1| 7)} is VALID [2022-02-21 03:03:55,329 INFO L290 TraceCheckUtils]: 45: Hoare triple {7758#(<= |ULTIMATE.start_main_~k~0#1| 7)} main_~i~0#1 := main_~k~0#1; {7759#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:03:55,329 INFO L290 TraceCheckUtils]: 46: Hoare triple {7759#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !(main_~j~0#1 < main_~m~0#1); {7759#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:03:55,330 INFO L290 TraceCheckUtils]: 47: Hoare triple {7759#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume 1 + main_~i~0#1 <= 2147483647; {7759#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:03:55,330 INFO L290 TraceCheckUtils]: 48: Hoare triple {7759#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1; {7760#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:03:55,330 INFO L290 TraceCheckUtils]: 49: Hoare triple {7760#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {7760#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:03:55,331 INFO L290 TraceCheckUtils]: 50: Hoare triple {7760#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~j~0#1 < main_~m~0#1); {7760#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:03:55,331 INFO L290 TraceCheckUtils]: 51: Hoare triple {7760#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume 1 + main_~j~0#1 <= 2147483647; {7760#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:03:55,331 INFO L290 TraceCheckUtils]: 52: Hoare triple {7760#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {7761#(<= |ULTIMATE.start_main_~k~0#1| 8)} is VALID [2022-02-21 03:03:55,332 INFO L290 TraceCheckUtils]: 53: Hoare triple {7761#(<= |ULTIMATE.start_main_~k~0#1| 8)} assume main_~N~0#1 - 1 <= 2147483647; {7761#(<= |ULTIMATE.start_main_~k~0#1| 8)} is VALID [2022-02-21 03:03:55,332 INFO L290 TraceCheckUtils]: 54: Hoare triple {7761#(<= |ULTIMATE.start_main_~k~0#1| 8)} assume main_~N~0#1 - 1 >= -2147483648; {7761#(<= |ULTIMATE.start_main_~k~0#1| 8)} is VALID [2022-02-21 03:03:55,332 INFO L290 TraceCheckUtils]: 55: Hoare triple {7761#(<= |ULTIMATE.start_main_~k~0#1| 8)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {7761#(<= |ULTIMATE.start_main_~k~0#1| 8)} is VALID [2022-02-21 03:03:55,332 INFO L290 TraceCheckUtils]: 56: Hoare triple {7761#(<= |ULTIMATE.start_main_~k~0#1| 8)} main_~i~0#1 := main_~k~0#1; {7760#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:03:55,333 INFO L290 TraceCheckUtils]: 57: Hoare triple {7760#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !(main_~j~0#1 < main_~m~0#1); {7760#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:03:55,333 INFO L290 TraceCheckUtils]: 58: Hoare triple {7760#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !(1 + main_~i~0#1 <= 2147483647); {7749#false} is VALID [2022-02-21 03:03:55,334 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 160 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:03:55,334 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:55,334 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944529946] [2022-02-21 03:03:55,334 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944529946] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:03:55,334 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408812500] [2022-02-21 03:03:55,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:03:55,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:55,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:55,336 INFO L229 MonitoredProcess]: Starting monitored process 9 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:55,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-21 03:03:55,390 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:03:55,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:03:55,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-21 03:03:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:55,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:03:55,703 INFO L290 TraceCheckUtils]: 0: Hoare triple {7748#true} assume { :begin_inline_ULTIMATE.init } true; {7748#true} is VALID [2022-02-21 03:03:55,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {7748#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {7748#true} is VALID [2022-02-21 03:03:55,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {7748#true} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {7750#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:55,704 INFO L290 TraceCheckUtils]: 3: Hoare triple {7750#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {7750#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:55,705 INFO L290 TraceCheckUtils]: 4: Hoare triple {7750#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~0#1 < main_~m~0#1); {7750#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:55,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {7750#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 1 + main_~j~0#1 <= 2147483647; {7750#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:03:55,705 INFO L290 TraceCheckUtils]: 6: Hoare triple {7750#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {7751#(<= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-21 03:03:55,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {7751#(<= |ULTIMATE.start_main_~k~0#1| 0)} assume main_~N~0#1 - 1 <= 2147483647; {7751#(<= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-21 03:03:55,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {7751#(<= |ULTIMATE.start_main_~k~0#1| 0)} assume main_~N~0#1 - 1 >= -2147483648; {7751#(<= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-21 03:03:55,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {7751#(<= |ULTIMATE.start_main_~k~0#1| 0)} assume !!(main_~k~0#1 < main_~N~0#1 - 1); {7751#(<= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-21 03:03:55,706 INFO L290 TraceCheckUtils]: 10: Hoare triple {7751#(<= |ULTIMATE.start_main_~k~0#1| 0)} assume 1 + main_~k~0#1 <= 2147483647; {7751#(<= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-21 03:03:55,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {7751#(<= |ULTIMATE.start_main_~k~0#1| 0)} assume 1 + main_~k~0#1 >= -2147483648;main_~k~0#1 := 1 + main_~k~0#1; {7752#(<= |ULTIMATE.start_main_~k~0#1| 1)} is VALID [2022-02-21 03:03:55,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {7752#(<= |ULTIMATE.start_main_~k~0#1| 1)} assume main_~N~0#1 - 1 <= 2147483647; {7752#(<= |ULTIMATE.start_main_~k~0#1| 1)} is VALID [2022-02-21 03:03:55,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {7752#(<= |ULTIMATE.start_main_~k~0#1| 1)} assume main_~N~0#1 - 1 >= -2147483648; {7752#(<= |ULTIMATE.start_main_~k~0#1| 1)} is VALID [2022-02-21 03:03:55,708 INFO L290 TraceCheckUtils]: 14: Hoare triple {7752#(<= |ULTIMATE.start_main_~k~0#1| 1)} assume !!(main_~k~0#1 < main_~N~0#1 - 1); {7752#(<= |ULTIMATE.start_main_~k~0#1| 1)} is VALID [2022-02-21 03:03:55,708 INFO L290 TraceCheckUtils]: 15: Hoare triple {7752#(<= |ULTIMATE.start_main_~k~0#1| 1)} assume 1 + main_~k~0#1 <= 2147483647; {7752#(<= |ULTIMATE.start_main_~k~0#1| 1)} is VALID [2022-02-21 03:03:55,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {7752#(<= |ULTIMATE.start_main_~k~0#1| 1)} assume 1 + main_~k~0#1 >= -2147483648;main_~k~0#1 := 1 + main_~k~0#1; {7753#(<= |ULTIMATE.start_main_~k~0#1| 2)} is VALID [2022-02-21 03:03:55,708 INFO L290 TraceCheckUtils]: 17: Hoare triple {7753#(<= |ULTIMATE.start_main_~k~0#1| 2)} assume main_~N~0#1 - 1 <= 2147483647; {7753#(<= |ULTIMATE.start_main_~k~0#1| 2)} is VALID [2022-02-21 03:03:55,709 INFO L290 TraceCheckUtils]: 18: Hoare triple {7753#(<= |ULTIMATE.start_main_~k~0#1| 2)} assume main_~N~0#1 - 1 >= -2147483648; {7753#(<= |ULTIMATE.start_main_~k~0#1| 2)} is VALID [2022-02-21 03:03:55,709 INFO L290 TraceCheckUtils]: 19: Hoare triple {7753#(<= |ULTIMATE.start_main_~k~0#1| 2)} assume !!(main_~k~0#1 < main_~N~0#1 - 1); {7753#(<= |ULTIMATE.start_main_~k~0#1| 2)} is VALID [2022-02-21 03:03:55,709 INFO L290 TraceCheckUtils]: 20: Hoare triple {7753#(<= |ULTIMATE.start_main_~k~0#1| 2)} assume 1 + main_~k~0#1 <= 2147483647; {7753#(<= |ULTIMATE.start_main_~k~0#1| 2)} is VALID [2022-02-21 03:03:55,710 INFO L290 TraceCheckUtils]: 21: Hoare triple {7753#(<= |ULTIMATE.start_main_~k~0#1| 2)} assume 1 + main_~k~0#1 >= -2147483648;main_~k~0#1 := 1 + main_~k~0#1; {7754#(<= |ULTIMATE.start_main_~k~0#1| 3)} is VALID [2022-02-21 03:03:55,710 INFO L290 TraceCheckUtils]: 22: Hoare triple {7754#(<= |ULTIMATE.start_main_~k~0#1| 3)} assume main_~N~0#1 - 1 <= 2147483647; {7754#(<= |ULTIMATE.start_main_~k~0#1| 3)} is VALID [2022-02-21 03:03:55,710 INFO L290 TraceCheckUtils]: 23: Hoare triple {7754#(<= |ULTIMATE.start_main_~k~0#1| 3)} assume main_~N~0#1 - 1 >= -2147483648; {7754#(<= |ULTIMATE.start_main_~k~0#1| 3)} is VALID [2022-02-21 03:03:55,710 INFO L290 TraceCheckUtils]: 24: Hoare triple {7754#(<= |ULTIMATE.start_main_~k~0#1| 3)} assume !!(main_~k~0#1 < main_~N~0#1 - 1); {7754#(<= |ULTIMATE.start_main_~k~0#1| 3)} is VALID [2022-02-21 03:03:55,711 INFO L290 TraceCheckUtils]: 25: Hoare triple {7754#(<= |ULTIMATE.start_main_~k~0#1| 3)} assume 1 + main_~k~0#1 <= 2147483647; {7754#(<= |ULTIMATE.start_main_~k~0#1| 3)} is VALID [2022-02-21 03:03:55,711 INFO L290 TraceCheckUtils]: 26: Hoare triple {7754#(<= |ULTIMATE.start_main_~k~0#1| 3)} assume 1 + main_~k~0#1 >= -2147483648;main_~k~0#1 := 1 + main_~k~0#1; {7755#(<= |ULTIMATE.start_main_~k~0#1| 4)} is VALID [2022-02-21 03:03:55,711 INFO L290 TraceCheckUtils]: 27: Hoare triple {7755#(<= |ULTIMATE.start_main_~k~0#1| 4)} assume main_~N~0#1 - 1 <= 2147483647; {7755#(<= |ULTIMATE.start_main_~k~0#1| 4)} is VALID [2022-02-21 03:03:55,712 INFO L290 TraceCheckUtils]: 28: Hoare triple {7755#(<= |ULTIMATE.start_main_~k~0#1| 4)} assume main_~N~0#1 - 1 >= -2147483648; {7755#(<= |ULTIMATE.start_main_~k~0#1| 4)} is VALID [2022-02-21 03:03:55,712 INFO L290 TraceCheckUtils]: 29: Hoare triple {7755#(<= |ULTIMATE.start_main_~k~0#1| 4)} assume !!(main_~k~0#1 < main_~N~0#1 - 1); {7755#(<= |ULTIMATE.start_main_~k~0#1| 4)} is VALID [2022-02-21 03:03:55,712 INFO L290 TraceCheckUtils]: 30: Hoare triple {7755#(<= |ULTIMATE.start_main_~k~0#1| 4)} assume 1 + main_~k~0#1 <= 2147483647; {7755#(<= |ULTIMATE.start_main_~k~0#1| 4)} is VALID [2022-02-21 03:03:55,713 INFO L290 TraceCheckUtils]: 31: Hoare triple {7755#(<= |ULTIMATE.start_main_~k~0#1| 4)} assume 1 + main_~k~0#1 >= -2147483648;main_~k~0#1 := 1 + main_~k~0#1; {7756#(<= |ULTIMATE.start_main_~k~0#1| 5)} is VALID [2022-02-21 03:03:55,713 INFO L290 TraceCheckUtils]: 32: Hoare triple {7756#(<= |ULTIMATE.start_main_~k~0#1| 5)} assume main_~N~0#1 - 1 <= 2147483647; {7756#(<= |ULTIMATE.start_main_~k~0#1| 5)} is VALID [2022-02-21 03:03:55,713 INFO L290 TraceCheckUtils]: 33: Hoare triple {7756#(<= |ULTIMATE.start_main_~k~0#1| 5)} assume main_~N~0#1 - 1 >= -2147483648; {7756#(<= |ULTIMATE.start_main_~k~0#1| 5)} is VALID [2022-02-21 03:03:55,713 INFO L290 TraceCheckUtils]: 34: Hoare triple {7756#(<= |ULTIMATE.start_main_~k~0#1| 5)} assume !!(main_~k~0#1 < main_~N~0#1 - 1); {7756#(<= |ULTIMATE.start_main_~k~0#1| 5)} is VALID [2022-02-21 03:03:55,714 INFO L290 TraceCheckUtils]: 35: Hoare triple {7756#(<= |ULTIMATE.start_main_~k~0#1| 5)} assume 1 + main_~k~0#1 <= 2147483647; {7756#(<= |ULTIMATE.start_main_~k~0#1| 5)} is VALID [2022-02-21 03:03:55,714 INFO L290 TraceCheckUtils]: 36: Hoare triple {7756#(<= |ULTIMATE.start_main_~k~0#1| 5)} assume 1 + main_~k~0#1 >= -2147483648;main_~k~0#1 := 1 + main_~k~0#1; {7757#(<= |ULTIMATE.start_main_~k~0#1| 6)} is VALID [2022-02-21 03:03:55,714 INFO L290 TraceCheckUtils]: 37: Hoare triple {7757#(<= |ULTIMATE.start_main_~k~0#1| 6)} assume main_~N~0#1 - 1 <= 2147483647; {7757#(<= |ULTIMATE.start_main_~k~0#1| 6)} is VALID [2022-02-21 03:03:55,715 INFO L290 TraceCheckUtils]: 38: Hoare triple {7757#(<= |ULTIMATE.start_main_~k~0#1| 6)} assume main_~N~0#1 - 1 >= -2147483648; {7757#(<= |ULTIMATE.start_main_~k~0#1| 6)} is VALID [2022-02-21 03:03:55,715 INFO L290 TraceCheckUtils]: 39: Hoare triple {7757#(<= |ULTIMATE.start_main_~k~0#1| 6)} assume !!(main_~k~0#1 < main_~N~0#1 - 1); {7757#(<= |ULTIMATE.start_main_~k~0#1| 6)} is VALID [2022-02-21 03:03:55,715 INFO L290 TraceCheckUtils]: 40: Hoare triple {7757#(<= |ULTIMATE.start_main_~k~0#1| 6)} assume 1 + main_~k~0#1 <= 2147483647; {7757#(<= |ULTIMATE.start_main_~k~0#1| 6)} is VALID [2022-02-21 03:03:55,715 INFO L290 TraceCheckUtils]: 41: Hoare triple {7757#(<= |ULTIMATE.start_main_~k~0#1| 6)} assume 1 + main_~k~0#1 >= -2147483648;main_~k~0#1 := 1 + main_~k~0#1; {7758#(<= |ULTIMATE.start_main_~k~0#1| 7)} is VALID [2022-02-21 03:03:55,716 INFO L290 TraceCheckUtils]: 42: Hoare triple {7758#(<= |ULTIMATE.start_main_~k~0#1| 7)} assume main_~N~0#1 - 1 <= 2147483647; {7758#(<= |ULTIMATE.start_main_~k~0#1| 7)} is VALID [2022-02-21 03:03:55,716 INFO L290 TraceCheckUtils]: 43: Hoare triple {7758#(<= |ULTIMATE.start_main_~k~0#1| 7)} assume main_~N~0#1 - 1 >= -2147483648; {7758#(<= |ULTIMATE.start_main_~k~0#1| 7)} is VALID [2022-02-21 03:03:55,716 INFO L290 TraceCheckUtils]: 44: Hoare triple {7758#(<= |ULTIMATE.start_main_~k~0#1| 7)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {7758#(<= |ULTIMATE.start_main_~k~0#1| 7)} is VALID [2022-02-21 03:03:55,717 INFO L290 TraceCheckUtils]: 45: Hoare triple {7758#(<= |ULTIMATE.start_main_~k~0#1| 7)} main_~i~0#1 := main_~k~0#1; {7759#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:03:55,717 INFO L290 TraceCheckUtils]: 46: Hoare triple {7759#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !(main_~j~0#1 < main_~m~0#1); {7759#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:03:55,717 INFO L290 TraceCheckUtils]: 47: Hoare triple {7759#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume 1 + main_~i~0#1 <= 2147483647; {7759#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:03:55,717 INFO L290 TraceCheckUtils]: 48: Hoare triple {7759#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1; {7760#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:03:55,718 INFO L290 TraceCheckUtils]: 49: Hoare triple {7760#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {7760#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:03:55,718 INFO L290 TraceCheckUtils]: 50: Hoare triple {7760#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~j~0#1 < main_~m~0#1); {7760#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:03:55,718 INFO L290 TraceCheckUtils]: 51: Hoare triple {7760#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume 1 + main_~j~0#1 <= 2147483647; {7760#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:03:55,719 INFO L290 TraceCheckUtils]: 52: Hoare triple {7760#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {7761#(<= |ULTIMATE.start_main_~k~0#1| 8)} is VALID [2022-02-21 03:03:55,719 INFO L290 TraceCheckUtils]: 53: Hoare triple {7761#(<= |ULTIMATE.start_main_~k~0#1| 8)} assume main_~N~0#1 - 1 <= 2147483647; {7761#(<= |ULTIMATE.start_main_~k~0#1| 8)} is VALID [2022-02-21 03:03:55,719 INFO L290 TraceCheckUtils]: 54: Hoare triple {7761#(<= |ULTIMATE.start_main_~k~0#1| 8)} assume main_~N~0#1 - 1 >= -2147483648; {7761#(<= |ULTIMATE.start_main_~k~0#1| 8)} is VALID [2022-02-21 03:03:55,720 INFO L290 TraceCheckUtils]: 55: Hoare triple {7761#(<= |ULTIMATE.start_main_~k~0#1| 8)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {7761#(<= |ULTIMATE.start_main_~k~0#1| 8)} is VALID [2022-02-21 03:03:55,720 INFO L290 TraceCheckUtils]: 56: Hoare triple {7761#(<= |ULTIMATE.start_main_~k~0#1| 8)} main_~i~0#1 := main_~k~0#1; {7760#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:03:55,720 INFO L290 TraceCheckUtils]: 57: Hoare triple {7760#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !(main_~j~0#1 < main_~m~0#1); {7760#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:03:55,720 INFO L290 TraceCheckUtils]: 58: Hoare triple {7760#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !(1 + main_~i~0#1 <= 2147483647); {7749#false} is VALID [2022-02-21 03:03:55,721 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 160 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:03:55,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:03:56,100 INFO L290 TraceCheckUtils]: 58: Hoare triple {7939#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !(1 + main_~i~0#1 <= 2147483647); {7749#false} is VALID [2022-02-21 03:03:56,101 INFO L290 TraceCheckUtils]: 57: Hoare triple {7939#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !(main_~j~0#1 < main_~m~0#1); {7939#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:03:56,101 INFO L290 TraceCheckUtils]: 56: Hoare triple {7946#(<= |ULTIMATE.start_main_~k~0#1| 2147483646)} main_~i~0#1 := main_~k~0#1; {7939#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:03:56,101 INFO L290 TraceCheckUtils]: 55: Hoare triple {7946#(<= |ULTIMATE.start_main_~k~0#1| 2147483646)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {7946#(<= |ULTIMATE.start_main_~k~0#1| 2147483646)} is VALID [2022-02-21 03:03:56,102 INFO L290 TraceCheckUtils]: 54: Hoare triple {7946#(<= |ULTIMATE.start_main_~k~0#1| 2147483646)} assume main_~N~0#1 - 1 >= -2147483648; {7946#(<= |ULTIMATE.start_main_~k~0#1| 2147483646)} is VALID [2022-02-21 03:03:56,102 INFO L290 TraceCheckUtils]: 53: Hoare triple {7946#(<= |ULTIMATE.start_main_~k~0#1| 2147483646)} assume main_~N~0#1 - 1 <= 2147483647; {7946#(<= |ULTIMATE.start_main_~k~0#1| 2147483646)} is VALID [2022-02-21 03:03:56,102 INFO L290 TraceCheckUtils]: 52: Hoare triple {7939#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {7946#(<= |ULTIMATE.start_main_~k~0#1| 2147483646)} is VALID [2022-02-21 03:03:56,103 INFO L290 TraceCheckUtils]: 51: Hoare triple {7939#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume 1 + main_~j~0#1 <= 2147483647; {7939#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:03:56,103 INFO L290 TraceCheckUtils]: 50: Hoare triple {7939#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !!(main_~j~0#1 < main_~m~0#1); {7939#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:03:56,103 INFO L290 TraceCheckUtils]: 49: Hoare triple {7939#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {7939#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:03:56,103 INFO L290 TraceCheckUtils]: 48: Hoare triple {7971#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1; {7939#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:03:56,104 INFO L290 TraceCheckUtils]: 47: Hoare triple {7971#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume 1 + main_~i~0#1 <= 2147483647; {7971#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:03:56,104 INFO L290 TraceCheckUtils]: 46: Hoare triple {7971#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume !(main_~j~0#1 < main_~m~0#1); {7971#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:03:56,104 INFO L290 TraceCheckUtils]: 45: Hoare triple {7981#(<= |ULTIMATE.start_main_~k~0#1| 2147483645)} main_~i~0#1 := main_~k~0#1; {7971#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:03:56,105 INFO L290 TraceCheckUtils]: 44: Hoare triple {7981#(<= |ULTIMATE.start_main_~k~0#1| 2147483645)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {7981#(<= |ULTIMATE.start_main_~k~0#1| 2147483645)} is VALID [2022-02-21 03:03:56,105 INFO L290 TraceCheckUtils]: 43: Hoare triple {7981#(<= |ULTIMATE.start_main_~k~0#1| 2147483645)} assume main_~N~0#1 - 1 >= -2147483648; {7981#(<= |ULTIMATE.start_main_~k~0#1| 2147483645)} is VALID [2022-02-21 03:03:56,105 INFO L290 TraceCheckUtils]: 42: Hoare triple {7981#(<= |ULTIMATE.start_main_~k~0#1| 2147483645)} assume main_~N~0#1 - 1 <= 2147483647; {7981#(<= |ULTIMATE.start_main_~k~0#1| 2147483645)} is VALID [2022-02-21 03:03:56,105 INFO L290 TraceCheckUtils]: 41: Hoare triple {7994#(<= |ULTIMATE.start_main_~k~0#1| 2147483644)} assume 1 + main_~k~0#1 >= -2147483648;main_~k~0#1 := 1 + main_~k~0#1; {7981#(<= |ULTIMATE.start_main_~k~0#1| 2147483645)} is VALID [2022-02-21 03:03:56,106 INFO L290 TraceCheckUtils]: 40: Hoare triple {7994#(<= |ULTIMATE.start_main_~k~0#1| 2147483644)} assume 1 + main_~k~0#1 <= 2147483647; {7994#(<= |ULTIMATE.start_main_~k~0#1| 2147483644)} is VALID [2022-02-21 03:03:56,106 INFO L290 TraceCheckUtils]: 39: Hoare triple {7994#(<= |ULTIMATE.start_main_~k~0#1| 2147483644)} assume !!(main_~k~0#1 < main_~N~0#1 - 1); {7994#(<= |ULTIMATE.start_main_~k~0#1| 2147483644)} is VALID [2022-02-21 03:03:56,106 INFO L290 TraceCheckUtils]: 38: Hoare triple {7994#(<= |ULTIMATE.start_main_~k~0#1| 2147483644)} assume main_~N~0#1 - 1 >= -2147483648; {7994#(<= |ULTIMATE.start_main_~k~0#1| 2147483644)} is VALID [2022-02-21 03:03:56,106 INFO L290 TraceCheckUtils]: 37: Hoare triple {7994#(<= |ULTIMATE.start_main_~k~0#1| 2147483644)} assume main_~N~0#1 - 1 <= 2147483647; {7994#(<= |ULTIMATE.start_main_~k~0#1| 2147483644)} is VALID [2022-02-21 03:03:56,107 INFO L290 TraceCheckUtils]: 36: Hoare triple {8010#(<= |ULTIMATE.start_main_~k~0#1| 2147483643)} assume 1 + main_~k~0#1 >= -2147483648;main_~k~0#1 := 1 + main_~k~0#1; {7994#(<= |ULTIMATE.start_main_~k~0#1| 2147483644)} is VALID [2022-02-21 03:03:56,107 INFO L290 TraceCheckUtils]: 35: Hoare triple {8010#(<= |ULTIMATE.start_main_~k~0#1| 2147483643)} assume 1 + main_~k~0#1 <= 2147483647; {8010#(<= |ULTIMATE.start_main_~k~0#1| 2147483643)} is VALID [2022-02-21 03:03:56,107 INFO L290 TraceCheckUtils]: 34: Hoare triple {8010#(<= |ULTIMATE.start_main_~k~0#1| 2147483643)} assume !!(main_~k~0#1 < main_~N~0#1 - 1); {8010#(<= |ULTIMATE.start_main_~k~0#1| 2147483643)} is VALID [2022-02-21 03:03:56,108 INFO L290 TraceCheckUtils]: 33: Hoare triple {8010#(<= |ULTIMATE.start_main_~k~0#1| 2147483643)} assume main_~N~0#1 - 1 >= -2147483648; {8010#(<= |ULTIMATE.start_main_~k~0#1| 2147483643)} is VALID [2022-02-21 03:03:56,108 INFO L290 TraceCheckUtils]: 32: Hoare triple {8010#(<= |ULTIMATE.start_main_~k~0#1| 2147483643)} assume main_~N~0#1 - 1 <= 2147483647; {8010#(<= |ULTIMATE.start_main_~k~0#1| 2147483643)} is VALID [2022-02-21 03:03:56,109 INFO L290 TraceCheckUtils]: 31: Hoare triple {8026#(<= |ULTIMATE.start_main_~k~0#1| 2147483642)} assume 1 + main_~k~0#1 >= -2147483648;main_~k~0#1 := 1 + main_~k~0#1; {8010#(<= |ULTIMATE.start_main_~k~0#1| 2147483643)} is VALID [2022-02-21 03:03:56,109 INFO L290 TraceCheckUtils]: 30: Hoare triple {8026#(<= |ULTIMATE.start_main_~k~0#1| 2147483642)} assume 1 + main_~k~0#1 <= 2147483647; {8026#(<= |ULTIMATE.start_main_~k~0#1| 2147483642)} is VALID [2022-02-21 03:03:56,109 INFO L290 TraceCheckUtils]: 29: Hoare triple {8026#(<= |ULTIMATE.start_main_~k~0#1| 2147483642)} assume !!(main_~k~0#1 < main_~N~0#1 - 1); {8026#(<= |ULTIMATE.start_main_~k~0#1| 2147483642)} is VALID [2022-02-21 03:03:56,110 INFO L290 TraceCheckUtils]: 28: Hoare triple {8026#(<= |ULTIMATE.start_main_~k~0#1| 2147483642)} assume main_~N~0#1 - 1 >= -2147483648; {8026#(<= |ULTIMATE.start_main_~k~0#1| 2147483642)} is VALID [2022-02-21 03:03:56,110 INFO L290 TraceCheckUtils]: 27: Hoare triple {8026#(<= |ULTIMATE.start_main_~k~0#1| 2147483642)} assume main_~N~0#1 - 1 <= 2147483647; {8026#(<= |ULTIMATE.start_main_~k~0#1| 2147483642)} is VALID [2022-02-21 03:03:56,110 INFO L290 TraceCheckUtils]: 26: Hoare triple {8042#(<= |ULTIMATE.start_main_~k~0#1| 2147483641)} assume 1 + main_~k~0#1 >= -2147483648;main_~k~0#1 := 1 + main_~k~0#1; {8026#(<= |ULTIMATE.start_main_~k~0#1| 2147483642)} is VALID [2022-02-21 03:03:56,110 INFO L290 TraceCheckUtils]: 25: Hoare triple {8042#(<= |ULTIMATE.start_main_~k~0#1| 2147483641)} assume 1 + main_~k~0#1 <= 2147483647; {8042#(<= |ULTIMATE.start_main_~k~0#1| 2147483641)} is VALID [2022-02-21 03:03:56,112 INFO L290 TraceCheckUtils]: 24: Hoare triple {8042#(<= |ULTIMATE.start_main_~k~0#1| 2147483641)} assume !!(main_~k~0#1 < main_~N~0#1 - 1); {8042#(<= |ULTIMATE.start_main_~k~0#1| 2147483641)} is VALID [2022-02-21 03:03:56,112 INFO L290 TraceCheckUtils]: 23: Hoare triple {8042#(<= |ULTIMATE.start_main_~k~0#1| 2147483641)} assume main_~N~0#1 - 1 >= -2147483648; {8042#(<= |ULTIMATE.start_main_~k~0#1| 2147483641)} is VALID [2022-02-21 03:03:56,112 INFO L290 TraceCheckUtils]: 22: Hoare triple {8042#(<= |ULTIMATE.start_main_~k~0#1| 2147483641)} assume main_~N~0#1 - 1 <= 2147483647; {8042#(<= |ULTIMATE.start_main_~k~0#1| 2147483641)} is VALID [2022-02-21 03:03:56,113 INFO L290 TraceCheckUtils]: 21: Hoare triple {8058#(<= |ULTIMATE.start_main_~k~0#1| 2147483640)} assume 1 + main_~k~0#1 >= -2147483648;main_~k~0#1 := 1 + main_~k~0#1; {8042#(<= |ULTIMATE.start_main_~k~0#1| 2147483641)} is VALID [2022-02-21 03:03:56,113 INFO L290 TraceCheckUtils]: 20: Hoare triple {8058#(<= |ULTIMATE.start_main_~k~0#1| 2147483640)} assume 1 + main_~k~0#1 <= 2147483647; {8058#(<= |ULTIMATE.start_main_~k~0#1| 2147483640)} is VALID [2022-02-21 03:03:56,113 INFO L290 TraceCheckUtils]: 19: Hoare triple {8058#(<= |ULTIMATE.start_main_~k~0#1| 2147483640)} assume !!(main_~k~0#1 < main_~N~0#1 - 1); {8058#(<= |ULTIMATE.start_main_~k~0#1| 2147483640)} is VALID [2022-02-21 03:03:56,114 INFO L290 TraceCheckUtils]: 18: Hoare triple {8058#(<= |ULTIMATE.start_main_~k~0#1| 2147483640)} assume main_~N~0#1 - 1 >= -2147483648; {8058#(<= |ULTIMATE.start_main_~k~0#1| 2147483640)} is VALID [2022-02-21 03:03:56,114 INFO L290 TraceCheckUtils]: 17: Hoare triple {8058#(<= |ULTIMATE.start_main_~k~0#1| 2147483640)} assume main_~N~0#1 - 1 <= 2147483647; {8058#(<= |ULTIMATE.start_main_~k~0#1| 2147483640)} is VALID [2022-02-21 03:03:56,114 INFO L290 TraceCheckUtils]: 16: Hoare triple {8074#(<= |ULTIMATE.start_main_~k~0#1| 2147483639)} assume 1 + main_~k~0#1 >= -2147483648;main_~k~0#1 := 1 + main_~k~0#1; {8058#(<= |ULTIMATE.start_main_~k~0#1| 2147483640)} is VALID [2022-02-21 03:03:56,115 INFO L290 TraceCheckUtils]: 15: Hoare triple {8074#(<= |ULTIMATE.start_main_~k~0#1| 2147483639)} assume 1 + main_~k~0#1 <= 2147483647; {8074#(<= |ULTIMATE.start_main_~k~0#1| 2147483639)} is VALID [2022-02-21 03:03:56,115 INFO L290 TraceCheckUtils]: 14: Hoare triple {8074#(<= |ULTIMATE.start_main_~k~0#1| 2147483639)} assume !!(main_~k~0#1 < main_~N~0#1 - 1); {8074#(<= |ULTIMATE.start_main_~k~0#1| 2147483639)} is VALID [2022-02-21 03:03:56,115 INFO L290 TraceCheckUtils]: 13: Hoare triple {8074#(<= |ULTIMATE.start_main_~k~0#1| 2147483639)} assume main_~N~0#1 - 1 >= -2147483648; {8074#(<= |ULTIMATE.start_main_~k~0#1| 2147483639)} is VALID [2022-02-21 03:03:56,116 INFO L290 TraceCheckUtils]: 12: Hoare triple {8074#(<= |ULTIMATE.start_main_~k~0#1| 2147483639)} assume main_~N~0#1 - 1 <= 2147483647; {8074#(<= |ULTIMATE.start_main_~k~0#1| 2147483639)} is VALID [2022-02-21 03:03:56,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {8090#(<= |ULTIMATE.start_main_~k~0#1| 2147483638)} assume 1 + main_~k~0#1 >= -2147483648;main_~k~0#1 := 1 + main_~k~0#1; {8074#(<= |ULTIMATE.start_main_~k~0#1| 2147483639)} is VALID [2022-02-21 03:03:56,116 INFO L290 TraceCheckUtils]: 10: Hoare triple {8090#(<= |ULTIMATE.start_main_~k~0#1| 2147483638)} assume 1 + main_~k~0#1 <= 2147483647; {8090#(<= |ULTIMATE.start_main_~k~0#1| 2147483638)} is VALID [2022-02-21 03:03:56,118 INFO L290 TraceCheckUtils]: 9: Hoare triple {8090#(<= |ULTIMATE.start_main_~k~0#1| 2147483638)} assume !!(main_~k~0#1 < main_~N~0#1 - 1); {8090#(<= |ULTIMATE.start_main_~k~0#1| 2147483638)} is VALID [2022-02-21 03:03:56,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {8090#(<= |ULTIMATE.start_main_~k~0#1| 2147483638)} assume main_~N~0#1 - 1 >= -2147483648; {8090#(<= |ULTIMATE.start_main_~k~0#1| 2147483638)} is VALID [2022-02-21 03:03:56,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {8090#(<= |ULTIMATE.start_main_~k~0#1| 2147483638)} assume main_~N~0#1 - 1 <= 2147483647; {8090#(<= |ULTIMATE.start_main_~k~0#1| 2147483638)} is VALID [2022-02-21 03:03:56,119 INFO L290 TraceCheckUtils]: 6: Hoare triple {8106#(<= |ULTIMATE.start_main_~i~0#1| 2147483638)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {8090#(<= |ULTIMATE.start_main_~k~0#1| 2147483638)} is VALID [2022-02-21 03:03:56,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {8106#(<= |ULTIMATE.start_main_~i~0#1| 2147483638)} assume 1 + main_~j~0#1 <= 2147483647; {8106#(<= |ULTIMATE.start_main_~i~0#1| 2147483638)} is VALID [2022-02-21 03:03:56,120 INFO L290 TraceCheckUtils]: 4: Hoare triple {8106#(<= |ULTIMATE.start_main_~i~0#1| 2147483638)} assume !!(main_~j~0#1 < main_~m~0#1); {8106#(<= |ULTIMATE.start_main_~i~0#1| 2147483638)} is VALID [2022-02-21 03:03:56,120 INFO L290 TraceCheckUtils]: 3: Hoare triple {8106#(<= |ULTIMATE.start_main_~i~0#1| 2147483638)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {8106#(<= |ULTIMATE.start_main_~i~0#1| 2147483638)} is VALID [2022-02-21 03:03:56,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {7748#true} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {8106#(<= |ULTIMATE.start_main_~i~0#1| 2147483638)} is VALID [2022-02-21 03:03:56,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {7748#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {7748#true} is VALID [2022-02-21 03:03:56,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {7748#true} assume { :begin_inline_ULTIMATE.init } true; {7748#true} is VALID [2022-02-21 03:03:56,121 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 160 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:03:56,121 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408812500] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:03:56,121 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:03:56,121 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-02-21 03:03:56,122 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435523893] [2022-02-21 03:03:56,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:03:56,122 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.64) internal successors, (116), 26 states have internal predecessors, (116), 0 states have call successors, (0), 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 59 [2022-02-21 03:03:56,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:56,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 26 states, 25 states have (on average 4.64) internal successors, (116), 26 states have internal predecessors, (116), 0 states have call successors, (0), 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,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:03:56,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-02-21 03:03:56,215 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:56,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-02-21 03:03:56,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=433, Unknown=0, NotChecked=0, Total=650 [2022-02-21 03:03:56,216 INFO L87 Difference]: Start difference. First operand 100 states and 116 transitions. Second operand has 26 states, 25 states have (on average 4.64) internal successors, (116), 26 states have internal predecessors, (116), 0 states have call successors, (0), 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,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:59,632 INFO L93 Difference]: Finished difference Result 801 states and 929 transitions. [2022-02-21 03:03:59,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-02-21 03:03:59,632 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.64) internal successors, (116), 26 states have internal predecessors, (116), 0 states have call successors, (0), 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 59 [2022-02-21 03:03:59,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:59,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 4.64) internal successors, (116), 26 states have internal predecessors, (116), 0 states have call successors, (0), 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,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 599 transitions. [2022-02-21 03:03:59,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 4.64) internal successors, (116), 26 states have internal predecessors, (116), 0 states have call successors, (0), 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,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 599 transitions. [2022-02-21 03:03:59,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 89 states and 599 transitions. [2022-02-21 03:04:00,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 599 edges. 599 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:00,050 INFO L225 Difference]: With dead ends: 801 [2022-02-21 03:04:00,050 INFO L226 Difference]: Without dead ends: 800 [2022-02-21 03:04:00,052 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4074 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3646, Invalid=7484, Unknown=0, NotChecked=0, Total=11130 [2022-02-21 03:04:00,053 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 934 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:00,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [934 Valid, 187 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-21 03:04:00,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2022-02-21 03:04:00,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 150. [2022-02-21 03:04:00,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:00,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 800 states. Second operand has 150 states, 149 states have (on average 1.1812080536912752) internal successors, (176), 149 states have internal predecessors, (176), 0 states have call successors, (0), 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,375 INFO L74 IsIncluded]: Start isIncluded. First operand 800 states. Second operand has 150 states, 149 states have (on average 1.1812080536912752) internal successors, (176), 149 states have internal predecessors, (176), 0 states have call successors, (0), 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,375 INFO L87 Difference]: Start difference. First operand 800 states. Second operand has 150 states, 149 states have (on average 1.1812080536912752) internal successors, (176), 149 states have internal predecessors, (176), 0 states have call successors, (0), 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,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:00,396 INFO L93 Difference]: Finished difference Result 800 states and 925 transitions. [2022-02-21 03:04:00,396 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 925 transitions. [2022-02-21 03:04:00,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:00,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:00,398 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 149 states have (on average 1.1812080536912752) internal successors, (176), 149 states have internal predecessors, (176), 0 states have call successors, (0), 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 800 states. [2022-02-21 03:04:00,398 INFO L87 Difference]: Start difference. First operand has 150 states, 149 states have (on average 1.1812080536912752) internal successors, (176), 149 states have internal predecessors, (176), 0 states have call successors, (0), 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 800 states. [2022-02-21 03:04:00,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:00,423 INFO L93 Difference]: Finished difference Result 800 states and 925 transitions. [2022-02-21 03:04:00,423 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 925 transitions. [2022-02-21 03:04:00,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:00,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:00,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:00,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:00,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 1.1812080536912752) internal successors, (176), 149 states have internal predecessors, (176), 0 states have call successors, (0), 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,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 176 transitions. [2022-02-21 03:04:00,427 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 176 transitions. Word has length 59 [2022-02-21 03:04:00,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:00,427 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 176 transitions. [2022-02-21 03:04:00,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.64) internal successors, (116), 26 states have internal predecessors, (116), 0 states have call successors, (0), 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,427 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 176 transitions. [2022-02-21 03:04:00,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-21 03:04:00,428 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:00,428 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2022-02-21 03:04:00,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-02-21 03:04:00,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-02-21 03:04:00,643 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:04:00,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:00,644 INFO L85 PathProgramCache]: Analyzing trace with hash 990038694, now seen corresponding path program 3 times [2022-02-21 03:04:00,644 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:00,644 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456376478] [2022-02-21 03:04:00,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:00,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:00,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:00,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {11064#true} assume { :begin_inline_ULTIMATE.init } true; {11064#true} is VALID [2022-02-21 03:04:00,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {11064#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {11064#true} is VALID [2022-02-21 03:04:00,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {11064#true} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {11066#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:04:00,721 INFO L290 TraceCheckUtils]: 3: Hoare triple {11066#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {11066#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:04:00,721 INFO L290 TraceCheckUtils]: 4: Hoare triple {11066#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~j~0#1 < main_~m~0#1); {11066#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:04:00,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {11066#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 1 + main_~j~0#1 <= 2147483647; {11066#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:04:00,722 INFO L290 TraceCheckUtils]: 6: Hoare triple {11066#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {11067#(<= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-21 03:04:00,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {11067#(<= |ULTIMATE.start_main_~k~0#1| 0)} assume main_~N~0#1 - 1 <= 2147483647; {11067#(<= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-21 03:04:00,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {11067#(<= |ULTIMATE.start_main_~k~0#1| 0)} assume main_~N~0#1 - 1 >= -2147483648; {11067#(<= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-21 03:04:00,722 INFO L290 TraceCheckUtils]: 9: Hoare triple {11067#(<= |ULTIMATE.start_main_~k~0#1| 0)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-21 03:04:00,723 INFO L290 TraceCheckUtils]: 10: Hoare triple {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} main_~i~0#1 := main_~k~0#1; {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-21 03:04:00,723 INFO L290 TraceCheckUtils]: 11: Hoare triple {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} assume !(main_~j~0#1 < main_~m~0#1); {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-21 03:04:00,723 INFO L290 TraceCheckUtils]: 12: Hoare triple {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} assume 1 + main_~i~0#1 <= 2147483647; {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-21 03:04:00,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1; {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-21 03:04:00,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-21 03:04:00,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} assume !!(main_~j~0#1 < main_~m~0#1); {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-21 03:04:00,724 INFO L290 TraceCheckUtils]: 16: Hoare triple {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} assume 1 + main_~j~0#1 <= 2147483647; {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-21 03:04:00,724 INFO L290 TraceCheckUtils]: 17: Hoare triple {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-21 03:04:00,725 INFO L290 TraceCheckUtils]: 18: Hoare triple {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} assume main_~N~0#1 - 1 <= 2147483647; {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-21 03:04:00,725 INFO L290 TraceCheckUtils]: 19: Hoare triple {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} assume main_~N~0#1 - 1 >= -2147483648; {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-21 03:04:00,725 INFO L290 TraceCheckUtils]: 20: Hoare triple {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} assume !!(main_~k~0#1 < main_~N~0#1 - 1); {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-21 03:04:00,725 INFO L290 TraceCheckUtils]: 21: Hoare triple {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} assume 1 + main_~k~0#1 <= 2147483647; {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-21 03:04:00,726 INFO L290 TraceCheckUtils]: 22: Hoare triple {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} assume 1 + main_~k~0#1 >= -2147483648;main_~k~0#1 := 1 + main_~k~0#1; {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-21 03:04:00,726 INFO L290 TraceCheckUtils]: 23: Hoare triple {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} assume main_~N~0#1 - 1 <= 2147483647; {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-21 03:04:00,726 INFO L290 TraceCheckUtils]: 24: Hoare triple {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} assume main_~N~0#1 - 1 >= -2147483648; {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-21 03:04:00,727 INFO L290 TraceCheckUtils]: 25: Hoare triple {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} assume !!(main_~k~0#1 < main_~N~0#1 - 1); {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-21 03:04:00,727 INFO L290 TraceCheckUtils]: 26: Hoare triple {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} assume 1 + main_~k~0#1 <= 2147483647; {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-21 03:04:00,727 INFO L290 TraceCheckUtils]: 27: Hoare triple {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} assume 1 + main_~k~0#1 >= -2147483648;main_~k~0#1 := 1 + main_~k~0#1; {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-21 03:04:00,728 INFO L290 TraceCheckUtils]: 28: Hoare triple {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} assume main_~N~0#1 - 1 <= 2147483647; {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-21 03:04:00,730 INFO L290 TraceCheckUtils]: 29: Hoare triple {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} assume main_~N~0#1 - 1 >= -2147483648; {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-21 03:04:00,730 INFO L290 TraceCheckUtils]: 30: Hoare triple {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-21 03:04:00,731 INFO L290 TraceCheckUtils]: 31: Hoare triple {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} main_~i~0#1 := main_~k~0#1; {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-21 03:04:00,731 INFO L290 TraceCheckUtils]: 32: Hoare triple {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} assume !(main_~j~0#1 < main_~m~0#1); {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-21 03:04:00,731 INFO L290 TraceCheckUtils]: 33: Hoare triple {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} assume 1 + main_~i~0#1 <= 2147483647; {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-21 03:04:00,731 INFO L290 TraceCheckUtils]: 34: Hoare triple {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1; {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-21 03:04:00,732 INFO L290 TraceCheckUtils]: 35: Hoare triple {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-21 03:04:00,732 INFO L290 TraceCheckUtils]: 36: Hoare triple {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} assume !!(main_~j~0#1 < main_~m~0#1); {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-21 03:04:00,732 INFO L290 TraceCheckUtils]: 37: Hoare triple {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} assume 1 + main_~j~0#1 <= 2147483647; {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-21 03:04:00,732 INFO L290 TraceCheckUtils]: 38: Hoare triple {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-21 03:04:00,733 INFO L290 TraceCheckUtils]: 39: Hoare triple {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} assume main_~N~0#1 - 1 <= 2147483647; {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-21 03:04:00,733 INFO L290 TraceCheckUtils]: 40: Hoare triple {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} assume main_~N~0#1 - 1 >= -2147483648; {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} is VALID [2022-02-21 03:04:00,733 INFO L290 TraceCheckUtils]: 41: Hoare triple {11068#(<= |ULTIMATE.start_main_~N~0#1| 1)} assume !!(main_~k~0#1 < main_~N~0#1 - 1); {11069#(<= (+ |ULTIMATE.start_main_~k~0#1| 1) 0)} is VALID [2022-02-21 03:04:00,733 INFO L290 TraceCheckUtils]: 42: Hoare triple {11069#(<= (+ |ULTIMATE.start_main_~k~0#1| 1) 0)} assume 1 + main_~k~0#1 <= 2147483647; {11069#(<= (+ |ULTIMATE.start_main_~k~0#1| 1) 0)} is VALID [2022-02-21 03:04:00,734 INFO L290 TraceCheckUtils]: 43: Hoare triple {11069#(<= (+ |ULTIMATE.start_main_~k~0#1| 1) 0)} assume 1 + main_~k~0#1 >= -2147483648;main_~k~0#1 := 1 + main_~k~0#1; {11067#(<= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-21 03:04:00,734 INFO L290 TraceCheckUtils]: 44: Hoare triple {11067#(<= |ULTIMATE.start_main_~k~0#1| 0)} assume main_~N~0#1 - 1 <= 2147483647; {11067#(<= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-21 03:04:00,734 INFO L290 TraceCheckUtils]: 45: Hoare triple {11067#(<= |ULTIMATE.start_main_~k~0#1| 0)} assume main_~N~0#1 - 1 >= -2147483648; {11067#(<= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-21 03:04:00,735 INFO L290 TraceCheckUtils]: 46: Hoare triple {11067#(<= |ULTIMATE.start_main_~k~0#1| 0)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {11067#(<= |ULTIMATE.start_main_~k~0#1| 0)} is VALID [2022-02-21 03:04:00,735 INFO L290 TraceCheckUtils]: 47: Hoare triple {11067#(<= |ULTIMATE.start_main_~k~0#1| 0)} main_~i~0#1 := main_~k~0#1; {11066#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:04:00,735 INFO L290 TraceCheckUtils]: 48: Hoare triple {11066#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~j~0#1 < main_~m~0#1); {11066#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:04:00,735 INFO L290 TraceCheckUtils]: 49: Hoare triple {11066#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 1 + main_~i~0#1 <= 2147483647; {11066#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:04:00,736 INFO L290 TraceCheckUtils]: 50: Hoare triple {11066#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1; {11070#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:04:00,736 INFO L290 TraceCheckUtils]: 51: Hoare triple {11070#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {11070#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:04:00,736 INFO L290 TraceCheckUtils]: 52: Hoare triple {11070#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~j~0#1 < main_~m~0#1); {11070#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:04:00,737 INFO L290 TraceCheckUtils]: 53: Hoare triple {11070#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume 1 + main_~j~0#1 <= 2147483647; {11070#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:04:00,737 INFO L290 TraceCheckUtils]: 54: Hoare triple {11070#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {11071#(<= |ULTIMATE.start_main_~k~0#1| 1)} is VALID [2022-02-21 03:04:00,737 INFO L290 TraceCheckUtils]: 55: Hoare triple {11071#(<= |ULTIMATE.start_main_~k~0#1| 1)} assume main_~N~0#1 - 1 <= 2147483647; {11071#(<= |ULTIMATE.start_main_~k~0#1| 1)} is VALID [2022-02-21 03:04:00,737 INFO L290 TraceCheckUtils]: 56: Hoare triple {11071#(<= |ULTIMATE.start_main_~k~0#1| 1)} assume main_~N~0#1 - 1 >= -2147483648; {11071#(<= |ULTIMATE.start_main_~k~0#1| 1)} is VALID [2022-02-21 03:04:00,738 INFO L290 TraceCheckUtils]: 57: Hoare triple {11071#(<= |ULTIMATE.start_main_~k~0#1| 1)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {11071#(<= |ULTIMATE.start_main_~k~0#1| 1)} is VALID [2022-02-21 03:04:00,738 INFO L290 TraceCheckUtils]: 58: Hoare triple {11071#(<= |ULTIMATE.start_main_~k~0#1| 1)} main_~i~0#1 := main_~k~0#1; {11070#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:04:00,738 INFO L290 TraceCheckUtils]: 59: Hoare triple {11070#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~j~0#1 < main_~m~0#1); {11070#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:04:00,739 INFO L290 TraceCheckUtils]: 60: Hoare triple {11070#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(1 + main_~i~0#1 <= 2147483647); {11065#false} is VALID [2022-02-21 03:04:00,739 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-02-21 03:04:00,739 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:00,739 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456376478] [2022-02-21 03:04:00,739 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456376478] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:04:00,739 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622456672] [2022-02-21 03:04:00,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:04:00,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:00,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:04:00,741 INFO L229 MonitoredProcess]: Starting monitored process 10 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:04:00,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-21 03:04:00,783 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-21 03:04:00,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:04:00,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:04:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:00,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:04:01,015 INFO L290 TraceCheckUtils]: 0: Hoare triple {11064#true} assume { :begin_inline_ULTIMATE.init } true; {11064#true} is VALID [2022-02-21 03:04:01,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {11064#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,016 INFO L290 TraceCheckUtils]: 3: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,016 INFO L290 TraceCheckUtils]: 4: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~j~0#1 < main_~m~0#1); {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,016 INFO L290 TraceCheckUtils]: 6: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~N~0#1 - 1 <= 2147483647; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~N~0#1 - 1 >= -2147483648; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,017 INFO L290 TraceCheckUtils]: 10: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} main_~i~0#1 := main_~k~0#1; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !(main_~j~0#1 < main_~m~0#1); {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~i~0#1 <= 2147483647; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,019 INFO L290 TraceCheckUtils]: 14: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,019 INFO L290 TraceCheckUtils]: 15: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~j~0#1 < main_~m~0#1); {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,019 INFO L290 TraceCheckUtils]: 16: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,019 INFO L290 TraceCheckUtils]: 17: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,020 INFO L290 TraceCheckUtils]: 18: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~N~0#1 - 1 <= 2147483647; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,020 INFO L290 TraceCheckUtils]: 19: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~N~0#1 - 1 >= -2147483648; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,020 INFO L290 TraceCheckUtils]: 20: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~k~0#1 < main_~N~0#1 - 1); {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,020 INFO L290 TraceCheckUtils]: 21: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~k~0#1 <= 2147483647; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,021 INFO L290 TraceCheckUtils]: 22: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~k~0#1 >= -2147483648;main_~k~0#1 := 1 + main_~k~0#1; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,021 INFO L290 TraceCheckUtils]: 23: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~N~0#1 - 1 <= 2147483647; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,021 INFO L290 TraceCheckUtils]: 24: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~N~0#1 - 1 >= -2147483648; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,021 INFO L290 TraceCheckUtils]: 25: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~k~0#1 < main_~N~0#1 - 1); {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,022 INFO L290 TraceCheckUtils]: 26: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~k~0#1 <= 2147483647; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,022 INFO L290 TraceCheckUtils]: 27: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~k~0#1 >= -2147483648;main_~k~0#1 := 1 + main_~k~0#1; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,023 INFO L290 TraceCheckUtils]: 28: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~N~0#1 - 1 <= 2147483647; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,023 INFO L290 TraceCheckUtils]: 29: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~N~0#1 - 1 >= -2147483648; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,023 INFO L290 TraceCheckUtils]: 30: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,023 INFO L290 TraceCheckUtils]: 31: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} main_~i~0#1 := main_~k~0#1; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,024 INFO L290 TraceCheckUtils]: 32: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !(main_~j~0#1 < main_~m~0#1); {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,024 INFO L290 TraceCheckUtils]: 33: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~i~0#1 <= 2147483647; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,024 INFO L290 TraceCheckUtils]: 34: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,024 INFO L290 TraceCheckUtils]: 35: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,025 INFO L290 TraceCheckUtils]: 36: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~j~0#1 < main_~m~0#1); {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,025 INFO L290 TraceCheckUtils]: 37: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,025 INFO L290 TraceCheckUtils]: 38: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,025 INFO L290 TraceCheckUtils]: 39: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~N~0#1 - 1 <= 2147483647; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,026 INFO L290 TraceCheckUtils]: 40: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~N~0#1 - 1 >= -2147483648; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,026 INFO L290 TraceCheckUtils]: 41: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~k~0#1 < main_~N~0#1 - 1); {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,026 INFO L290 TraceCheckUtils]: 42: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~k~0#1 <= 2147483647; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,026 INFO L290 TraceCheckUtils]: 43: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~k~0#1 >= -2147483648;main_~k~0#1 := 1 + main_~k~0#1; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,027 INFO L290 TraceCheckUtils]: 44: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~N~0#1 - 1 <= 2147483647; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,027 INFO L290 TraceCheckUtils]: 45: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~N~0#1 - 1 >= -2147483648; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,027 INFO L290 TraceCheckUtils]: 46: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,027 INFO L290 TraceCheckUtils]: 47: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} main_~i~0#1 := main_~k~0#1; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,028 INFO L290 TraceCheckUtils]: 48: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !(main_~j~0#1 < main_~m~0#1); {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,028 INFO L290 TraceCheckUtils]: 49: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~i~0#1 <= 2147483647; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,028 INFO L290 TraceCheckUtils]: 50: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,029 INFO L290 TraceCheckUtils]: 51: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {11229#(< |ULTIMATE.start_main_~i~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,029 INFO L290 TraceCheckUtils]: 52: Hoare triple {11229#(< |ULTIMATE.start_main_~i~0#1| 2147483647)} assume !!(main_~j~0#1 < main_~m~0#1); {11229#(< |ULTIMATE.start_main_~i~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,029 INFO L290 TraceCheckUtils]: 53: Hoare triple {11229#(< |ULTIMATE.start_main_~i~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {11229#(< |ULTIMATE.start_main_~i~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,029 INFO L290 TraceCheckUtils]: 54: Hoare triple {11229#(< |ULTIMATE.start_main_~i~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {11239#(< |ULTIMATE.start_main_~k~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,030 INFO L290 TraceCheckUtils]: 55: Hoare triple {11239#(< |ULTIMATE.start_main_~k~0#1| 2147483647)} assume main_~N~0#1 - 1 <= 2147483647; {11239#(< |ULTIMATE.start_main_~k~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,030 INFO L290 TraceCheckUtils]: 56: Hoare triple {11239#(< |ULTIMATE.start_main_~k~0#1| 2147483647)} assume main_~N~0#1 - 1 >= -2147483648; {11239#(< |ULTIMATE.start_main_~k~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,030 INFO L290 TraceCheckUtils]: 57: Hoare triple {11239#(< |ULTIMATE.start_main_~k~0#1| 2147483647)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {11239#(< |ULTIMATE.start_main_~k~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,031 INFO L290 TraceCheckUtils]: 58: Hoare triple {11239#(< |ULTIMATE.start_main_~k~0#1| 2147483647)} main_~i~0#1 := main_~k~0#1; {11229#(< |ULTIMATE.start_main_~i~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,031 INFO L290 TraceCheckUtils]: 59: Hoare triple {11229#(< |ULTIMATE.start_main_~i~0#1| 2147483647)} assume !(main_~j~0#1 < main_~m~0#1); {11229#(< |ULTIMATE.start_main_~i~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,031 INFO L290 TraceCheckUtils]: 60: Hoare triple {11229#(< |ULTIMATE.start_main_~i~0#1| 2147483647)} assume !(1 + main_~i~0#1 <= 2147483647); {11065#false} is VALID [2022-02-21 03:04:01,031 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-02-21 03:04:01,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:04:01,221 INFO L290 TraceCheckUtils]: 60: Hoare triple {11229#(< |ULTIMATE.start_main_~i~0#1| 2147483647)} assume !(1 + main_~i~0#1 <= 2147483647); {11065#false} is VALID [2022-02-21 03:04:01,222 INFO L290 TraceCheckUtils]: 59: Hoare triple {11229#(< |ULTIMATE.start_main_~i~0#1| 2147483647)} assume !(main_~j~0#1 < main_~m~0#1); {11229#(< |ULTIMATE.start_main_~i~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,222 INFO L290 TraceCheckUtils]: 58: Hoare triple {11239#(< |ULTIMATE.start_main_~k~0#1| 2147483647)} main_~i~0#1 := main_~k~0#1; {11229#(< |ULTIMATE.start_main_~i~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,223 INFO L290 TraceCheckUtils]: 57: Hoare triple {11239#(< |ULTIMATE.start_main_~k~0#1| 2147483647)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {11239#(< |ULTIMATE.start_main_~k~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,223 INFO L290 TraceCheckUtils]: 56: Hoare triple {11239#(< |ULTIMATE.start_main_~k~0#1| 2147483647)} assume main_~N~0#1 - 1 >= -2147483648; {11239#(< |ULTIMATE.start_main_~k~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,223 INFO L290 TraceCheckUtils]: 55: Hoare triple {11239#(< |ULTIMATE.start_main_~k~0#1| 2147483647)} assume main_~N~0#1 - 1 <= 2147483647; {11239#(< |ULTIMATE.start_main_~k~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,223 INFO L290 TraceCheckUtils]: 54: Hoare triple {11229#(< |ULTIMATE.start_main_~i~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {11239#(< |ULTIMATE.start_main_~k~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,224 INFO L290 TraceCheckUtils]: 53: Hoare triple {11229#(< |ULTIMATE.start_main_~i~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {11229#(< |ULTIMATE.start_main_~i~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,224 INFO L290 TraceCheckUtils]: 52: Hoare triple {11229#(< |ULTIMATE.start_main_~i~0#1| 2147483647)} assume !!(main_~j~0#1 < main_~m~0#1); {11229#(< |ULTIMATE.start_main_~i~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,224 INFO L290 TraceCheckUtils]: 51: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {11229#(< |ULTIMATE.start_main_~i~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,225 INFO L290 TraceCheckUtils]: 50: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,225 INFO L290 TraceCheckUtils]: 49: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~i~0#1 <= 2147483647; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,225 INFO L290 TraceCheckUtils]: 48: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !(main_~j~0#1 < main_~m~0#1); {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,225 INFO L290 TraceCheckUtils]: 47: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} main_~i~0#1 := main_~k~0#1; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,226 INFO L290 TraceCheckUtils]: 46: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,226 INFO L290 TraceCheckUtils]: 45: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~N~0#1 - 1 >= -2147483648; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,226 INFO L290 TraceCheckUtils]: 44: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~N~0#1 - 1 <= 2147483647; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,226 INFO L290 TraceCheckUtils]: 43: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~k~0#1 >= -2147483648;main_~k~0#1 := 1 + main_~k~0#1; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,239 INFO L290 TraceCheckUtils]: 42: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~k~0#1 <= 2147483647; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,240 INFO L290 TraceCheckUtils]: 41: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~k~0#1 < main_~N~0#1 - 1); {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,240 INFO L290 TraceCheckUtils]: 40: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~N~0#1 - 1 >= -2147483648; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,241 INFO L290 TraceCheckUtils]: 39: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~N~0#1 - 1 <= 2147483647; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,241 INFO L290 TraceCheckUtils]: 38: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,241 INFO L290 TraceCheckUtils]: 37: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,242 INFO L290 TraceCheckUtils]: 36: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~j~0#1 < main_~m~0#1); {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,242 INFO L290 TraceCheckUtils]: 35: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,243 INFO L290 TraceCheckUtils]: 34: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,243 INFO L290 TraceCheckUtils]: 33: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~i~0#1 <= 2147483647; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,243 INFO L290 TraceCheckUtils]: 32: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !(main_~j~0#1 < main_~m~0#1); {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,244 INFO L290 TraceCheckUtils]: 31: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} main_~i~0#1 := main_~k~0#1; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,244 INFO L290 TraceCheckUtils]: 30: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,244 INFO L290 TraceCheckUtils]: 29: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~N~0#1 - 1 >= -2147483648; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,245 INFO L290 TraceCheckUtils]: 28: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~N~0#1 - 1 <= 2147483647; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,245 INFO L290 TraceCheckUtils]: 27: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~k~0#1 >= -2147483648;main_~k~0#1 := 1 + main_~k~0#1; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,246 INFO L290 TraceCheckUtils]: 26: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~k~0#1 <= 2147483647; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,246 INFO L290 TraceCheckUtils]: 25: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~k~0#1 < main_~N~0#1 - 1); {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,246 INFO L290 TraceCheckUtils]: 24: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~N~0#1 - 1 >= -2147483648; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,247 INFO L290 TraceCheckUtils]: 23: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~N~0#1 - 1 <= 2147483647; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,247 INFO L290 TraceCheckUtils]: 22: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~k~0#1 >= -2147483648;main_~k~0#1 := 1 + main_~k~0#1; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,248 INFO L290 TraceCheckUtils]: 21: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~k~0#1 <= 2147483647; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,248 INFO L290 TraceCheckUtils]: 20: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~k~0#1 < main_~N~0#1 - 1); {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,248 INFO L290 TraceCheckUtils]: 19: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~N~0#1 - 1 >= -2147483648; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,249 INFO L290 TraceCheckUtils]: 18: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~N~0#1 - 1 <= 2147483647; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,250 INFO L290 TraceCheckUtils]: 16: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,250 INFO L290 TraceCheckUtils]: 15: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~j~0#1 < main_~m~0#1); {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,250 INFO L290 TraceCheckUtils]: 14: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~i~0#1 >= -2147483648;main_~i~0#1 := 1 + main_~i~0#1; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~i~0#1 <= 2147483647; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,252 INFO L290 TraceCheckUtils]: 11: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !(main_~j~0#1 < main_~m~0#1); {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,252 INFO L290 TraceCheckUtils]: 10: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} main_~i~0#1 := main_~k~0#1; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~N~0#1 - 1 >= -2147483648; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume main_~N~0#1 - 1 <= 2147483647; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 >= -2147483648;main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,254 INFO L290 TraceCheckUtils]: 5: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume 1 + main_~j~0#1 <= 2147483647; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,254 INFO L290 TraceCheckUtils]: 4: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~j~0#1 < main_~m~0#1); {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,254 INFO L290 TraceCheckUtils]: 3: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {11064#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {11078#(<= |ULTIMATE.start_main_~n~0#1| 2147483647)} is VALID [2022-02-21 03:04:01,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {11064#true} assume { :begin_inline_ULTIMATE.init } true; {11064#true} is VALID [2022-02-21 03:04:01,255 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-02-21 03:04:01,255 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622456672] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:04:01,255 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:04:01,255 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2022-02-21 03:04:01,256 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012146979] [2022-02-21 03:04:01,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:04:01,256 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.8) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 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 61 [2022-02-21 03:04:01,256 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:01,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 6.8) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 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:01,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:01,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-21 03:04:01,295 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:01,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-21 03:04:01,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-02-21 03:04:01,296 INFO L87 Difference]: Start difference. First operand 150 states and 176 transitions. Second operand has 11 states, 10 states have (on average 6.8) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 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:03,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:03,501 INFO L93 Difference]: Finished difference Result 768 states and 903 transitions. [2022-02-21 03:04:03,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-21 03:04:03,501 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.8) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 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 61 [2022-02-21 03:04:03,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:03,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 6.8) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 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:03,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 161 transitions. [2022-02-21 03:04:03,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 6.8) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 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:03,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 161 transitions. [2022-02-21 03:04:03,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 161 transitions. [2022-02-21 03:04:03,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:03,603 INFO L225 Difference]: With dead ends: 768 [2022-02-21 03:04:03,603 INFO L226 Difference]: Without dead ends: 0 [2022-02-21 03:04:03,607 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=320, Invalid=672, Unknown=0, NotChecked=0, Total=992 [2022-02-21 03:04:03,608 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 119 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:03,608 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 69 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:04:03,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-21 03:04:03,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-21 03:04:03,609 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:03,609 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:03,609 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:03,609 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:03,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:03,610 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:04:03,610 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:04:03,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:03,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:03,610 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:03,610 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:03,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:03,610 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:04:03,610 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:04:03,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:03,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:03,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:03,611 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:03,612 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:03,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 03:04:03,612 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 61 [2022-02-21 03:04:03,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:03,612 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:04:03,612 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.8) internal successors, (68), 11 states have internal predecessors, (68), 0 states have call successors, (0), 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:03,613 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:04:03,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:03,614 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-02-21 03:04:03,615 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-02-21 03:04:03,615 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-02-21 03:04:03,615 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-02-21 03:04:03,615 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-02-21 03:04:03,615 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-02-21 03:04:03,615 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-02-21 03:04:03,615 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-02-21 03:04:03,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:04:03,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:03,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.