./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 574ddb4e Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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-?-574ddb4 [2023-02-18 23:20:38,849 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 23:20:38,851 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 23:20:38,882 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 23:20:38,882 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 23:20:38,885 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 23:20:38,886 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 23:20:38,888 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 23:20:38,890 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 23:20:38,893 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 23:20:38,894 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 23:20:38,896 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 23:20:38,896 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 23:20:38,897 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 23:20:38,898 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 23:20:38,900 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 23:20:38,900 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 23:20:38,901 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 23:20:38,902 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 23:20:38,906 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 23:20:38,906 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 23:20:38,907 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 23:20:38,908 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 23:20:38,909 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 23:20:38,914 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 23:20:38,915 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 23:20:38,915 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 23:20:38,916 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 23:20:38,916 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 23:20:38,917 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 23:20:38,917 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 23:20:38,918 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 23:20:38,919 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 23:20:38,919 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 23:20:38,920 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 23:20:38,921 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 23:20:38,921 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 23:20:38,921 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 23:20:38,921 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 23:20:38,922 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 23:20:38,923 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 23:20:38,924 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2023-02-18 23:20:38,946 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 23:20:38,946 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 23:20:38,947 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 23:20:38,947 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 23:20:38,947 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 23:20:38,947 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 23:20:38,948 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 23:20:38,948 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 23:20:38,948 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 23:20:38,948 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 23:20:38,949 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-18 23:20:38,949 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 23:20:38,949 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 23:20:38,949 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 23:20:38,949 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 23:20:38,950 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 23:20:38,950 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-18 23:20:38,950 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 23:20:38,950 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 23:20:38,950 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 23:20:38,950 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 23:20:38,950 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 23:20:38,950 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 23:20:38,951 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 23:20:38,951 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 23:20:38,951 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 23:20:38,951 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 23:20:38,951 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 23:20:38,951 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 23:20:38,951 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 23:20:38,952 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 23:20:38,952 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 23:20:38,952 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 23:20:38,952 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 23:20:38,952 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2023-02-18 23:20:39,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 23:20:39,135 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 23:20:39,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 23:20:39,137 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 23:20:39,141 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 23:20:39,142 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 [2023-02-18 23:20:40,169 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 23:20:40,360 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 23:20:40,361 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2023-02-18 23:20:40,364 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e27faf3c9/4e27388f4e584730a39c262c396f2811/FLAGa56ca10f6 [2023-02-18 23:20:40,775 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e27faf3c9/4e27388f4e584730a39c262c396f2811 [2023-02-18 23:20:40,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 23:20:40,785 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 23:20:40,785 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 23:20:40,788 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 23:20:40,791 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 23:20:40,801 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 11:20:40" (1/1) ... [2023-02-18 23:20:40,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cea0b70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:20:40, skipping insertion in model container [2023-02-18 23:20:40,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 11:20:40" (1/1) ... [2023-02-18 23:20:40,807 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 23:20:40,816 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 23:20:40,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 23:20:40,900 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 23:20:40,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 23:20:40,916 INFO L208 MainTranslator]: Completed translation [2023-02-18 23:20:40,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:20:40 WrapperNode [2023-02-18 23:20:40,916 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 23:20:40,917 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 23:20:40,917 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 23:20:40,917 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 23:20:40,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:20:40" (1/1) ... [2023-02-18 23:20:40,924 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:20:40" (1/1) ... [2023-02-18 23:20:40,938 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2023-02-18 23:20:40,938 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 23:20:40,938 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 23:20:40,939 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 23:20:40,939 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 23:20:40,943 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:20:40" (1/1) ... [2023-02-18 23:20:40,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:20:40" (1/1) ... [2023-02-18 23:20:40,949 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:20:40" (1/1) ... [2023-02-18 23:20:40,949 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:20:40" (1/1) ... [2023-02-18 23:20:40,953 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:20:40" (1/1) ... [2023-02-18 23:20:40,956 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:20:40" (1/1) ... [2023-02-18 23:20:40,959 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:20:40" (1/1) ... [2023-02-18 23:20:40,959 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:20:40" (1/1) ... [2023-02-18 23:20:40,961 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 23:20:40,962 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 23:20:40,962 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 23:20:40,963 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 23:20:40,963 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:20:40" (1/1) ... [2023-02-18 23:20:40,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 23:20:40,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:20:40,985 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) [2023-02-18 23:20:40,989 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 [2023-02-18 23:20:41,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 23:20:41,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 23:20:41,069 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 23:20:41,070 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 23:20:41,180 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 23:20:41,184 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 23:20:41,185 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-18 23:20:41,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 11:20:41 BoogieIcfgContainer [2023-02-18 23:20:41,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 23:20:41,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 23:20:41,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 23:20:41,189 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 23:20:41,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 11:20:40" (1/3) ... [2023-02-18 23:20:41,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f660c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 11:20:41, skipping insertion in model container [2023-02-18 23:20:41,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 11:20:40" (2/3) ... [2023-02-18 23:20:41,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f660c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 11:20:41, skipping insertion in model container [2023-02-18 23:20:41,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 11:20:41" (3/3) ... [2023-02-18 23:20:41,191 INFO L112 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2023-02-18 23:20:41,202 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 23:20:41,202 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-02-18 23:20:41,229 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 23:20:41,233 INFO L357 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=PETRI_NET, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@655233d0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 23:20:41,233 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-02-18 23:20:41,236 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) [2023-02-18 23:20:41,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-18 23:20:41,239 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:20:41,240 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-18 23:20:41,240 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-02-18 23:20:41,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:20:41,243 INFO L85 PathProgramCache]: Analyzing trace with hash 889514734, now seen corresponding path program 1 times [2023-02-18 23:20:41,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:20:41,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117842059] [2023-02-18 23:20:41,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:20:41,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:20:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:20:41,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 23:20:41,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:20:41,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117842059] [2023-02-18 23:20:41,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117842059] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:20:41,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:20:41,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 23:20:41,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568297059] [2023-02-18 23:20:41,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:20:41,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 23:20:41,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:20:41,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 23:20:41,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 23:20:41,384 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) [2023-02-18 23:20:41,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:20:41,406 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2023-02-18 23:20:41,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 23:20:41,410 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 [2023-02-18 23:20:41,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:20:41,415 INFO L225 Difference]: With dead ends: 51 [2023-02-18 23:20:41,415 INFO L226 Difference]: Without dead ends: 23 [2023-02-18 23:20:41,418 INFO L412 NwaCegarLoop]: 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 [2023-02-18 23:20:41,422 INFO L413 NwaCegarLoop]: 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 [2023-02-18 23:20:41,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 23:20:41,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-02-18 23:20:41,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-02-18 23:20:41,458 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) [2023-02-18 23:20:41,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2023-02-18 23:20:41,459 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 6 [2023-02-18 23:20:41,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:20:41,460 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2023-02-18 23:20:41,460 INFO L496 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) [2023-02-18 23:20:41,460 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2023-02-18 23:20:41,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-18 23:20:41,460 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:20:41,460 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-18 23:20:41,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 23:20:41,461 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-02-18 23:20:41,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:20:41,471 INFO L85 PathProgramCache]: Analyzing trace with hash 889513835, now seen corresponding path program 1 times [2023-02-18 23:20:41,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:20:41,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687174169] [2023-02-18 23:20:41,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:20:41,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:20:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:20:41,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 23:20:41,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:20:41,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687174169] [2023-02-18 23:20:41,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687174169] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:20:41,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:20:41,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 23:20:41,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064770923] [2023-02-18 23:20:41,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:20:41,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 23:20:41,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:20:41,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 23:20:41,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 23:20:41,505 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) [2023-02-18 23:20:41,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:20:41,537 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2023-02-18 23:20:41,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 23:20:41,538 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 [2023-02-18 23:20:41,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:20:41,539 INFO L225 Difference]: With dead ends: 42 [2023-02-18 23:20:41,539 INFO L226 Difference]: Without dead ends: 41 [2023-02-18 23:20:41,539 INFO L412 NwaCegarLoop]: 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 [2023-02-18 23:20:41,540 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 17 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 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 [2023-02-18 23:20:41,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 36 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 23:20:41,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-02-18 23:20:41,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 27. [2023-02-18 23:20:41,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.631578947368421) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 23:20:41,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2023-02-18 23:20:41,544 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 6 [2023-02-18 23:20:41,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:20:41,545 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-02-18 23:20:41,545 INFO L496 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) [2023-02-18 23:20:41,545 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2023-02-18 23:20:41,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-18 23:20:41,545 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:20:41,545 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-18 23:20:41,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 23:20:41,546 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-02-18 23:20:41,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:20:41,546 INFO L85 PathProgramCache]: Analyzing trace with hash 889513869, now seen corresponding path program 1 times [2023-02-18 23:20:41,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:20:41,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216494094] [2023-02-18 23:20:41,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:20:41,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:20:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:20:41,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 23:20:41,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:20:41,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216494094] [2023-02-18 23:20:41,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216494094] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:20:41,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:20:41,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 23:20:41,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231915463] [2023-02-18 23:20:41,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:20:41,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 23:20:41,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:20:41,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 23:20:41,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 23:20:41,594 INFO L87 Difference]: Start difference. First operand 27 states and 31 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) [2023-02-18 23:20:41,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:20:41,604 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2023-02-18 23:20:41,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 23:20:41,604 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 [2023-02-18 23:20:41,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:20:41,605 INFO L225 Difference]: With dead ends: 28 [2023-02-18 23:20:41,605 INFO L226 Difference]: Without dead ends: 27 [2023-02-18 23:20:41,605 INFO L412 NwaCegarLoop]: 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 [2023-02-18 23:20:41,606 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 18 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 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 [2023-02-18 23:20:41,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 22 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 23:20:41,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-18 23:20:41,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2023-02-18 23:20:41,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 23:20:41,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2023-02-18 23:20:41,610 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 6 [2023-02-18 23:20:41,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:20:41,610 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2023-02-18 23:20:41,610 INFO L496 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) [2023-02-18 23:20:41,610 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2023-02-18 23:20:41,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-18 23:20:41,611 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:20:41,611 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:20:41,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-18 23:20:41,611 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-02-18 23:20:41,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:20:41,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1805125194, now seen corresponding path program 1 times [2023-02-18 23:20:41,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:20:41,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829087557] [2023-02-18 23:20:41,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:20:41,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:20:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:20:41,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 23:20:41,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:20:41,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829087557] [2023-02-18 23:20:41,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829087557] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:20:41,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:20:41,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 23:20:41,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291336406] [2023-02-18 23:20:41,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:20:41,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 23:20:41,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:20:41,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 23:20:41,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 23:20:41,635 INFO L87 Difference]: Start difference. First operand 26 states and 30 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) [2023-02-18 23:20:41,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:20:41,650 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2023-02-18 23:20:41,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 23:20:41,650 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 [2023-02-18 23:20:41,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:20:41,651 INFO L225 Difference]: With dead ends: 44 [2023-02-18 23:20:41,651 INFO L226 Difference]: Without dead ends: 43 [2023-02-18 23:20:41,651 INFO L412 NwaCegarLoop]: 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 [2023-02-18 23:20:41,652 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 14 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 35 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 [2023-02-18 23:20:41,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 35 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 23:20:41,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-02-18 23:20:41,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2023-02-18 23:20:41,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 29 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) [2023-02-18 23:20:41,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2023-02-18 23:20:41,657 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 7 [2023-02-18 23:20:41,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:20:41,657 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2023-02-18 23:20:41,657 INFO L496 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) [2023-02-18 23:20:41,658 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2023-02-18 23:20:41,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-18 23:20:41,658 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:20:41,658 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:20:41,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-18 23:20:41,659 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-02-18 23:20:41,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:20:41,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1805126220, now seen corresponding path program 1 times [2023-02-18 23:20:41,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:20:41,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128132339] [2023-02-18 23:20:41,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:20:41,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:20:41,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:20:41,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 23:20:41,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:20:41,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128132339] [2023-02-18 23:20:41,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128132339] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:20:41,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:20:41,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 23:20:41,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129541283] [2023-02-18 23:20:41,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:20:41,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 23:20:41,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:20:41,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 23:20:41,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 23:20:41,691 INFO L87 Difference]: Start difference. First operand 30 states and 35 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) [2023-02-18 23:20:41,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:20:41,703 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2023-02-18 23:20:41,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 23:20:41,704 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 [2023-02-18 23:20:41,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:20:41,704 INFO L225 Difference]: With dead ends: 39 [2023-02-18 23:20:41,704 INFO L226 Difference]: Without dead ends: 38 [2023-02-18 23:20:41,705 INFO L412 NwaCegarLoop]: 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 [2023-02-18 23:20:41,706 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 23:20:41,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 39 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 23:20:41,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-18 23:20:41,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2023-02-18 23:20:41,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.5) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 23:20:41,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2023-02-18 23:20:41,710 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 7 [2023-02-18 23:20:41,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:20:41,711 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2023-02-18 23:20:41,711 INFO L496 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) [2023-02-18 23:20:41,711 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2023-02-18 23:20:41,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-18 23:20:41,711 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:20:41,712 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:20:41,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-18 23:20:41,712 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-02-18 23:20:41,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:20:41,713 INFO L85 PathProgramCache]: Analyzing trace with hash 124338035, now seen corresponding path program 1 times [2023-02-18 23:20:41,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:20:41,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928983366] [2023-02-18 23:20:41,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:20:41,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:20:41,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:20:41,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 23:20:41,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:20:41,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928983366] [2023-02-18 23:20:41,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928983366] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:20:41,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:20:41,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 23:20:41,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119387478] [2023-02-18 23:20:41,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:20:41,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 23:20:41,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:20:41,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 23:20:41,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 23:20:41,747 INFO L87 Difference]: Start difference. First operand 33 states and 39 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) [2023-02-18 23:20:41,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:20:41,755 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2023-02-18 23:20:41,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 23:20:41,755 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 [2023-02-18 23:20:41,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:20:41,756 INFO L225 Difference]: With dead ends: 33 [2023-02-18 23:20:41,756 INFO L226 Difference]: Without dead ends: 32 [2023-02-18 23:20:41,756 INFO L412 NwaCegarLoop]: 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 [2023-02-18 23:20:41,757 INFO L413 NwaCegarLoop]: 18 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, 19 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 [2023-02-18 23:20:41,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 19 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 23:20:41,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-18 23:20:41,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-02-18 23:20:41,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.4615384615384615) 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) [2023-02-18 23:20:41,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2023-02-18 23:20:41,761 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 8 [2023-02-18 23:20:41,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:20:41,762 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2023-02-18 23:20:41,762 INFO L496 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) [2023-02-18 23:20:41,762 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2023-02-18 23:20:41,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 23:20:41,762 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:20:41,762 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:20:41,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-18 23:20:41,763 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-02-18 23:20:41,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:20:41,763 INFO L85 PathProgramCache]: Analyzing trace with hash -440488146, now seen corresponding path program 1 times [2023-02-18 23:20:41,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:20:41,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389869343] [2023-02-18 23:20:41,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:20:41,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:20:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:20:41,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 23:20:41,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:20:41,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389869343] [2023-02-18 23:20:41,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389869343] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:20:41,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:20:41,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 23:20:41,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098302079] [2023-02-18 23:20:41,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:20:41,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 23:20:41,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:20:41,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 23:20:41,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 23:20:41,786 INFO L87 Difference]: Start difference. First operand 32 states and 38 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) [2023-02-18 23:20:41,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:20:41,792 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2023-02-18 23:20:41,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 23:20:41,793 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 [2023-02-18 23:20:41,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:20:41,793 INFO L225 Difference]: With dead ends: 32 [2023-02-18 23:20:41,793 INFO L226 Difference]: Without dead ends: 31 [2023-02-18 23:20:41,794 INFO L412 NwaCegarLoop]: 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 [2023-02-18 23:20:41,795 INFO L413 NwaCegarLoop]: 17 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, 18 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 [2023-02-18 23:20:41,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 18 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 23:20:41,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-18 23:20:41,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-02-18 23:20:41,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.4230769230769231) 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) [2023-02-18 23:20:41,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2023-02-18 23:20:41,799 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 9 [2023-02-18 23:20:41,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:20:41,799 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-02-18 23:20:41,799 INFO L496 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) [2023-02-18 23:20:41,799 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2023-02-18 23:20:41,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-18 23:20:41,800 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:20:41,800 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2023-02-18 23:20:41,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-18 23:20:41,800 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-02-18 23:20:41,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:20:41,801 INFO L85 PathProgramCache]: Analyzing trace with hash 944544627, now seen corresponding path program 1 times [2023-02-18 23:20:41,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:20:41,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561319659] [2023-02-18 23:20:41,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:20:41,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:20:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:20:41,827 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 23:20:41,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:20:41,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561319659] [2023-02-18 23:20:41,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561319659] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 23:20:41,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738057471] [2023-02-18 23:20:41,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:20:41,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:20:41,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:20:41,830 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) [2023-02-18 23:20:41,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-18 23:20:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:20:41,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-18 23:20:41,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:20:41,879 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 23:20:41,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:20:41,890 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 23:20:41,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738057471] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:20:41,891 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 23:20:41,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-02-18 23:20:41,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048068033] [2023-02-18 23:20:41,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 23:20:41,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 23:20:41,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:20:41,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 23:20:41,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-02-18 23:20:41,892 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 23:20:41,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:20:41,928 INFO L93 Difference]: Finished difference Result 84 states and 99 transitions. [2023-02-18 23:20:41,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 23:20:41,928 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-18 23:20:41,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:20:41,930 INFO L225 Difference]: With dead ends: 84 [2023-02-18 23:20:41,930 INFO L226 Difference]: Without dead ends: 83 [2023-02-18 23:20:41,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-02-18 23:20:41,931 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 55 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 23:20:41,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 79 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 23:20:41,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-18 23:20:41,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 43. [2023-02-18 23:20:41,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.368421052631579) internal successors, (52), 42 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 23:20:41,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2023-02-18 23:20:41,936 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 11 [2023-02-18 23:20:41,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:20:41,937 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2023-02-18 23:20:41,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 23:20:41,937 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2023-02-18 23:20:41,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-18 23:20:41,937 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:20:41,937 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:20:41,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-18 23:20:42,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:20:42,142 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-02-18 23:20:42,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:20:42,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1892656240, now seen corresponding path program 1 times [2023-02-18 23:20:42,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:20:42,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840502042] [2023-02-18 23:20:42,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:20:42,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:20:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:20:42,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 23:20:42,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:20:42,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840502042] [2023-02-18 23:20:42,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840502042] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:20:42,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:20:42,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 23:20:42,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682294525] [2023-02-18 23:20:42,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:20:42,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 23:20:42,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:20:42,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 23:20:42,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 23:20:42,178 INFO L87 Difference]: Start difference. First operand 43 states and 52 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) [2023-02-18 23:20:42,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:20:42,198 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2023-02-18 23:20:42,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 23:20:42,199 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 [2023-02-18 23:20:42,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:20:42,199 INFO L225 Difference]: With dead ends: 46 [2023-02-18 23:20:42,199 INFO L226 Difference]: Without dead ends: 44 [2023-02-18 23:20:42,199 INFO L412 NwaCegarLoop]: 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 [2023-02-18 23:20:42,200 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 23:20:42,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 18 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 23:20:42,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-18 23:20:42,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2023-02-18 23:20:42,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 36 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 23:20:42,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2023-02-18 23:20:42,204 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 11 [2023-02-18 23:20:42,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:20:42,205 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2023-02-18 23:20:42,205 INFO L496 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) [2023-02-18 23:20:42,205 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2023-02-18 23:20:42,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-18 23:20:42,205 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:20:42,205 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:20:42,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-18 23:20:42,206 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-02-18 23:20:42,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:20:42,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1457198630, now seen corresponding path program 1 times [2023-02-18 23:20:42,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:20:42,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269481099] [2023-02-18 23:20:42,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:20:42,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:20:42,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:20:42,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 23:20:42,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:20:42,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269481099] [2023-02-18 23:20:42,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269481099] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:20:42,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:20:42,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 23:20:42,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633391756] [2023-02-18 23:20:42,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:20:42,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 23:20:42,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:20:42,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 23:20:42,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 23:20:42,226 INFO L87 Difference]: Start difference. First operand 37 states and 44 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) [2023-02-18 23:20:42,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:20:42,262 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2023-02-18 23:20:42,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 23:20:42,263 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 [2023-02-18 23:20:42,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:20:42,263 INFO L225 Difference]: With dead ends: 67 [2023-02-18 23:20:42,264 INFO L226 Difference]: Without dead ends: 65 [2023-02-18 23:20:42,264 INFO L412 NwaCegarLoop]: 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 [2023-02-18 23:20:42,265 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 32 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 23:20:42,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 43 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 23:20:42,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-02-18 23:20:42,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 48. [2023-02-18 23:20:42,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 45 states have (on average 1.288888888888889) internal successors, (58), 47 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 23:20:42,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2023-02-18 23:20:42,271 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 12 [2023-02-18 23:20:42,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:20:42,271 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2023-02-18 23:20:42,271 INFO L496 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) [2023-02-18 23:20:42,272 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2023-02-18 23:20:42,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-18 23:20:42,272 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:20:42,272 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:20:42,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-18 23:20:42,272 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-02-18 23:20:42,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:20:42,273 INFO L85 PathProgramCache]: Analyzing trace with hash -210231649, now seen corresponding path program 1 times [2023-02-18 23:20:42,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:20:42,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570694233] [2023-02-18 23:20:42,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:20:42,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:20:42,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:20:42,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 23:20:42,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:20:42,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570694233] [2023-02-18 23:20:42,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570694233] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 23:20:42,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640075640] [2023-02-18 23:20:42,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:20:42,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:20:42,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:20:42,323 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) [2023-02-18 23:20:42,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-18 23:20:42,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:20:42,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-18 23:20:42,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:20:42,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 23:20:42,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:20:42,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 23:20:42,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640075640] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:20:42,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 23:20:42,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-02-18 23:20:42,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675341722] [2023-02-18 23:20:42,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 23:20:42,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 23:20:42,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:20:42,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 23:20:42,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-02-18 23:20:42,411 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 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) [2023-02-18 23:20:42,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:20:42,450 INFO L93 Difference]: Finished difference Result 130 states and 157 transitions. [2023-02-18 23:20:42,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 23:20:42,451 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 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) Word has length 14 [2023-02-18 23:20:42,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:20:42,452 INFO L225 Difference]: With dead ends: 130 [2023-02-18 23:20:42,452 INFO L226 Difference]: Without dead ends: 129 [2023-02-18 23:20:42,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-02-18 23:20:42,453 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 32 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 23:20:42,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 70 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 23:20:42,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-02-18 23:20:42,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 102. [2023-02-18 23:20:42,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 99 states have (on average 1.2828282828282829) internal successors, (127), 101 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 23:20:42,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 127 transitions. [2023-02-18 23:20:42,462 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 127 transitions. Word has length 14 [2023-02-18 23:20:42,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:20:42,463 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 127 transitions. [2023-02-18 23:20:42,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 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) [2023-02-18 23:20:42,463 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 127 transitions. [2023-02-18 23:20:42,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-18 23:20:42,463 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:20:42,463 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:20:42,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-18 23:20:42,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-02-18 23:20:42,684 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-02-18 23:20:42,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:20:42,684 INFO L85 PathProgramCache]: Analyzing trace with hash 888940113, now seen corresponding path program 1 times [2023-02-18 23:20:42,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:20:42,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993535960] [2023-02-18 23:20:42,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:20:42,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:20:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:20:42,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-18 23:20:42,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:20:42,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993535960] [2023-02-18 23:20:42,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993535960] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 23:20:42,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 23:20:42,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 23:20:42,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710533135] [2023-02-18 23:20:42,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 23:20:42,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 23:20:42,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:20:42,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 23:20:42,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 23:20:42,724 INFO L87 Difference]: Start difference. First operand 102 states and 127 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 23:20:42,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:20:42,742 INFO L93 Difference]: Finished difference Result 102 states and 127 transitions. [2023-02-18 23:20:42,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 23:20:42,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-18 23:20:42,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:20:42,744 INFO L225 Difference]: With dead ends: 102 [2023-02-18 23:20:42,744 INFO L226 Difference]: Without dead ends: 101 [2023-02-18 23:20:42,744 INFO L412 NwaCegarLoop]: 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 [2023-02-18 23:20:42,746 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 23:20:42,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 22 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 23:20:42,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-02-18 23:20:42,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 93. [2023-02-18 23:20:42,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 91 states have (on average 1.2637362637362637) internal successors, (115), 92 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) [2023-02-18 23:20:42,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 115 transitions. [2023-02-18 23:20:42,770 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 115 transitions. Word has length 16 [2023-02-18 23:20:42,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:20:42,771 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 115 transitions. [2023-02-18 23:20:42,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 23:20:42,771 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 115 transitions. [2023-02-18 23:20:42,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-18 23:20:42,772 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:20:42,772 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:20:42,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-18 23:20:42,772 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-02-18 23:20:42,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:20:42,773 INFO L85 PathProgramCache]: Analyzing trace with hash -428731052, now seen corresponding path program 1 times [2023-02-18 23:20:42,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:20:42,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062883048] [2023-02-18 23:20:42,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:20:42,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:20:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:20:42,795 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 23:20:42,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:20:42,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062883048] [2023-02-18 23:20:42,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062883048] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 23:20:42,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195184386] [2023-02-18 23:20:42,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:20:42,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:20:42,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:20:42,805 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) [2023-02-18 23:20:42,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-18 23:20:42,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:20:42,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-18 23:20:42,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:20:42,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 23:20:42,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:20:42,865 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 23:20:42,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195184386] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:20:42,865 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 23:20:42,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2023-02-18 23:20:42,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881512078] [2023-02-18 23:20:42,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 23:20:42,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 23:20:42,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:20:42,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 23:20:42,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 23:20:42,867 INFO L87 Difference]: Start difference. First operand 93 states and 115 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 23:20:42,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:20:42,887 INFO L93 Difference]: Finished difference Result 148 states and 180 transitions. [2023-02-18 23:20:42,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 23:20:42,887 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-18 23:20:42,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:20:42,888 INFO L225 Difference]: With dead ends: 148 [2023-02-18 23:20:42,888 INFO L226 Difference]: Without dead ends: 104 [2023-02-18 23:20:42,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-02-18 23:20:42,889 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 17 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 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 [2023-02-18 23:20:42,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 57 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 23:20:42,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-18 23:20:42,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2023-02-18 23:20:42,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 97 states have (on average 1.2268041237113403) internal successors, (119), 98 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 23:20:42,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 119 transitions. [2023-02-18 23:20:42,895 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 119 transitions. Word has length 18 [2023-02-18 23:20:42,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:20:42,895 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 119 transitions. [2023-02-18 23:20:42,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 23:20:42,895 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 119 transitions. [2023-02-18 23:20:42,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-18 23:20:42,896 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:20:42,896 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:20:42,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-18 23:20:43,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:20:43,100 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-02-18 23:20:43,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:20:43,100 INFO L85 PathProgramCache]: Analyzing trace with hash -292270522, now seen corresponding path program 2 times [2023-02-18 23:20:43,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:20:43,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464647522] [2023-02-18 23:20:43,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:20:43,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:20:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:20:43,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-18 23:20:43,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:20:43,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464647522] [2023-02-18 23:20:43,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464647522] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 23:20:43,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196068210] [2023-02-18 23:20:43,131 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 23:20:43,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:20:43,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:20:43,132 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) [2023-02-18 23:20:43,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-18 23:20:43,152 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-18 23:20:43,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:20:43,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-18 23:20:43,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:20:43,158 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-18 23:20:43,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:20:43,164 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-18 23:20:43,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196068210] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:20:43,164 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 23:20:43,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-02-18 23:20:43,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746305922] [2023-02-18 23:20:43,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 23:20:43,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 23:20:43,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:20:43,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 23:20:43,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 23:20:43,165 INFO L87 Difference]: Start difference. First operand 99 states and 119 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 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) [2023-02-18 23:20:43,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:20:43,178 INFO L93 Difference]: Finished difference Result 100 states and 119 transitions. [2023-02-18 23:20:43,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 23:20:43,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 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 18 [2023-02-18 23:20:43,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:20:43,179 INFO L225 Difference]: With dead ends: 100 [2023-02-18 23:20:43,179 INFO L226 Difference]: Without dead ends: 81 [2023-02-18 23:20:43,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 23:20:43,180 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 26 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 [2023-02-18 23:20:43,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 26 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 23:20:43,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-18 23:20:43,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-02-18 23:20:43,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 79 states have (on average 1.240506329113924) internal successors, (98), 80 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 23:20:43,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 98 transitions. [2023-02-18 23:20:43,191 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 98 transitions. Word has length 18 [2023-02-18 23:20:43,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:20:43,191 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 98 transitions. [2023-02-18 23:20:43,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 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) [2023-02-18 23:20:43,192 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 98 transitions. [2023-02-18 23:20:43,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-18 23:20:43,192 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:20:43,192 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:20:43,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-18 23:20:43,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:20:43,398 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-02-18 23:20:43,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:20:43,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1701396303, now seen corresponding path program 1 times [2023-02-18 23:20:43,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:20:43,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779286767] [2023-02-18 23:20:43,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:20:43,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:20:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:20:43,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 23:20:43,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:20:43,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779286767] [2023-02-18 23:20:43,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779286767] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 23:20:43,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471790495] [2023-02-18 23:20:43,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:20:43,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:20:43,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:20:43,442 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) [2023-02-18 23:20:43,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-18 23:20:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:20:43,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 23:20:43,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:20:43,495 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 23:20:43,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:20:43,520 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 23:20:43,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471790495] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:20:43,520 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 23:20:43,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-02-18 23:20:43,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454515028] [2023-02-18 23:20:43,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 23:20:43,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-18 23:20:43,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:20:43,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-18 23:20:43,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-02-18 23:20:43,522 INFO L87 Difference]: Start difference. First operand 81 states and 98 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 10 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) [2023-02-18 23:20:43,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:20:43,658 INFO L93 Difference]: Finished difference Result 320 states and 382 transitions. [2023-02-18 23:20:43,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-18 23:20:43,659 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 10 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) Word has length 19 [2023-02-18 23:20:43,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:20:43,660 INFO L225 Difference]: With dead ends: 320 [2023-02-18 23:20:43,660 INFO L226 Difference]: Without dead ends: 319 [2023-02-18 23:20:43,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=362, Unknown=0, NotChecked=0, Total=552 [2023-02-18 23:20:43,662 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 283 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:20:43,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 49 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 23:20:43,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2023-02-18 23:20:43,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 157. [2023-02-18 23:20:43,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 155 states have (on average 1.238709677419355) internal successors, (192), 156 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 23:20:43,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 192 transitions. [2023-02-18 23:20:43,675 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 192 transitions. Word has length 19 [2023-02-18 23:20:43,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:20:43,675 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 192 transitions. [2023-02-18 23:20:43,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 10 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) [2023-02-18 23:20:43,675 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 192 transitions. [2023-02-18 23:20:43,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-18 23:20:43,679 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:20:43,679 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2023-02-18 23:20:43,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-18 23:20:43,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-18 23:20:43,883 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-02-18 23:20:43,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:20:43,884 INFO L85 PathProgramCache]: Analyzing trace with hash -813986932, now seen corresponding path program 2 times [2023-02-18 23:20:43,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:20:43,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907035897] [2023-02-18 23:20:43,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:20:43,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:20:43,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:20:43,908 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-02-18 23:20:43,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:20:43,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907035897] [2023-02-18 23:20:43,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907035897] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 23:20:43,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259579089] [2023-02-18 23:20:43,909 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 23:20:43,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:20:43,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:20:43,910 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) [2023-02-18 23:20:43,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-18 23:20:43,931 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-18 23:20:43,931 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:20:43,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-18 23:20:43,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:20:43,943 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-02-18 23:20:43,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:20:43,954 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-02-18 23:20:43,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259579089] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:20:43,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 23:20:43,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-02-18 23:20:43,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119986520] [2023-02-18 23:20:43,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 23:20:43,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 23:20:43,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:20:43,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 23:20:43,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 23:20:43,955 INFO L87 Difference]: Start difference. First operand 157 states and 192 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) [2023-02-18 23:20:43,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:20:43,974 INFO L93 Difference]: Finished difference Result 157 states and 192 transitions. [2023-02-18 23:20:43,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 23:20:43,974 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 35 [2023-02-18 23:20:43,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:20:43,974 INFO L225 Difference]: With dead ends: 157 [2023-02-18 23:20:43,974 INFO L226 Difference]: Without dead ends: 156 [2023-02-18 23:20:43,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 23:20:43,975 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 7 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 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 [2023-02-18 23:20:43,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 25 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 23:20:43,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-02-18 23:20:43,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 52. [2023-02-18 23:20:43,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 51 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 23:20:43,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2023-02-18 23:20:43,978 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 35 [2023-02-18 23:20:43,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:20:43,979 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2023-02-18 23:20:43,979 INFO L496 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) [2023-02-18 23:20:43,979 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2023-02-18 23:20:43,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-18 23:20:43,979 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:20:43,979 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-02-18 23:20:43,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-18 23:20:44,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-02-18 23:20:44,183 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-02-18 23:20:44,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:20:44,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1838217185, now seen corresponding path program 1 times [2023-02-18 23:20:44,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:20:44,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406867073] [2023-02-18 23:20:44,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:20:44,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:20:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:20:44,247 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 23:20:44,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:20:44,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406867073] [2023-02-18 23:20:44,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406867073] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 23:20:44,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513745702] [2023-02-18 23:20:44,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:20:44,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:20:44,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:20:44,249 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) [2023-02-18 23:20:44,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-18 23:20:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:20:44,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-18 23:20:44,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:20:44,296 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 23:20:44,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:20:44,345 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 23:20:44,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513745702] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:20:44,345 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 23:20:44,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2023-02-18 23:20:44,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722867547] [2023-02-18 23:20:44,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 23:20:44,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 23:20:44,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:20:44,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 23:20:44,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2023-02-18 23:20:44,347 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 16 states, 15 states have (on average 4.533333333333333) internal successors, (68), 16 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) [2023-02-18 23:20:44,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:20:44,752 INFO L93 Difference]: Finished difference Result 344 states and 401 transitions. [2023-02-18 23:20:44,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-02-18 23:20:44,753 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.533333333333333) internal successors, (68), 16 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 35 [2023-02-18 23:20:44,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:20:44,756 INFO L225 Difference]: With dead ends: 344 [2023-02-18 23:20:44,756 INFO L226 Difference]: Without dead ends: 343 [2023-02-18 23:20:44,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=871, Invalid=1679, Unknown=0, NotChecked=0, Total=2550 [2023-02-18 23:20:44,758 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 638 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:20:44,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 99 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 23:20:44,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2023-02-18 23:20:44,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 101. [2023-02-18 23:20:44,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.17) internal successors, (117), 100 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 23:20:44,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2023-02-18 23:20:44,768 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 35 [2023-02-18 23:20:44,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:20:44,768 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2023-02-18 23:20:44,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.533333333333333) internal successors, (68), 16 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) [2023-02-18 23:20:44,768 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2023-02-18 23:20:44,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-18 23:20:44,771 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:20:44,771 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-02-18 23:20:44,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-18 23:20:44,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:20:44,978 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-02-18 23:20:44,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:20:44,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1212228847, now seen corresponding path program 2 times [2023-02-18 23:20:44,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:20:44,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593454899] [2023-02-18 23:20:44,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:20:44,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:20:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:20:45,144 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 23:20:45,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:20:45,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593454899] [2023-02-18 23:20:45,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593454899] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 23:20:45,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456284869] [2023-02-18 23:20:45,144 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 23:20:45,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:20:45,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:20:45,145 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) [2023-02-18 23:20:45,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-18 23:20:45,204 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 23:20:45,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:20:45,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-18 23:20:45,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:20:45,257 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 23:20:45,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:20:45,397 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 23:20:45,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456284869] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:20:45,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 23:20:45,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2023-02-18 23:20:45,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614813184] [2023-02-18 23:20:45,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 23:20:45,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-18 23:20:45,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:20:45,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-18 23:20:45,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=433, Unknown=0, NotChecked=0, Total=650 [2023-02-18 23:20:45,399 INFO L87 Difference]: Start difference. First operand 101 states and 117 transitions. Second operand has 26 states, 25 states have (on average 4.72) internal successors, (118), 26 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 23:20:46,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:20:46,410 INFO L93 Difference]: Finished difference Result 812 states and 940 transitions. [2023-02-18 23:20:46,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2023-02-18 23:20:46,411 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.72) internal successors, (118), 26 states have internal predecessors, (118), 0 states have call successors, (0), 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 60 [2023-02-18 23:20:46,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:20:46,414 INFO L225 Difference]: With dead ends: 812 [2023-02-18 23:20:46,414 INFO L226 Difference]: Without dead ends: 811 [2023-02-18 23:20:46,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 99 SyntacticMatches, 9 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4133 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=3646, Invalid=7484, Unknown=0, NotChecked=0, Total=11130 [2023-02-18 23:20:46,419 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 968 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 23:20:46,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 203 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 23:20:46,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2023-02-18 23:20:46,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 151. [2023-02-18 23:20:46,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 1.18) internal successors, (177), 150 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 23:20:46,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 177 transitions. [2023-02-18 23:20:46,441 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 177 transitions. Word has length 60 [2023-02-18 23:20:46,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:20:46,442 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 177 transitions. [2023-02-18 23:20:46,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.72) internal successors, (118), 26 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 23:20:46,443 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 177 transitions. [2023-02-18 23:20:46,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-02-18 23:20:46,443 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 23:20:46,443 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1] [2023-02-18 23:20:46,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-18 23:20:46,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-18 23:20:46,647 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-02-18 23:20:46,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 23:20:46,648 INFO L85 PathProgramCache]: Analyzing trace with hash 626428527, now seen corresponding path program 3 times [2023-02-18 23:20:46,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 23:20:46,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100126974] [2023-02-18 23:20:46,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 23:20:46,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 23:20:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 23:20:46,735 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-02-18 23:20:46,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 23:20:46,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100126974] [2023-02-18 23:20:46,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100126974] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 23:20:46,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180102529] [2023-02-18 23:20:46,735 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 23:20:46,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:20:46,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 23:20:46,736 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) [2023-02-18 23:20:46,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-18 23:20:46,759 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-02-18 23:20:46,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 23:20:46,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 23:20:46,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 23:20:46,787 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-02-18 23:20:46,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 23:20:46,818 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-02-18 23:20:46,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180102529] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 23:20:46,819 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 23:20:46,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2023-02-18 23:20:46,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755302913] [2023-02-18 23:20:46,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 23:20:46,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 23:20:46,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 23:20:46,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 23:20:46,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-02-18 23:20:46,821 INFO L87 Difference]: Start difference. First operand 151 states and 177 transitions. Second operand has 11 states, 10 states have (on average 7.0) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 23:20:47,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 23:20:47,002 INFO L93 Difference]: Finished difference Result 774 states and 909 transitions. [2023-02-18 23:20:47,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-18 23:20:47,002 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.0) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 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 62 [2023-02-18 23:20:47,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 23:20:47,002 INFO L225 Difference]: With dead ends: 774 [2023-02-18 23:20:47,002 INFO L226 Difference]: Without dead ends: 0 [2023-02-18 23:20:47,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 118 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=320, Invalid=672, Unknown=0, NotChecked=0, Total=992 [2023-02-18 23:20:47,006 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 146 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 23:20:47,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 74 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 23:20:47,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-18 23:20:47,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-18 23:20:47,007 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) [2023-02-18 23:20:47,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-18 23:20:47,007 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2023-02-18 23:20:47,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 23:20:47,007 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 23:20:47,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.0) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 23:20:47,007 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-18 23:20:47,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-18 23:20:47,009 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2023-02-18 23:20:47,010 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2023-02-18 23:20:47,010 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2023-02-18 23:20:47,010 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2023-02-18 23:20:47,010 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2023-02-18 23:20:47,010 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2023-02-18 23:20:47,010 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2023-02-18 23:20:47,010 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2023-02-18 23:20:47,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-02-18 23:20:47,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 23:20:47,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-18 23:20:47,227 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2023-02-18 23:20:47,231 INFO L895 garLoopResultBuilder]: At program point L23-2(lines 23 34) the Hoare annotation is: (let ((.cse52 (<= 0 |ULTIMATE.start_main_~j~0#1|)) (.cse3 (<= 0 |ULTIMATE.start_main_~i~0#1|))) (let ((.cse7 (<= |ULTIMATE.start_main_~k~0#1| 0)) (.cse4 (or (and .cse3 .cse52) .cse3)) (.cse0 (<= |ULTIMATE.start_main_~N~0#1| 2147483647)) (.cse14 (<= |ULTIMATE.start_main_~j~0#1| 0)) (.cse6 (<= 0 |ULTIMATE.start_main_~N~0#1|))) (let ((.cse1 (<= |ULTIMATE.start_main_~n~0#1| 2147483647)) (.cse16 (let ((.cse49 (and .cse0 (or .cse52 (and .cse14 .cse52)) .cse3 (<= 0 |ULTIMATE.start_main_~k~0#1|) .cse6)) (.cse51 (and .cse14 .cse0 .cse3 .cse4 .cse6))) (let ((.cse48 (and .cse7 (or .cse49 .cse51)))) (let ((.cse50 (or .cse48 .cse49 .cse51))) (or .cse48 .cse49 (and .cse50 (<= (+ 1 |ULTIMATE.start_main_~j~0#1|) 2147483647)) (and (<= |ULTIMATE.start_main_~j~0#1| 1) .cse50) (and .cse14 .cse50) (and .cse50 (< (+ |ULTIMATE.start_main_~j~0#1| 1) 2147483647)) .cse51))))) (.cse17 (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~j~0#1|))) (let ((.cse34 (+ |ULTIMATE.start_main_~k~0#1| 1)) (.cse25 (or (and .cse0 .cse1 .cse16 .cse17) (and .cse0 .cse1 (<= (+ |ULTIMATE.start_main_~k~0#1| 2) 2147483647) .cse16 .cse17) (and .cse0 .cse1 (<= (+ |ULTIMATE.start_main_~k~0#1| (- 1)) 2147483645) .cse16 .cse17))) (.cse2 (<= |ULTIMATE.start_main_~m~0#1| 2147483647)) (.cse46 (< |ULTIMATE.start_main_~k~0#1| 2147483647))) (let ((.cse45 (and .cse25 .cse2 .cse46)) (.cse47 (and .cse25 .cse2)) (.cse41 (< .cse34 2147483646)) (.cse23 (<= (+ 1 |ULTIMATE.start_main_~i~0#1|) 2147483647)) (.cse43 (< |ULTIMATE.start_main_~k~0#1| 2147483646)) (.cse35 (+ |ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse26 (< |ULTIMATE.start_main_~i~0#1| 2147483644)) (.cse27 (<= |ULTIMATE.start_main_~k~0#1| 3)) (.cse24 (< .cse35 2147483647)) (.cse21 (<= |ULTIMATE.start_main_~k~0#1| 1)) (.cse5 (<= |ULTIMATE.start_main_~i~0#1| 2147483646)) (.cse31 (< .cse34 2147483645)) (.cse32 (or (and .cse25 .cse2 .cse23 .cse41) (and .cse25 .cse2 .cse23 .cse43))) (.cse30 (or .cse45 .cse47))) (let ((.cse10 (or .cse45 (and .cse30 .cse46) .cse47)) (.cse11 (let ((.cse42 (< .cse34 2147483641)) (.cse44 (< .cse34 2147483642))) (or (and .cse23 .cse30 .cse31) (and .cse23 .cse30 .cse41) (and (< .cse34 2147483644) .cse23 .cse30) (and (< .cse34 2147483643) .cse23 .cse30) (and .cse42 .cse23 .cse30) (and .cse32 .cse43 .cse23) (and .cse32 .cse42 .cse23) (and .cse43 .cse23 .cse30) (and .cse32 .cse23 .cse44) (and .cse23 .cse30 .cse44)))) (.cse13 (<= |ULTIMATE.start_main_~k~0#1| 2147483646)) (.cse19 (let ((.cse38 (<= |ULTIMATE.start_main_~k~0#1| 2))) (let ((.cse39 (<= |ULTIMATE.start_main_~k~0#1| 7)) (.cse37 (let ((.cse40 (<= |ULTIMATE.start_main_~i~0#1| 3))) (or (and .cse40 .cse0 .cse1 .cse2 .cse21 .cse38 .cse5 .cse16 .cse17) (and .cse40 .cse0 .cse1 .cse2 .cse21 .cse5 .cse16 .cse17) (and .cse25 .cse40 .cse2 .cse38)))) (.cse36 (<= |ULTIMATE.start_main_~i~0#1| 8))) (or (and .cse36 .cse37 .cse38) (and .cse25 .cse2 .cse36 .cse26 .cse27 .cse39) (and .cse25 .cse2 .cse36 .cse26 .cse27) (and .cse25 .cse2 .cse36 .cse24 (<= |ULTIMATE.start_main_~k~0#1| 4) .cse31) (and .cse36 .cse30 .cse39) (and .cse25 .cse2 .cse36 .cse24 .cse39 .cse31) (and .cse36 .cse37 .cse39) (and .cse36 .cse32 (<= |ULTIMATE.start_main_~k~0#1| 6)) (and .cse36 .cse32 .cse39) (and .cse36 .cse37 .cse21) (and .cse36 .cse32 (<= |ULTIMATE.start_main_~k~0#1| 5)))))) (.cse9 (<= |ULTIMATE.start_main_~i~0#1| 1)) (.cse8 (<= |ULTIMATE.start_main_~N~0#1| 1)) (.cse20 (<= .cse35 2147483647)) (.cse12 (let ((.cse33 (< .cse34 2147483640))) (or (and .cse25 .cse33 .cse2 .cse24 .cse31) (and .cse33 .cse32 .cse24) (and .cse33 .cse24 .cse30)))) (.cse15 (<= |ULTIMATE.start_main_~m~0#1| 0)) (.cse18 (>= |ULTIMATE.start_main_~j~0#1| 0)) (.cse22 (let ((.cse28 (< |ULTIMATE.start_main_~i~0#1| 2147483639)) (.cse29 (<= |ULTIMATE.start_main_~k~0#1| 8))) (or (and .cse25 .cse2 .cse26 .cse27 .cse28 .cse29) (and .cse30 .cse28 .cse29) (and .cse25 .cse2 .cse24 .cse28 .cse29 .cse31) (and .cse32 .cse28 .cse29))))) (or (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_main_~i~0#1| 0) .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse11 .cse7 .cse8 .cse9) (and .cse1 .cse12 .cse13) (and .cse1 (or (and .cse14 .cse0 .cse15 .cse16 .cse17) (and .cse14 .cse0 .cse15 .cse18 .cse16))) (and .cse1 .cse11) (and .cse1 .cse19 .cse8 .cse20 .cse21) (and .cse22 .cse1 .cse8 .cse20 .cse21) (and .cse1 .cse13 .cse10) (and .cse1 .cse12) (and .cse1 .cse8 .cse20 .cse21 .cse10) (and .cse14 .cse0 .cse15 .cse1 .cse3 .cse4 .cse9 .cse6 .cse17) (and .cse22 .cse1 .cse7 .cse8 .cse9) (and .cse22 .cse1 .cse8 .cse13) (and .cse1 .cse11 .cse13) (and .cse14 .cse0 .cse15 .cse1 .cse3 .cse4 .cse23 .cse18 .cse6) (and .cse1 .cse10) (and .cse1 .cse8 .cse12 .cse13) (and .cse1 .cse11 .cse8 .cse13) (and .cse1 .cse19) (and .cse1 .cse8 .cse13 .cse10) (and .cse1 .cse11 .cse8 .cse20 .cse21) (and .cse1 .cse7 .cse19 .cse8 .cse9) (and .cse1 .cse19 .cse13) (and .cse22 .cse1 .cse13) (and .cse1 .cse7 .cse8 .cse9 .cse12) (and .cse1 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse7 (<= |ULTIMATE.start_main_~i~0#1| 7) .cse8 (<= |ULTIMATE.start_main_~i~0#1| 2) .cse9 .cse16 .cse17) (and .cse1 .cse8 .cse20 .cse21 .cse12) (and .cse14 .cse0 .cse15 .cse1 .cse3 .cse24 .cse4 .cse18 .cse6) (and .cse22 .cse1))))))))) [2023-02-18 23:20:47,231 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 13 37) the Hoare annotation is: true [2023-02-18 23:20:47,231 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2023-02-18 23:20:47,231 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-18 23:20:47,231 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2023-02-18 23:20:47,231 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2023-02-18 23:20:47,231 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-18 23:20:47,231 INFO L899 garLoopResultBuilder]: For program point L28-1(line 28) no Hoare annotation was computed. [2023-02-18 23:20:47,231 INFO L899 garLoopResultBuilder]: For program point L28-2(lines 28 30) no Hoare annotation was computed. [2023-02-18 23:20:47,233 INFO L895 garLoopResultBuilder]: At program point L28-4(lines 28 30) the Hoare annotation is: (let ((.cse41 (+ |ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse48 (<= (+ 1 |ULTIMATE.start_main_~i~0#1|) 2147483647)) (.cse13 (<= |ULTIMATE.start_main_~i~0#1| 1)) (.cse69 (<= |ULTIMATE.start_main_~N~0#1| 2147483647)) (.cse45 (< .cse41 2147483647)) (.cse3 (<= |ULTIMATE.start_main_~i~0#1| 0))) (let ((.cse71 (<= 0 |ULTIMATE.start_main_~i~0#1|)) (.cse73 (<= 0 |ULTIMATE.start_main_~k~0#1|)) (.cse74 (let ((.cse85 (let ((.cse87 (<= 0 |ULTIMATE.start_main_~j~0#1|))) (or (and .cse3 .cse87) .cse87))) (.cse86 (<= 0 |ULTIMATE.start_main_~N~0#1|))) (or (and .cse69 .cse48 .cse85 .cse86) (and .cse69 .cse3 .cse85 .cse86) (and .cse69 .cse85 .cse13 .cse86) (and .cse69 .cse85 .cse86) (and .cse69 .cse45 .cse85 .cse86))))) (let ((.cse77 (< (+ |ULTIMATE.start_main_~j~0#1| 1) 2147483647)) (.cse72 (<= (+ 1 |ULTIMATE.start_main_~j~0#1|) 2147483647)) (.cse70 (<= |ULTIMATE.start_main_~m~0#1| 2147483647)) (.cse84 (<= (+ |ULTIMATE.start_main_~k~0#1| (- 1)) 2147483645)) (.cse75 (<= |ULTIMATE.start_main_~j~0#1| 1)) (.cse0 (<= |ULTIMATE.start_main_~n~0#1| 2147483647)) (.cse83 (<= (+ |ULTIMATE.start_main_~k~0#1| 2) 2147483647)) (.cse82 (or (and .cse3 .cse71 .cse73 .cse74) (and .cse71 .cse73 .cse74))) (.cse76 (<= |ULTIMATE.start_main_~i~0#1| 2147483646))) (let ((.cse54 (and .cse70 (or (and .cse75 .cse69 .cse0 .cse3 .cse82 .cse84 .cse76) (and .cse75 .cse69 .cse0 .cse83 .cse82 .cse13 .cse76) (and .cse75 .cse69 .cse0 .cse82 .cse84 .cse76) (and .cse75 .cse69 .cse0 .cse82 .cse13 .cse84 .cse76) (and .cse75 .cse69 .cse0 .cse3 .cse83 .cse82 .cse76)))) (.cse47 (and .cse70 (or (and .cse69 .cse0 .cse82 .cse13 .cse84) (and .cse69 .cse0 .cse3 .cse82 .cse84) (and .cse69 .cse0 .cse82 .cse84) (and .cse69 .cse0 .cse83 .cse82 .cse13) (and .cse69 .cse0 .cse82 .cse84 .cse76) (and .cse69 .cse0 .cse3 .cse83 .cse82)))) (.cse63 (and .cse70 (or (and .cse69 .cse0 .cse3 .cse72 .cse83 .cse82) (and .cse69 .cse0 .cse72 .cse82 .cse84 .cse76) (and .cse69 .cse0 .cse72 .cse82 .cse13 .cse84) (and .cse69 .cse0 .cse3 .cse72 .cse82 .cse84) (and .cse69 .cse0 .cse72 .cse83 .cse82 .cse13) (and .cse69 .cse0 .cse72 .cse82 .cse84)))) (.cse64 (and .cse70 (or (and .cse69 .cse0 .cse77 .cse83 .cse82 .cse13) (and .cse69 .cse0 .cse77 .cse82 .cse13 .cse84) (and .cse69 .cse0 .cse3 .cse77 .cse82 .cse84) (and .cse69 .cse0 .cse3 .cse77 .cse83 .cse82) (and .cse69 .cse0 .cse77 .cse82 .cse84 .cse76) (and .cse69 .cse0 .cse77 .cse82 .cse84))))) (let ((.cse22 (<= |ULTIMATE.start_main_~k~0#1| 1)) (.cse44 (< |ULTIMATE.start_main_~k~0#1| 2147483646)) (.cse40 (+ |ULTIMATE.start_main_~k~0#1| 1)) (.cse79 (<= |ULTIMATE.start_main_~i~0#1| 2)) (.cse81 (< |ULTIMATE.start_main_~i~0#1| 2147483644)) (.cse26 (or (and .cse69 .cse0 .cse70 .cse77 .cse82) (and .cse75 .cse69 .cse0 .cse70 .cse82 .cse76) (and .cse69 .cse0 .cse70 .cse82) (and .cse69 .cse0 .cse70 .cse72 .cse82))) (.cse80 (<= |ULTIMATE.start_main_~i~0#1| 3)) (.cse78 (or .cse54 .cse47 .cse63 .cse64)) (.cse49 (< |ULTIMATE.start_main_~k~0#1| 2147483647))) (let ((.cse58 (and .cse78 .cse45 .cse49)) (.cse50 (and .cse3 .cse78)) (.cse59 (and .cse80 .cse78)) (.cse51 (and .cse80 .cse78 .cse49)) (.cse60 (and .cse48 .cse26 .cse49)) (.cse52 (and .cse78 .cse48 .cse49)) (.cse53 (and .cse78 .cse81)) (.cse61 (and .cse78 .cse79 .cse49)) (.cse62 (and .cse78 .cse48)) (.cse55 (and .cse78 .cse79)) (.cse56 (and .cse78 .cse45)) (.cse65 (and .cse3 .cse78 .cse49)) (.cse57 (and .cse78 .cse81 .cse49)) (.cse37 (< .cse40 2147483646)) (.cse43 (< .cse40 2147483645)) (.cse46 (and .cse45 .cse44 .cse26)) (.cse10 (<= |ULTIMATE.start_main_~k~0#1| 3)) (.cse29 (or (and .cse70 (or (and .cse69 .cse0 .cse3 .cse22 .cse82) (and .cse69 .cse0 .cse22 .cse82 .cse13))) (and .cse70 (or (and .cse75 .cse69 .cse0 .cse3 .cse22 .cse82 .cse76) (and .cse75 .cse69 .cse0 .cse22 .cse82 .cse13 .cse76))) (and .cse70 (or (and .cse69 .cse0 .cse72 .cse22 .cse82 .cse13) (and .cse69 .cse0 .cse3 .cse72 .cse22 .cse82))) (and .cse70 (or (and .cse69 .cse0 .cse3 .cse77 .cse22 .cse82) (and .cse69 .cse0 .cse77 .cse22 .cse82 .cse13))))) (.cse31 (<= |ULTIMATE.start_main_~k~0#1| 2))) (let ((.cse30 (or (and .cse29 .cse31 .cse79) (and .cse3 .cse78 .cse31) (and .cse78 .cse31 .cse79))) (.cse9 (or (and .cse3 .cse78 .cse10) (and .cse78 .cse10 .cse79) (and .cse80 .cse78 .cse10) (and .cse80 .cse10 .cse26))) (.cse5 (or (and .cse78 .cse44 .cse79) (and .cse78 .cse44 .cse81) (and .cse3 .cse78 .cse44) .cse46 (and .cse80 .cse78 .cse44) (and .cse78 .cse45 .cse44))) (.cse19 (or (and .cse81 .cse26 .cse43) (and .cse78 .cse81 .cse43) (and .cse80 .cse78 .cse43) (and .cse78 .cse79 .cse43) (and .cse3 .cse78 .cse43))) (.cse27 (or (and .cse78 .cse79 .cse37) (and .cse3 .cse78 .cse37) (and .cse80 .cse78 .cse37) (and .cse78 .cse81 .cse37))) (.cse35 (<= |ULTIMATE.start_main_~i~0#1| 8)) (.cse38 (< |ULTIMATE.start_main_~i~0#1| 2147483639)) (.cse32 (<= |ULTIMATE.start_main_~i~0#1| 7)) (.cse34 (or .cse47 .cse58 .cse50 .cse59 .cse51 .cse60 .cse52 .cse53 .cse61 .cse62 .cse54 .cse63 .cse64 .cse55 .cse56 .cse65 .cse57)) (.cse1 (<= |ULTIMATE.start_main_~k~0#1| 0))) (let ((.cse16 (or (and .cse69 .cse0 .cse70 .cse1 .cse3 .cse71 .cse72 .cse73 .cse74) (and .cse75 .cse69 .cse0 .cse70 .cse1 .cse3 .cse71 .cse73 .cse74 .cse76) (and .cse69 .cse0 .cse70 .cse1 .cse3 .cse71 .cse73 .cse74) (and .cse69 .cse0 .cse70 .cse1 .cse3 .cse71 .cse77 .cse73 .cse74))) (.cse12 (let ((.cse68 (< .cse40 2147483644))) (or (and .cse35 .cse68 .cse34) (and .cse68 .cse3 .cse34) (and .cse68 .cse38 .cse34) (and .cse68 .cse32 .cse34)))) (.cse17 (let ((.cse67 (< .cse40 2147483640))) (or (and .cse67 .cse38 .cse34) (and .cse67 .cse35 .cse19) (and .cse67 .cse26 .cse38) (and .cse67 .cse32 .cse27) (and .cse67 .cse19 .cse38) (and .cse67 .cse38 .cse5) (and .cse67 .cse32 .cse5) (and .cse67 .cse3 .cse34) (and .cse67 .cse32 .cse19) (and .cse67 .cse35 .cse27) (and .cse67 .cse32 .cse34) (and .cse67 .cse35 .cse34)))) (.cse2 (<= |ULTIMATE.start_main_~k~0#1| 6)) (.cse20 (<= |ULTIMATE.start_main_~k~0#1| 4)) (.cse18 (let ((.cse66 (< .cse40 2147483642))) (or (and .cse35 .cse66 .cse34) (and .cse32 .cse66 .cse34) (and .cse38 .cse66 .cse34) (and .cse35 .cse5 .cse66) (and .cse32 .cse5 .cse66) (and .cse38 .cse5 .cse66) (and .cse3 .cse66 .cse34)))) (.cse25 (or (and .cse45 .cse34) .cse47 (and .cse48 .cse34) (and .cse35 .cse34) (and .cse32 .cse49 .cse34) .cse50 .cse51 (and .cse32 .cse34) .cse52 .cse53 .cse54 .cse55 .cse56 (and .cse45 .cse49 .cse34) .cse57 (and .cse38 .cse34) .cse58 .cse59 .cse60 (and .cse35 .cse49 .cse34) (and .cse3 .cse49 .cse34) (and .cse3 .cse34) .cse61 (and .cse48 .cse49 .cse34) .cse62 (and .cse38 .cse49 .cse34) .cse63 .cse64 .cse65)) (.cse6 (or (and .cse3 .cse44 .cse34) (and .cse45 .cse44 .cse5) (and .cse45 .cse44 .cse34) (and .cse32 .cse44 .cse34) (and .cse44 .cse38 .cse34) .cse46 (and .cse35 .cse44 .cse34))) (.cse11 (or (and .cse32 .cse34 .cse43) (and .cse38 .cse34 .cse43) (and .cse35 .cse34 .cse43) (and .cse3 .cse34 .cse43))) (.cse15 (let ((.cse42 (< .cse40 2147483641))) (or (and .cse32 .cse27 .cse42) (and .cse3 .cse42 .cse34) (and .cse35 .cse42 .cse34) (and .cse35 .cse42 .cse5) (and .cse35 .cse27 .cse42) (and .cse32 .cse42 .cse34) (and .cse42 .cse38 .cse34) (and .cse32 .cse42 .cse5) (and .cse27 .cse42 .cse38)))) (.cse28 (<= |ULTIMATE.start_main_~k~0#1| 5)) (.cse7 (<= .cse41 2147483647)) (.cse4 (<= |ULTIMATE.start_main_~N~0#1| 1)) (.cse23 (let ((.cse39 (< .cse40 2147483643))) (or (and .cse35 .cse39 .cse34) (and .cse39 .cse32 .cse34) (and .cse39 .cse38 .cse34) (and .cse39 .cse3 .cse34)))) (.cse21 (or (and .cse3 .cse34 .cse37) (and .cse35 .cse34 .cse37) (and .cse38 .cse34 .cse37) (and .cse32 .cse34 .cse37))) (.cse14 (let ((.cse36 (<= |ULTIMATE.start_main_~k~0#1| 8))) (or (and .cse35 .cse9 .cse36) (and .cse35 .cse5 .cse36) (and .cse32 .cse19 .cse36) (and .cse35 .cse36 .cse34) (and .cse35 .cse19 .cse36) (and .cse35 .cse26 .cse36) (and .cse32 .cse27 .cse36) (and .cse3 .cse36 .cse34) (and .cse32 .cse36 .cse34) (and .cse9 .cse32 .cse36)))) (.cse8 (<= |ULTIMATE.start_main_~k~0#1| 2147483646)) (.cse24 (let ((.cse33 (<= |ULTIMATE.start_main_~k~0#1| 7))) (or (and .cse32 .cse33 .cse5) (and .cse32 .cse19 .cse33) (and .cse30 .cse32 .cse33) (and .cse3 .cse33 .cse34) (and .cse9 .cse32 .cse33) (and .cse32 .cse33 .cse34))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse7 .cse8) (and .cse0 .cse9 .cse1 .cse3 .cse4 .cse10) (and .cse0 .cse3 .cse11) (and .cse0 .cse1 .cse4 .cse12 .cse13) (and .cse0 .cse1 .cse11 .cse4 .cse13) (and .cse0 .cse14 .cse7 .cse8) (and .cse0 .cse1 .cse4 .cse7 .cse15) (and .cse0 .cse3 .cse12) (and .cse0 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse16) (and .cse0 .cse17 .cse7 .cse8) (and .cse0 .cse17 .cse13) (and .cse0 .cse14 .cse4 .cse7 .cse8) (and .cse18 .cse0 .cse13) (and .cse18 .cse0 .cse1 .cse4 .cse7) (and .cse0 .cse3 .cse19 .cse20) (and .cse18 .cse0 .cse7) (and .cse0 .cse1 .cse14 .cse4 .cse13) (and .cse0 .cse1 .cse21 .cse4 .cse7) (and .cse0 .cse11 .cse7) (and .cse0 .cse7 .cse15) (and .cse0 .cse4 .cse17 .cse22 .cse13) (and .cse0 .cse3 .cse17) (and .cse0 .cse3 .cse23) (and .cse6 .cse0 .cse7) (and .cse0 .cse17) (and .cse0 .cse7 .cse24 .cse8) (and .cse0 .cse14 .cse4 .cse22 .cse13) (and .cse0 .cse1 .cse3 .cse4 .cse12) (and .cse25 .cse0 .cse1 .cse4 .cse7) (and .cse0 .cse1 .cse4 .cse23 .cse13) (and .cse0 .cse7 .cse26 .cse8) (and .cse0 .cse17 .cse7) (and .cse0 .cse12 .cse13) (and .cse18 .cse0 .cse1 .cse4 .cse13) (and .cse0 .cse21 .cse13) (and .cse0 .cse3 .cse27 .cse28) (and .cse0 .cse1 .cse3 .cse4 .cse17) (and .cse0 .cse4 .cse17 .cse7 .cse8) (and .cse0 .cse7 .cse12) (and .cse18 .cse0 .cse3) (and .cse0 .cse1 .cse3 .cse16) (and .cse0 .cse9 .cse3 .cse10) (and .cse0 .cse4 .cse7 .cse26 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse24) (and .cse0 .cse23 .cse13) (and .cse0 .cse1 .cse4 .cse17 .cse7) (and .cse0 .cse12) (and .cse6 .cse0 .cse1 .cse3 .cse4) (and .cse25 .cse0 .cse4 .cse22 .cse13) (and .cse0 .cse3 .cse15) (and .cse25 .cse0 .cse7) (and .cse0 .cse14 .cse3) (and .cse0 .cse15 .cse13) (and .cse6 .cse0 .cse3) (and .cse25 .cse0 .cse1 .cse4 .cse13) (and .cse25 .cse0 .cse7 .cse8) (and .cse25 .cse0 .cse3) (and .cse0 .cse29 .cse3 .cse22) (and .cse25 .cse0 .cse13) (and .cse0 .cse11 .cse13) (and .cse0 .cse15) (and .cse6 .cse0 .cse1 .cse4 .cse13) (and .cse25 .cse0 .cse1 .cse3 .cse4) (and .cse0 .cse24 .cse22 .cse13) (and .cse0 .cse21 .cse7) (and .cse0 .cse1 .cse4 .cse7 .cse23) (and .cse0 .cse1 .cse29 .cse3 .cse4 .cse22) (and .cse6 .cse0 .cse1 .cse4 .cse7) (and .cse0 .cse1 .cse4 .cse7 .cse12) (and .cse0 .cse1 .cse4 .cse17 .cse13) (and .cse0 .cse14) (and .cse0 .cse2 .cse3 .cse5) (and .cse0 .cse1 .cse3 .cse4 .cse15) (and .cse25 .cse0) (and .cse18 .cse0 .cse1 .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4 .cse19 .cse20) (and .cse0 .cse24) (and .cse0 .cse4 .cse24 .cse22 .cse13) (and .cse0 .cse1 .cse14 .cse3 .cse4) (and .cse0 .cse4 .cse22 .cse26 .cse13) (and .cse0 .cse21) (and .cse6 .cse0 .cse4 .cse7 .cse8) (and .cse0 .cse14 .cse7) (and .cse18 .cse0) (and .cse6 .cse0 .cse13) (and .cse25 .cse0 .cse4 .cse7 .cse8) (and .cse0 .cse23) (and .cse0 .cse1 .cse21 .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse11 .cse4) (and .cse0 .cse1 .cse30 .cse3 .cse4 .cse31) (and .cse0 .cse30 .cse3 .cse31 .cse8) (and .cse0 .cse1 .cse21 .cse4 .cse13) (and .cse6 .cse0) (and .cse6 .cse0 .cse4 .cse22 .cse13) (and .cse0 .cse1 .cse11 .cse4 .cse7) (and .cse0 .cse1 .cse4 .cse15 .cse13) (and .cse0 .cse1 .cse3 .cse4 .cse27 .cse28) (and .cse0 .cse7 .cse23) (and .cse0 .cse1 .cse3 .cse4 .cse23) (and .cse0 .cse21 .cse3) (and .cse0 .cse14 .cse13 .cse8) (and .cse0 .cse3 .cse24))))))))))) [2023-02-18 23:20:47,233 INFO L899 garLoopResultBuilder]: For program point L28-5(lines 28 30) no Hoare annotation was computed. [2023-02-18 23:20:47,233 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2023-02-18 23:20:47,233 INFO L899 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2023-02-18 23:20:47,233 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-18 23:20:47,233 INFO L899 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2023-02-18 23:20:47,233 INFO L899 garLoopResultBuilder]: For program point L29-1(line 29) no Hoare annotation was computed. [2023-02-18 23:20:47,233 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2023-02-18 23:20:47,234 INFO L895 garLoopResultBuilder]: At program point L25-2(lines 25 32) the Hoare annotation is: (let ((.cse18 (<= (+ 1 |ULTIMATE.start_main_~j~0#1|) 2147483647)) (.cse17 (< (+ |ULTIMATE.start_main_~j~0#1| 1) 2147483647)) (.cse12 (<= |ULTIMATE.start_main_~m~0#1| 2147483647)) (.cse80 (<= (+ |ULTIMATE.start_main_~k~0#1| 2) 2147483647)) (.cse10 (<= |ULTIMATE.start_main_~j~0#1| 1)) (.cse0 (<= |ULTIMATE.start_main_~n~0#1| 2147483647)) (.cse81 (<= (+ |ULTIMATE.start_main_~k~0#1| (- 1)) 2147483645)) (.cse32 (<= |ULTIMATE.start_main_~i~0#1| 2147483646)) (.cse7 (<= |ULTIMATE.start_main_~k~0#1| 0)) (.cse15 (<= 0 |ULTIMATE.start_main_~k~0#1|)) (.cse28 (<= |ULTIMATE.start_main_~j~0#1| 0)) (.cse11 (<= |ULTIMATE.start_main_~N~0#1| 2147483647)) (.cse13 (<= 0 |ULTIMATE.start_main_~i~0#1|)) (.cse14 (<= 0 |ULTIMATE.start_main_~j~0#1|)) (.cse16 (<= 0 |ULTIMATE.start_main_~N~0#1|))) (let ((.cse33 (let ((.cse82 (and .cse28 .cse11 .cse13 .cse14 .cse16)) (.cse83 (and .cse28 .cse11 .cse13 .cse14 .cse15 .cse16))) (or .cse82 .cse83 (and (or .cse82 .cse83) .cse7)))) (.cse73 (and .cse12 (or (and .cse10 .cse11 .cse0 .cse13 .cse14 .cse15 .cse80 .cse32 .cse16) (and .cse10 .cse11 .cse0 .cse13 .cse14 .cse15 .cse81 .cse32 .cse16)))) (.cse74 (and .cse12 (or (and .cse11 .cse0 .cse13 .cse14 .cse15 .cse80 .cse32 .cse16) (and .cse11 .cse0 .cse13 .cse14 .cse15 .cse81 .cse32 .cse16)))) (.cse75 (and .cse12 (or (and .cse11 .cse0 .cse13 .cse14 .cse17 .cse15 .cse80 .cse32 .cse16) (and .cse11 .cse0 .cse13 .cse14 .cse17 .cse15 .cse81 .cse32 .cse16)))) (.cse78 (and .cse12 (or (and .cse11 .cse0 .cse13 .cse18 .cse14 .cse15 .cse81 .cse32 .cse16) (and .cse11 .cse0 .cse13 .cse18 .cse14 .cse15 .cse80 .cse32 .cse16)))) (.cse48 (+ |ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse34 (< .cse48 2147483647)) (.cse42 (< |ULTIMATE.start_main_~k~0#1| 2147483646)) (.cse79 (+ |ULTIMATE.start_main_~k~0#1| 1)) (.cse1 (or (and .cse11 .cse0 .cse12 .cse13 .cse14 .cse17 .cse15 .cse16) (and .cse10 .cse11 .cse0 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse11 .cse0 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse11 .cse0 .cse12 .cse13 .cse18 .cse14 .cse15 .cse16))) (.cse30 (<= (+ 1 |ULTIMATE.start_main_~i~0#1|) 2147483647)) (.cse71 (or .cse73 .cse74 .cse75 .cse78)) (.cse59 (or (and .cse28 .cse11 .cse0 .cse80 .cse33 .cse32) (and .cse28 .cse11 .cse0 .cse33 .cse32) (and .cse28 .cse11 .cse0 .cse81 .cse33 .cse32))) (.cse35 (<= |ULTIMATE.start_main_~j~0#1| 2147483646)) (.cse50 (< |ULTIMATE.start_main_~k~0#1| 2147483647))) (let ((.cse51 (and .cse12 .cse59 .cse35 .cse50)) (.cse52 (and .cse12 .cse59 .cse35)) (.cse76 (and .cse30 .cse71 .cse50)) (.cse77 (and .cse1 .cse30 .cse50)) (.cse60 (< |ULTIMATE.start_main_~i~0#1| 2147483644)) (.cse46 (< .cse79 2147483645)) (.cse43 (and .cse1 .cse34 .cse42)) (.cse45 (< .cse79 2147483646)) (.cse68 (<= |ULTIMATE.start_main_~i~0#1| 3)) (.cse61 (<= |ULTIMATE.start_main_~k~0#1| 3))) (let ((.cse55 (<= |ULTIMATE.start_main_~k~0#1| 8)) (.cse54 (<= |ULTIMATE.start_main_~i~0#1| 8)) (.cse66 (<= |ULTIMATE.start_main_~k~0#1| 6)) (.cse67 (<= |ULTIMATE.start_main_~k~0#1| 4)) (.cse62 (<= |ULTIMATE.start_main_~k~0#1| 7)) (.cse63 (<= |ULTIMATE.start_main_~k~0#1| 5)) (.cse53 (or (and .cse68 .cse1 .cse61) (and .cse68 .cse71 .cse61))) (.cse36 (<= |ULTIMATE.start_main_~i~0#1| 7)) (.cse65 (<= |ULTIMATE.start_main_~k~0#1| 2)) (.cse37 (<= |ULTIMATE.start_main_~i~0#1| 2)) (.cse22 (<= |ULTIMATE.start_main_~k~0#1| 1)) (.cse21 (<= |ULTIMATE.start_main_~i~0#1| 1)) (.cse47 (< .cse79 2147483644)) (.cse40 (< .cse79 2147483643)) (.cse39 (< .cse79 2147483641)) (.cse44 (< .cse79 2147483642)) (.cse38 (or .cse43 (and .cse34 .cse42 .cse71) (and .cse34 .cse71 .cse45))) (.cse56 (or (and .cse60 .cse71 .cse46) (and .cse1 .cse60 .cse46))) (.cse57 (< |ULTIMATE.start_main_~i~0#1| 2147483639)) (.cse41 (or .cse73 .cse74 .cse75 .cse76 .cse77 .cse78)) (.cse49 (or .cse51 .cse52)) (.cse72 (< .cse79 2147483640)) (.cse58 (or (and .cse12 .cse59 .cse35 .cse30 .cse45) (and .cse12 .cse59 .cse35 .cse30 .cse42)))) (let ((.cse23 (or (and .cse72 .cse12 .cse59 .cse34 .cse35 .cse46) (and .cse72 .cse49 .cse34) (and .cse72 .cse34 .cse58))) (.cse6 (or .cse73 .cse74 .cse75 .cse76 .cse77 (and .cse41 .cse30 .cse50) .cse78)) (.cse29 (<= |ULTIMATE.start_main_~m~0#1| 0)) (.cse31 (>= |ULTIMATE.start_main_~j~0#1| 0)) (.cse25 (or (and .cse72 .cse38 .cse57) (and .cse72 .cse56 .cse57) (and .cse72 .cse1 .cse57) (and .cse72 .cse41 .cse57))) (.cse4 (or (and .cse49 .cse47 .cse30) (and .cse40 .cse49 .cse30) (and .cse49 .cse39 .cse30) (and .cse49 .cse30 .cse45) (and .cse30 .cse58 .cse44) (and .cse49 .cse42 .cse30) (and .cse49 .cse30 .cse46) (and .cse39 .cse30 .cse58) (and .cse49 .cse30 .cse44) (and .cse42 .cse30 .cse58))) (.cse27 (let ((.cse69 (let ((.cse70 (or (and .cse11 .cse0 .cse12 .cse13 .cse14 .cse17 .cse15 .cse22 .cse21 .cse16) (and .cse10 .cse11 .cse0 .cse12 .cse13 .cse14 .cse15 .cse22 .cse21 .cse16) (and .cse11 .cse0 .cse12 .cse13 .cse18 .cse14 .cse15 .cse22 .cse21 .cse16) (and .cse11 .cse0 .cse12 .cse13 .cse14 .cse15 .cse22 .cse21 .cse16)))) (or (and .cse22 .cse37 .cse70) (and .cse71 .cse65 .cse37) (and .cse65 .cse37 .cse70))))) (or (and .cse38 .cse36 .cse62) (and .cse36 .cse69 .cse65) (and .cse41 .cse36 .cse62) (and .cse53 .cse36 .cse62) (and .cse36 .cse69 .cse62) (and .cse66 .cse38 .cse36) (and .cse36 .cse56 .cse67) (and .cse36 .cse56 .cse62) (and .cse38 .cse36 .cse63) (and .cse36 .cse69 .cse22) (and .cse53 .cse36 .cse61)))) (.cse24 (let ((.cse64 (or (and .cse28 .cse68 .cse11 .cse0 .cse12 .cse35 .cse22 .cse33 .cse32) (and .cse28 .cse68 .cse11 .cse0 .cse12 .cse35 .cse22 .cse65 .cse33 .cse32) (and .cse68 .cse12 .cse59 .cse35 .cse65)))) (or (and .cse12 .cse54 .cse59 .cse34 .cse35 .cse62 .cse46) (and .cse54 .cse63 .cse58) (and .cse54 .cse64 .cse65) (and .cse54 .cse49 .cse62) (and .cse12 .cse54 .cse59 .cse35 .cse60 .cse61) (and .cse54 .cse66 .cse58) (and .cse12 .cse54 .cse59 .cse34 .cse35 .cse67 .cse46) (and .cse54 .cse64 .cse62) (and .cse54 .cse58 .cse62) (and .cse12 .cse54 .cse59 .cse35 .cse60 .cse61 .cse62) (and .cse54 .cse64 .cse22)))) (.cse26 (or (and .cse49 .cse57 .cse55) (and .cse58 .cse57 .cse55) (and .cse12 .cse59 .cse34 .cse35 .cse57 .cse55 .cse46) (and .cse12 .cse59 .cse35 .cse60 .cse61 .cse57 .cse55))) (.cse8 (<= |ULTIMATE.start_main_~i~0#1| 0)) (.cse19 (or (and .cse53 .cse54 .cse55) (and .cse54 .cse56 .cse55) (and .cse54 .cse38 .cse55) (and .cse54 .cse1 .cse55) (and .cse54 .cse41 .cse55))) (.cse20 (or (and .cse49 .cse50) .cse51 .cse52)) (.cse5 (<= |ULTIMATE.start_main_~N~0#1| 1)) (.cse2 (<= .cse48 2147483647)) (.cse9 (or (and .cse38 .cse39 .cse34) (and .cse40 .cse41 .cse34) (and .cse38 .cse34 .cse42) .cse43 (and .cse38 .cse34 .cse44) (and .cse41 .cse34 .cse44) (and .cse41 .cse34 .cse45) (and .cse41 .cse34 .cse42) (and .cse41 .cse34 .cse46) (and .cse41 .cse39 .cse34) (and .cse47 .cse41 .cse34))) (.cse3 (<= |ULTIMATE.start_main_~k~0#1| 2147483646))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse2) (and .cse0 .cse5 .cse6 .cse2 .cse3) (and .cse0 .cse7 .cse8 .cse5 .cse9) (and .cse0 .cse7 .cse8 .cse5 (or (and .cse10 .cse11 .cse0 .cse12 .cse7 .cse8 .cse13 .cse14 .cse15 .cse16) (and .cse11 .cse0 .cse12 .cse7 .cse8 .cse13 .cse14 .cse17 .cse15 .cse16) (and .cse11 .cse0 .cse12 .cse7 .cse8 .cse13 .cse14 .cse15 .cse16) (and .cse11 .cse0 .cse12 .cse7 .cse8 .cse13 .cse18 .cse14 .cse15 .cse16))) (and .cse0 .cse2 .cse19 .cse3) (and .cse0 .cse20 .cse7 .cse5 .cse21) (and .cse0 .cse5 .cse6 .cse22 .cse21) (and .cse0 .cse1 .cse5 .cse2 .cse3) (and .cse4 .cse0 .cse7 .cse5 .cse21) (and .cse0 .cse23 .cse5 .cse2 .cse3) (and .cse0 .cse23 .cse2 .cse3) (and .cse0 .cse5 .cse2 .cse19 .cse3) (and .cse4 .cse0 .cse2 .cse3) (and .cse0 .cse2 .cse22 .cse24) (and .cse0 .cse5 .cse22 .cse21 .cse9) (and .cse0 .cse7 .cse23 .cse5 .cse21) (and .cse0 .cse23 .cse2) (and .cse0 .cse19) (and .cse0 .cse5 .cse22 .cse21 .cse25) (and .cse0 .cse2 .cse3 .cse25) (and .cse0 .cse5 .cse2 .cse3 .cse25) (and .cse0 .cse5 .cse22 .cse21 .cse19) (and .cse0 .cse2 .cse24) (and .cse0 .cse26 .cse2) (and .cse0 .cse9) (and .cse0 .cse22 .cse21 .cse27) (and .cse0 .cse6 .cse2 .cse3) (and .cse28 .cse11 .cse29 .cse0 .cse13 .cse14 .cse30 .cse31 .cse32 .cse16) (and .cse0 .cse25) (and .cse0 .cse2 .cse3 .cse27) (and .cse0 .cse5 .cse2 .cse22 .cse24) (and .cse28 .cse11 .cse29 .cse0 .cse13 .cse14 .cse31 .cse21 .cse32 .cse16) (and .cse28 .cse11 .cse29 .cse0 .cse31 .cse33 .cse32) (and .cse0 .cse23 .cse5 .cse2 .cse22) (and .cse0 .cse7 .cse8 .cse5 .cse27) (and .cse0 .cse7 .cse5 .cse21 .cse24) (and .cse0 .cse20 .cse2 .cse3) (and .cse0 .cse6) (and .cse0 .cse20 .cse2) (and .cse0 .cse27) (and .cse0 .cse26 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse2 .cse3) (and .cse0 .cse7 .cse8 .cse5 .cse6) (and .cse28 .cse11 .cse29 .cse0 .cse13 .cse34 .cse14 .cse31 .cse32 .cse16) (and .cse0 .cse20 .cse5 .cse2 .cse3) (and .cse0 .cse7 .cse8 .cse5 .cse25) (and .cse0 .cse1 .cse5 .cse22 .cse21) (and .cse0 .cse26 .cse5 .cse2 .cse22) (and .cse4 .cse0 .cse5 .cse2 .cse22) (and .cse0 .cse5 .cse2 .cse9 .cse3) (and .cse0 .cse5 .cse22 .cse21 .cse27) (and .cse28 .cse11 .cse0 .cse12 .cse8 .cse13 .cse14 .cse35 .cse32 .cse16) (and .cse0 .cse26 .cse5 .cse2 .cse3) (and .cse0 .cse2 .cse3 .cse24) (and .cse0 .cse7 .cse26 .cse5 .cse21) (and .cse0 .cse7 .cse8 .cse5 .cse19) (and .cse0 .cse20 .cse5 .cse2 .cse22) (and .cse28 .cse11 .cse0 .cse12 .cse7 .cse36 .cse5 .cse35 .cse37 .cse21 .cse33 .cse32) (and .cse0 .cse2 .cse9 .cse3)))))))) [2023-02-18 23:20:47,234 INFO L899 garLoopResultBuilder]: For program point L25-3(lines 25 32) no Hoare annotation was computed. [2023-02-18 23:20:47,234 INFO L899 garLoopResultBuilder]: For program point L21(lines 21 35) no Hoare annotation was computed. [2023-02-18 23:20:47,234 INFO L899 garLoopResultBuilder]: For program point L21-1(lines 21 35) no Hoare annotation was computed. [2023-02-18 23:20:47,234 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-18 23:20:47,234 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2023-02-18 23:20:47,234 INFO L899 garLoopResultBuilder]: For program point L26(line 26) no Hoare annotation was computed. [2023-02-18 23:20:47,234 INFO L899 garLoopResultBuilder]: For program point L26-1(line 26) no Hoare annotation was computed. [2023-02-18 23:20:47,234 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2023-02-18 23:20:47,237 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 23:20:47,238 INFO L178 ceAbstractionStarter]: Computing trace abstraction results