./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 26d01a9c 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-?-26d01a9 [2023-02-17 03:54:39,232 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 03:54:39,234 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 03:54:39,262 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 03:54:39,262 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 03:54:39,265 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 03:54:39,266 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 03:54:39,267 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 03:54:39,269 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 03:54:39,272 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 03:54:39,273 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 03:54:39,274 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 03:54:39,274 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 03:54:39,276 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 03:54:39,277 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 03:54:39,278 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 03:54:39,278 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 03:54:39,279 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 03:54:39,280 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 03:54:39,284 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 03:54:39,285 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 03:54:39,285 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 03:54:39,286 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 03:54:39,287 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 03:54:39,292 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 03:54:39,293 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 03:54:39,293 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 03:54:39,294 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 03:54:39,294 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 03:54:39,295 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 03:54:39,295 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 03:54:39,295 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 03:54:39,296 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 03:54:39,297 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 03:54:39,297 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 03:54:39,298 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 03:54:39,298 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 03:54:39,298 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 03:54:39,298 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 03:54:39,299 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 03:54:39,300 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 03:54:39,301 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2023-02-17 03:54:39,329 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 03:54:39,330 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 03:54:39,330 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 03:54:39,339 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 03:54:39,339 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 03:54:39,340 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 03:54:39,340 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 03:54:39,340 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 03:54:39,340 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 03:54:39,340 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 03:54:39,341 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 03:54:39,341 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 03:54:39,341 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 03:54:39,341 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 03:54:39,342 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 03:54:39,342 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 03:54:39,342 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-17 03:54:39,342 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 03:54:39,342 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 03:54:39,342 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 03:54:39,342 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 03:54:39,343 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 03:54:39,343 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 03:54:39,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 03:54:39,343 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 03:54:39,343 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 03:54:39,343 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 03:54:39,343 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 03:54:39,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 03:54:39,344 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 03:54:39,344 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 03:54:39,344 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 03:54:39,344 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 03:54:39,344 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 03:54:39,344 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-17 03:54:39,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 03:54:39,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 03:54:39,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 03:54:39,539 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 03:54:39,540 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 03:54:39,540 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-17 03:54:40,429 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 03:54:40,561 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 03:54:40,561 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2023-02-17 03:54:40,565 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cccf48109/50c4b49d12d74f868bc7c8a5a427c917/FLAGc79919566 [2023-02-17 03:54:40,581 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cccf48109/50c4b49d12d74f868bc7c8a5a427c917 [2023-02-17 03:54:40,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 03:54:40,583 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 03:54:40,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 03:54:40,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 03:54:40,586 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 03:54:40,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 03:54:40" (1/1) ... [2023-02-17 03:54:40,587 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13dc9219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:54:40, skipping insertion in model container [2023-02-17 03:54:40,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 03:54:40" (1/1) ... [2023-02-17 03:54:40,592 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 03:54:40,602 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 03:54:40,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 03:54:40,721 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 03:54:40,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 03:54:40,748 INFO L208 MainTranslator]: Completed translation [2023-02-17 03:54:40,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:54:40 WrapperNode [2023-02-17 03:54:40,749 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 03:54:40,750 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 03:54:40,750 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 03:54:40,750 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 03:54:40,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:54:40" (1/1) ... [2023-02-17 03:54:40,757 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:54:40" (1/1) ... [2023-02-17 03:54:40,771 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2023-02-17 03:54:40,772 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 03:54:40,772 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 03:54:40,772 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 03:54:40,773 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 03:54:40,779 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:54:40" (1/1) ... [2023-02-17 03:54:40,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:54:40" (1/1) ... [2023-02-17 03:54:40,785 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:54:40" (1/1) ... [2023-02-17 03:54:40,785 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:54:40" (1/1) ... [2023-02-17 03:54:40,789 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:54:40" (1/1) ... [2023-02-17 03:54:40,794 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:54:40" (1/1) ... [2023-02-17 03:54:40,797 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:54:40" (1/1) ... [2023-02-17 03:54:40,797 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:54:40" (1/1) ... [2023-02-17 03:54:40,798 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 03:54:40,799 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 03:54:40,800 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 03:54:40,800 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 03:54:40,801 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:54:40" (1/1) ... [2023-02-17 03:54:40,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 03:54:40,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:54:40,830 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-17 03:54:40,837 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-17 03:54:40,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 03:54:40,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 03:54:40,902 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 03:54:40,904 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 03:54:40,971 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 03:54:40,975 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 03:54:40,975 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-17 03:54:40,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 03:54:40 BoogieIcfgContainer [2023-02-17 03:54:40,976 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 03:54:40,978 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 03:54:40,978 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 03:54:40,980 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 03:54:40,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 03:54:40" (1/3) ... [2023-02-17 03:54:40,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59974dfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 03:54:40, skipping insertion in model container [2023-02-17 03:54:40,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:54:40" (2/3) ... [2023-02-17 03:54:40,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59974dfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 03:54:40, skipping insertion in model container [2023-02-17 03:54:40,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 03:54:40" (3/3) ... [2023-02-17 03:54:40,982 INFO L112 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2023-02-17 03:54:40,992 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 03:54:40,992 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-02-17 03:54:41,021 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 03:54:41,025 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;@69215c70, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 03:54:41,026 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-02-17 03:54:41,028 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-17 03:54:41,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-17 03:54:41,032 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:54:41,032 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-17 03:54:41,033 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-17 03:54:41,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:54:41,037 INFO L85 PathProgramCache]: Analyzing trace with hash 889514734, now seen corresponding path program 1 times [2023-02-17 03:54:41,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:54:41,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806035041] [2023-02-17 03:54:41,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:54:41,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:54:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:54:41,153 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-17 03:54:41,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:54:41,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806035041] [2023-02-17 03:54:41,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806035041] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:54:41,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:54:41,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 03:54:41,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578207019] [2023-02-17 03:54:41,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:54:41,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 03:54:41,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:54:41,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 03:54:41,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 03:54:41,183 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-17 03:54:41,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:54:41,193 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2023-02-17 03:54:41,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 03:54:41,194 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-17 03:54:41,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:54:41,199 INFO L225 Difference]: With dead ends: 51 [2023-02-17 03:54:41,199 INFO L226 Difference]: Without dead ends: 23 [2023-02-17 03:54:41,201 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-17 03:54:41,203 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-17 03:54:41,204 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-17 03:54:41,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-02-17 03:54:41,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-02-17 03:54:41,242 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-17 03:54:41,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2023-02-17 03:54:41,244 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 6 [2023-02-17 03:54:41,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:54:41,244 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2023-02-17 03:54:41,245 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-17 03:54:41,245 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2023-02-17 03:54:41,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-17 03:54:41,245 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:54:41,245 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-17 03:54:41,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 03:54:41,246 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-17 03:54:41,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:54:41,248 INFO L85 PathProgramCache]: Analyzing trace with hash 889513835, now seen corresponding path program 1 times [2023-02-17 03:54:41,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:54:41,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902066227] [2023-02-17 03:54:41,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:54:41,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:54:41,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:54:41,315 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-17 03:54:41,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:54:41,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902066227] [2023-02-17 03:54:41,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902066227] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:54:41,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:54:41,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 03:54:41,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018484414] [2023-02-17 03:54:41,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:54:41,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 03:54:41,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:54:41,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 03:54:41,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 03:54:41,321 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-17 03:54:41,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:54:41,360 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2023-02-17 03:54:41,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 03:54:41,361 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-17 03:54:41,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:54:41,361 INFO L225 Difference]: With dead ends: 42 [2023-02-17 03:54:41,361 INFO L226 Difference]: Without dead ends: 41 [2023-02-17 03:54:41,362 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-17 03:54:41,363 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-17 03:54:41,363 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-17 03:54:41,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-02-17 03:54:41,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 27. [2023-02-17 03:54:41,366 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-17 03:54:41,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2023-02-17 03:54:41,367 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 6 [2023-02-17 03:54:41,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:54:41,367 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-02-17 03:54:41,367 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-17 03:54:41,368 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2023-02-17 03:54:41,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-17 03:54:41,368 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:54:41,368 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-17 03:54:41,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 03:54:41,369 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-17 03:54:41,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:54:41,369 INFO L85 PathProgramCache]: Analyzing trace with hash 889513869, now seen corresponding path program 1 times [2023-02-17 03:54:41,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:54:41,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897518391] [2023-02-17 03:54:41,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:54:41,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:54:41,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:54:41,402 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-17 03:54:41,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:54:41,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897518391] [2023-02-17 03:54:41,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897518391] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:54:41,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:54:41,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 03:54:41,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112572769] [2023-02-17 03:54:41,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:54:41,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 03:54:41,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:54:41,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 03:54:41,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 03:54:41,405 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-17 03:54:41,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:54:41,427 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2023-02-17 03:54:41,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 03:54:41,427 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-17 03:54:41,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:54:41,428 INFO L225 Difference]: With dead ends: 28 [2023-02-17 03:54:41,428 INFO L226 Difference]: Without dead ends: 27 [2023-02-17 03:54:41,428 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-17 03:54:41,429 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-17 03:54:41,429 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-17 03:54:41,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-17 03:54:41,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2023-02-17 03:54:41,432 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-17 03:54:41,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2023-02-17 03:54:41,432 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 6 [2023-02-17 03:54:41,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:54:41,432 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2023-02-17 03:54:41,433 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-17 03:54:41,433 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2023-02-17 03:54:41,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-17 03:54:41,433 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:54:41,433 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:54:41,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-17 03:54:41,433 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-17 03:54:41,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:54:41,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1805125194, now seen corresponding path program 1 times [2023-02-17 03:54:41,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:54:41,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733425573] [2023-02-17 03:54:41,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:54:41,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:54:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:54:41,465 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-17 03:54:41,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:54:41,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733425573] [2023-02-17 03:54:41,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733425573] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:54:41,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:54:41,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 03:54:41,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134562727] [2023-02-17 03:54:41,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:54:41,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 03:54:41,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:54:41,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 03:54:41,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 03:54:41,469 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-17 03:54:41,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:54:41,503 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2023-02-17 03:54:41,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 03:54:41,504 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-17 03:54:41,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:54:41,504 INFO L225 Difference]: With dead ends: 44 [2023-02-17 03:54:41,504 INFO L226 Difference]: Without dead ends: 43 [2023-02-17 03:54:41,505 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-17 03:54:41,506 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-17 03:54:41,506 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-17 03:54:41,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-02-17 03:54:41,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2023-02-17 03:54:41,510 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-17 03:54:41,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2023-02-17 03:54:41,511 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 7 [2023-02-17 03:54:41,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:54:41,511 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2023-02-17 03:54:41,511 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-17 03:54:41,511 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2023-02-17 03:54:41,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-17 03:54:41,512 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:54:41,512 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:54:41,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-17 03:54:41,512 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-17 03:54:41,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:54:41,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1805126220, now seen corresponding path program 1 times [2023-02-17 03:54:41,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:54:41,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708652504] [2023-02-17 03:54:41,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:54:41,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:54:41,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:54:41,549 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-17 03:54:41,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:54:41,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708652504] [2023-02-17 03:54:41,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708652504] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:54:41,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:54:41,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 03:54:41,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081384965] [2023-02-17 03:54:41,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:54:41,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 03:54:41,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:54:41,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 03:54:41,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 03:54:41,551 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-17 03:54:41,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:54:41,575 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2023-02-17 03:54:41,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 03:54:41,577 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-17 03:54:41,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:54:41,577 INFO L225 Difference]: With dead ends: 39 [2023-02-17 03:54:41,577 INFO L226 Difference]: Without dead ends: 38 [2023-02-17 03:54:41,578 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-17 03:54:41,578 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-17 03:54:41,579 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-17 03:54:41,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-17 03:54:41,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2023-02-17 03:54:41,582 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-17 03:54:41,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2023-02-17 03:54:41,582 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 7 [2023-02-17 03:54:41,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:54:41,582 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2023-02-17 03:54:41,583 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-17 03:54:41,583 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2023-02-17 03:54:41,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-17 03:54:41,583 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:54:41,583 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:54:41,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-17 03:54:41,583 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-17 03:54:41,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:54:41,584 INFO L85 PathProgramCache]: Analyzing trace with hash 124338035, now seen corresponding path program 1 times [2023-02-17 03:54:41,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:54:41,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866992608] [2023-02-17 03:54:41,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:54:41,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:54:41,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:54:41,610 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-17 03:54:41,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:54:41,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866992608] [2023-02-17 03:54:41,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866992608] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:54:41,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:54:41,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 03:54:41,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475417330] [2023-02-17 03:54:41,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:54:41,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 03:54:41,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:54:41,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 03:54:41,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 03:54:41,615 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-17 03:54:41,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:54:41,627 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2023-02-17 03:54:41,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 03:54:41,627 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-17 03:54:41,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:54:41,629 INFO L225 Difference]: With dead ends: 33 [2023-02-17 03:54:41,629 INFO L226 Difference]: Without dead ends: 32 [2023-02-17 03:54:41,629 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-17 03:54:41,630 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-17 03:54:41,630 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-17 03:54:41,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-17 03:54:41,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-02-17 03:54:41,633 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-17 03:54:41,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2023-02-17 03:54:41,634 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 8 [2023-02-17 03:54:41,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:54:41,634 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2023-02-17 03:54:41,634 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-17 03:54:41,634 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2023-02-17 03:54:41,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-17 03:54:41,635 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:54:41,635 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:54:41,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-17 03:54:41,635 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-17 03:54:41,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:54:41,636 INFO L85 PathProgramCache]: Analyzing trace with hash -440488146, now seen corresponding path program 1 times [2023-02-17 03:54:41,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:54:41,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961527652] [2023-02-17 03:54:41,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:54:41,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:54:41,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:54:41,662 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-17 03:54:41,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:54:41,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961527652] [2023-02-17 03:54:41,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961527652] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:54:41,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:54:41,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 03:54:41,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312681650] [2023-02-17 03:54:41,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:54:41,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 03:54:41,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:54:41,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 03:54:41,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 03:54:41,664 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-17 03:54:41,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:54:41,671 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2023-02-17 03:54:41,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 03:54:41,671 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-17 03:54:41,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:54:41,672 INFO L225 Difference]: With dead ends: 32 [2023-02-17 03:54:41,674 INFO L226 Difference]: Without dead ends: 31 [2023-02-17 03:54:41,674 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-17 03:54:41,675 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-17 03:54:41,677 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-17 03:54:41,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-17 03:54:41,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-02-17 03:54:41,688 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-17 03:54:41,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2023-02-17 03:54:41,690 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 9 [2023-02-17 03:54:41,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:54:41,691 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-02-17 03:54:41,691 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-17 03:54:41,691 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2023-02-17 03:54:41,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-17 03:54:41,691 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:54:41,692 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2023-02-17 03:54:41,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-17 03:54:41,692 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-17 03:54:41,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:54:41,693 INFO L85 PathProgramCache]: Analyzing trace with hash 944544627, now seen corresponding path program 1 times [2023-02-17 03:54:41,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:54:41,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215777571] [2023-02-17 03:54:41,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:54:41,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:54:41,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:54:41,740 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-17 03:54:41,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:54:41,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215777571] [2023-02-17 03:54:41,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215777571] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:54:41,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913380820] [2023-02-17 03:54:41,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:54:41,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:54:41,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:54:41,743 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-17 03:54:41,744 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-17 03:54:41,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:54:41,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 03:54:41,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:54:41,801 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-17 03:54:41,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:54:41,812 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-17 03:54:41,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913380820] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:54:41,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 03:54:41,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-02-17 03:54:41,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167926618] [2023-02-17 03:54:41,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 03:54:41,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 03:54:41,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:54:41,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 03:54:41,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-02-17 03:54:41,814 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-17 03:54:41,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:54:41,875 INFO L93 Difference]: Finished difference Result 84 states and 99 transitions. [2023-02-17 03:54:41,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 03:54:41,876 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-17 03:54:41,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:54:41,877 INFO L225 Difference]: With dead ends: 84 [2023-02-17 03:54:41,877 INFO L226 Difference]: Without dead ends: 83 [2023-02-17 03:54:41,878 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-17 03:54:41,878 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-17 03:54:41,879 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-17 03:54:41,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-17 03:54:41,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 43. [2023-02-17 03:54:41,887 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-17 03:54:41,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2023-02-17 03:54:41,892 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 11 [2023-02-17 03:54:41,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:54:41,892 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2023-02-17 03:54:41,892 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-17 03:54:41,893 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2023-02-17 03:54:41,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-17 03:54:41,893 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:54:41,893 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:54:41,903 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-17 03:54:42,105 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-17 03:54:42,106 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-17 03:54:42,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:54:42,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1892656240, now seen corresponding path program 1 times [2023-02-17 03:54:42,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:54:42,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302157688] [2023-02-17 03:54:42,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:54:42,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:54:42,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:54:42,145 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-17 03:54:42,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:54:42,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302157688] [2023-02-17 03:54:42,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302157688] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:54:42,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:54:42,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 03:54:42,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253719616] [2023-02-17 03:54:42,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:54:42,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 03:54:42,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:54:42,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 03:54:42,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 03:54:42,153 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-17 03:54:42,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:54:42,175 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2023-02-17 03:54:42,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 03:54:42,175 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-17 03:54:42,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:54:42,178 INFO L225 Difference]: With dead ends: 46 [2023-02-17 03:54:42,178 INFO L226 Difference]: Without dead ends: 44 [2023-02-17 03:54:42,179 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-17 03:54:42,181 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-17 03:54:42,181 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-17 03:54:42,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-17 03:54:42,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2023-02-17 03:54:42,186 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-17 03:54:42,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2023-02-17 03:54:42,187 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 11 [2023-02-17 03:54:42,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:54:42,187 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2023-02-17 03:54:42,188 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-17 03:54:42,188 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2023-02-17 03:54:42,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-17 03:54:42,188 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:54:42,188 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:54:42,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-17 03:54:42,189 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-17 03:54:42,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:54:42,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1457198630, now seen corresponding path program 1 times [2023-02-17 03:54:42,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:54:42,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786221598] [2023-02-17 03:54:42,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:54:42,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:54:42,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:54:42,209 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-17 03:54:42,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:54:42,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786221598] [2023-02-17 03:54:42,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786221598] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:54:42,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:54:42,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 03:54:42,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846181594] [2023-02-17 03:54:42,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:54:42,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 03:54:42,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:54:42,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 03:54:42,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 03:54:42,211 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-17 03:54:42,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:54:42,266 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2023-02-17 03:54:42,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 03:54:42,267 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-17 03:54:42,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:54:42,268 INFO L225 Difference]: With dead ends: 67 [2023-02-17 03:54:42,268 INFO L226 Difference]: Without dead ends: 65 [2023-02-17 03:54:42,268 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-17 03:54:42,269 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-17 03:54:42,270 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-17 03:54:42,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-02-17 03:54:42,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 48. [2023-02-17 03:54:42,279 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-17 03:54:42,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2023-02-17 03:54:42,282 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 12 [2023-02-17 03:54:42,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:54:42,282 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2023-02-17 03:54:42,283 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-17 03:54:42,284 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2023-02-17 03:54:42,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-17 03:54:42,284 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:54:42,284 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:54:42,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-17 03:54:42,285 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-17 03:54:42,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:54:42,285 INFO L85 PathProgramCache]: Analyzing trace with hash -210231649, now seen corresponding path program 1 times [2023-02-17 03:54:42,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:54:42,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31843] [2023-02-17 03:54:42,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:54:42,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:54:42,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:54:42,327 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-17 03:54:42,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:54:42,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31843] [2023-02-17 03:54:42,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31843] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:54:42,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725961920] [2023-02-17 03:54:42,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:54:42,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:54:42,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:54:42,328 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-17 03:54:42,330 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-17 03:54:42,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:54:42,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 03:54:42,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:54:42,367 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-17 03:54:42,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:54:42,389 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-17 03:54:42,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725961920] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:54:42,390 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 03:54:42,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-02-17 03:54:42,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139211353] [2023-02-17 03:54:42,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 03:54:42,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 03:54:42,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:54:42,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 03:54:42,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-02-17 03:54:42,391 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-17 03:54:42,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:54:42,431 INFO L93 Difference]: Finished difference Result 130 states and 157 transitions. [2023-02-17 03:54:42,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 03:54:42,432 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-17 03:54:42,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:54:42,432 INFO L225 Difference]: With dead ends: 130 [2023-02-17 03:54:42,433 INFO L226 Difference]: Without dead ends: 129 [2023-02-17 03:54:42,433 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-17 03:54:42,433 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-17 03:54:42,433 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-17 03:54:42,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-02-17 03:54:42,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 102. [2023-02-17 03:54:42,439 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-17 03:54:42,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 127 transitions. [2023-02-17 03:54:42,440 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 127 transitions. Word has length 14 [2023-02-17 03:54:42,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:54:42,440 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 127 transitions. [2023-02-17 03:54:42,440 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-17 03:54:42,440 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 127 transitions. [2023-02-17 03:54:42,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-17 03:54:42,440 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:54:42,440 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:54:42,453 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-17 03:54:42,653 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-17 03:54:42,654 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-17 03:54:42,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:54:42,654 INFO L85 PathProgramCache]: Analyzing trace with hash 888940113, now seen corresponding path program 1 times [2023-02-17 03:54:42,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:54:42,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771542704] [2023-02-17 03:54:42,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:54:42,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:54:42,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:54:42,672 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-17 03:54:42,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:54:42,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771542704] [2023-02-17 03:54:42,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771542704] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:54:42,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:54:42,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 03:54:42,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586893476] [2023-02-17 03:54:42,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:54:42,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 03:54:42,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:54:42,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 03:54:42,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 03:54:42,673 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-17 03:54:42,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:54:42,686 INFO L93 Difference]: Finished difference Result 102 states and 127 transitions. [2023-02-17 03:54:42,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 03:54:42,686 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-17 03:54:42,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:54:42,687 INFO L225 Difference]: With dead ends: 102 [2023-02-17 03:54:42,687 INFO L226 Difference]: Without dead ends: 101 [2023-02-17 03:54:42,687 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-17 03:54:42,687 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-17 03:54:42,688 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-17 03:54:42,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-02-17 03:54:42,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 93. [2023-02-17 03:54:42,697 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-17 03:54:42,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 115 transitions. [2023-02-17 03:54:42,697 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 115 transitions. Word has length 16 [2023-02-17 03:54:42,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:54:42,698 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 115 transitions. [2023-02-17 03:54:42,698 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-17 03:54:42,698 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 115 transitions. [2023-02-17 03:54:42,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-17 03:54:42,698 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:54:42,698 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:54:42,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-17 03:54:42,699 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-17 03:54:42,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:54:42,699 INFO L85 PathProgramCache]: Analyzing trace with hash -428731052, now seen corresponding path program 1 times [2023-02-17 03:54:42,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:54:42,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308857898] [2023-02-17 03:54:42,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:54:42,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:54:42,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:54:42,736 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-17 03:54:42,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:54:42,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308857898] [2023-02-17 03:54:42,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308857898] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:54:42,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257943252] [2023-02-17 03:54:42,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:54:42,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:54:42,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:54:42,738 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-17 03:54:42,739 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-17 03:54:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:54:42,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 03:54:42,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:54:42,778 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-17 03:54:42,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:54:42,802 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-17 03:54:42,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257943252] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:54:42,803 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 03:54:42,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2023-02-17 03:54:42,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62162365] [2023-02-17 03:54:42,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 03:54:42,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 03:54:42,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:54:42,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 03:54:42,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 03:54:42,804 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-17 03:54:42,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:54:42,827 INFO L93 Difference]: Finished difference Result 148 states and 180 transitions. [2023-02-17 03:54:42,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 03:54:42,828 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-17 03:54:42,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:54:42,828 INFO L225 Difference]: With dead ends: 148 [2023-02-17 03:54:42,828 INFO L226 Difference]: Without dead ends: 104 [2023-02-17 03:54:42,829 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-17 03:54:42,829 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-17 03:54:42,829 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-17 03:54:42,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-17 03:54:42,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2023-02-17 03:54:42,834 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-17 03:54:42,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 119 transitions. [2023-02-17 03:54:42,835 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 119 transitions. Word has length 18 [2023-02-17 03:54:42,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:54:42,835 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 119 transitions. [2023-02-17 03:54:42,835 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-17 03:54:42,835 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 119 transitions. [2023-02-17 03:54:42,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-17 03:54:42,836 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:54:42,836 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:54:42,853 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-17 03:54:43,040 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-17 03:54:43,040 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-17 03:54:43,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:54:43,041 INFO L85 PathProgramCache]: Analyzing trace with hash -292270522, now seen corresponding path program 2 times [2023-02-17 03:54:43,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:54:43,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719412627] [2023-02-17 03:54:43,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:54:43,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:54:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:54:43,060 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-17 03:54:43,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:54:43,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719412627] [2023-02-17 03:54:43,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719412627] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:54:43,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762698722] [2023-02-17 03:54:43,060 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 03:54:43,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:54:43,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:54:43,062 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-17 03:54:43,064 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-17 03:54:43,087 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-17 03:54:43,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 03:54:43,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 03:54:43,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:54:43,093 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-17 03:54:43,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:54:43,100 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-17 03:54:43,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762698722] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:54:43,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 03:54:43,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-02-17 03:54:43,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190014319] [2023-02-17 03:54:43,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 03:54:43,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 03:54:43,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:54:43,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 03:54:43,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 03:54:43,102 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-17 03:54:43,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:54:43,120 INFO L93 Difference]: Finished difference Result 100 states and 119 transitions. [2023-02-17 03:54:43,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 03:54:43,120 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-17 03:54:43,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:54:43,121 INFO L225 Difference]: With dead ends: 100 [2023-02-17 03:54:43,121 INFO L226 Difference]: Without dead ends: 81 [2023-02-17 03:54:43,121 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-17 03:54:43,122 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-17 03:54:43,122 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-17 03:54:43,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-17 03:54:43,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-02-17 03:54:43,125 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-17 03:54:43,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 98 transitions. [2023-02-17 03:54:43,126 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 98 transitions. Word has length 18 [2023-02-17 03:54:43,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:54:43,126 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 98 transitions. [2023-02-17 03:54:43,126 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-17 03:54:43,126 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 98 transitions. [2023-02-17 03:54:43,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-17 03:54:43,127 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:54:43,127 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:54:43,133 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-17 03:54:43,331 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-17 03:54:43,331 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-17 03:54:43,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:54:43,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1701396303, now seen corresponding path program 1 times [2023-02-17 03:54:43,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:54:43,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299414182] [2023-02-17 03:54:43,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:54:43,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:54:43,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:54:43,356 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-17 03:54:43,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:54:43,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299414182] [2023-02-17 03:54:43,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299414182] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:54:43,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461319341] [2023-02-17 03:54:43,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:54:43,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:54:43,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:54:43,364 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-17 03:54:43,366 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-17 03:54:43,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:54:43,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 03:54:43,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:54:43,408 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-17 03:54:43,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:54:43,431 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-17 03:54:43,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461319341] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:54:43,432 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 03:54:43,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-02-17 03:54:43,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677183080] [2023-02-17 03:54:43,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 03:54:43,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 03:54:43,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:54:43,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 03:54:43,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-02-17 03:54:43,433 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-17 03:54:43,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:54:43,562 INFO L93 Difference]: Finished difference Result 320 states and 382 transitions. [2023-02-17 03:54:43,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-17 03:54:43,562 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-17 03:54:43,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:54:43,563 INFO L225 Difference]: With dead ends: 320 [2023-02-17 03:54:43,563 INFO L226 Difference]: Without dead ends: 319 [2023-02-17 03:54:43,565 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-17 03:54:43,565 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-17 03:54:43,566 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-17 03:54:43,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2023-02-17 03:54:43,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 157. [2023-02-17 03:54:43,574 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-17 03:54:43,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 192 transitions. [2023-02-17 03:54:43,575 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 192 transitions. Word has length 19 [2023-02-17 03:54:43,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:54:43,575 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 192 transitions. [2023-02-17 03:54:43,575 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-17 03:54:43,575 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 192 transitions. [2023-02-17 03:54:43,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-17 03:54:43,579 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:54:43,579 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2023-02-17 03:54:43,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-17 03:54:43,780 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-17 03:54:43,780 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-17 03:54:43,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:54:43,781 INFO L85 PathProgramCache]: Analyzing trace with hash -813986932, now seen corresponding path program 2 times [2023-02-17 03:54:43,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:54:43,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261290563] [2023-02-17 03:54:43,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:54:43,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:54:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:54:43,804 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-17 03:54:43,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:54:43,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261290563] [2023-02-17 03:54:43,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261290563] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:54:43,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393603479] [2023-02-17 03:54:43,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 03:54:43,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:54:43,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:54:43,814 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-17 03:54:43,816 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-17 03:54:43,836 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-17 03:54:43,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 03:54:43,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 03:54:43,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:54:43,843 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-17 03:54:43,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:54:43,853 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-17 03:54:43,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393603479] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:54:43,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 03:54:43,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-02-17 03:54:43,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353617131] [2023-02-17 03:54:43,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 03:54:43,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 03:54:43,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:54:43,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 03:54:43,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 03:54:43,854 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-17 03:54:43,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:54:43,867 INFO L93 Difference]: Finished difference Result 157 states and 192 transitions. [2023-02-17 03:54:43,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 03:54:43,868 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-17 03:54:43,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:54:43,868 INFO L225 Difference]: With dead ends: 157 [2023-02-17 03:54:43,869 INFO L226 Difference]: Without dead ends: 156 [2023-02-17 03:54:43,869 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-17 03:54:43,869 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-17 03:54:43,870 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-17 03:54:43,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-02-17 03:54:43,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 52. [2023-02-17 03:54:43,874 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-17 03:54:43,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2023-02-17 03:54:43,874 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 35 [2023-02-17 03:54:43,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:54:43,874 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2023-02-17 03:54:43,874 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-17 03:54:43,875 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2023-02-17 03:54:43,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-17 03:54:43,877 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:54:43,877 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-17 03:54:43,886 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-17 03:54:44,081 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-17 03:54:44,082 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-17 03:54:44,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:54:44,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1838217185, now seen corresponding path program 1 times [2023-02-17 03:54:44,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:54:44,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458897025] [2023-02-17 03:54:44,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:54:44,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:54:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:54:44,157 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-17 03:54:44,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:54:44,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458897025] [2023-02-17 03:54:44,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458897025] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:54:44,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950879796] [2023-02-17 03:54:44,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:54:44,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:54:44,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:54:44,159 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-17 03:54:44,162 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-17 03:54:44,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:54:44,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-17 03:54:44,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:54:44,208 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-17 03:54:44,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:54:44,260 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-17 03:54:44,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950879796] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:54:44,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 03:54:44,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2023-02-17 03:54:44,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048576470] [2023-02-17 03:54:44,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 03:54:44,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-17 03:54:44,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:54:44,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-17 03:54:44,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2023-02-17 03:54:44,262 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-17 03:54:44,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:54:44,677 INFO L93 Difference]: Finished difference Result 344 states and 401 transitions. [2023-02-17 03:54:44,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-02-17 03:54:44,677 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-17 03:54:44,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:54:44,678 INFO L225 Difference]: With dead ends: 344 [2023-02-17 03:54:44,678 INFO L226 Difference]: Without dead ends: 343 [2023-02-17 03:54:44,679 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-17 03:54:44,680 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-17 03:54:44,680 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-17 03:54:44,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2023-02-17 03:54:44,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 101. [2023-02-17 03:54:44,687 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-17 03:54:44,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2023-02-17 03:54:44,688 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 35 [2023-02-17 03:54:44,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:54:44,688 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2023-02-17 03:54:44,688 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-17 03:54:44,688 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2023-02-17 03:54:44,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-17 03:54:44,689 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:54:44,689 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-17 03:54:44,697 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-17 03:54:44,893 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-17 03:54:44,893 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-17 03:54:44,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:54:44,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1212228847, now seen corresponding path program 2 times [2023-02-17 03:54:44,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:54:44,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611959335] [2023-02-17 03:54:44,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:54:44,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:54:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:54:45,020 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-17 03:54:45,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:54:45,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611959335] [2023-02-17 03:54:45,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611959335] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:54:45,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698671340] [2023-02-17 03:54:45,021 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 03:54:45,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:54:45,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:54:45,023 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-17 03:54:45,043 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-17 03:54:45,057 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 03:54:45,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 03:54:45,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-17 03:54:45,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:54:45,110 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-17 03:54:45,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:54:45,234 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-17 03:54:45,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698671340] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:54:45,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 03:54:45,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2023-02-17 03:54:45,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483637368] [2023-02-17 03:54:45,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 03:54:45,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-17 03:54:45,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:54:45,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-17 03:54:45,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=433, Unknown=0, NotChecked=0, Total=650 [2023-02-17 03:54:45,236 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-17 03:54:46,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:54:46,261 INFO L93 Difference]: Finished difference Result 812 states and 940 transitions. [2023-02-17 03:54:46,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2023-02-17 03:54:46,261 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-17 03:54:46,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:54:46,264 INFO L225 Difference]: With dead ends: 812 [2023-02-17 03:54:46,264 INFO L226 Difference]: Without dead ends: 811 [2023-02-17 03:54:46,267 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-17 03:54:46,268 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-17 03:54:46,268 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-17 03:54:46,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2023-02-17 03:54:46,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 151. [2023-02-17 03:54:46,281 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-17 03:54:46,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 177 transitions. [2023-02-17 03:54:46,282 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 177 transitions. Word has length 60 [2023-02-17 03:54:46,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:54:46,282 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 177 transitions. [2023-02-17 03:54:46,282 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-17 03:54:46,282 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 177 transitions. [2023-02-17 03:54:46,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-02-17 03:54:46,283 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:54:46,283 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-17 03:54:46,291 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-17 03:54:46,491 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-17 03:54:46,491 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-17 03:54:46,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:54:46,492 INFO L85 PathProgramCache]: Analyzing trace with hash 626428527, now seen corresponding path program 3 times [2023-02-17 03:54:46,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:54:46,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959706113] [2023-02-17 03:54:46,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:54:46,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:54:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:54:46,570 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-17 03:54:46,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:54:46,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959706113] [2023-02-17 03:54:46,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959706113] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:54:46,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142544824] [2023-02-17 03:54:46,571 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 03:54:46,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:54:46,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:54:46,572 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-17 03:54:46,574 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-17 03:54:46,594 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-02-17 03:54:46,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 03:54:46,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 03:54:46,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:54:46,617 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-17 03:54:46,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:54:46,635 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-17 03:54:46,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142544824] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:54:46,635 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 03:54:46,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2023-02-17 03:54:46,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911994270] [2023-02-17 03:54:46,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 03:54:46,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 03:54:46,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:54:46,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 03:54:46,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-02-17 03:54:46,637 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-17 03:54:46,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:54:46,827 INFO L93 Difference]: Finished difference Result 774 states and 909 transitions. [2023-02-17 03:54:46,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-17 03:54:46,827 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-17 03:54:46,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:54:46,828 INFO L225 Difference]: With dead ends: 774 [2023-02-17 03:54:46,828 INFO L226 Difference]: Without dead ends: 0 [2023-02-17 03:54:46,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 119 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=320, Invalid=672, Unknown=0, NotChecked=0, Total=992 [2023-02-17 03:54:46,829 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 146 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-17 03:54:46,830 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-17 03:54:46,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-17 03:54:46,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-17 03:54:46,830 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-17 03:54:46,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-17 03:54:46,831 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2023-02-17 03:54:46,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:54:46,831 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-17 03:54:46,831 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-17 03:54:46,831 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-17 03:54:46,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-17 03:54:46,833 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2023-02-17 03:54:46,833 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2023-02-17 03:54:46,833 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2023-02-17 03:54:46,834 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2023-02-17 03:54:46,834 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2023-02-17 03:54:46,834 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2023-02-17 03:54:46,834 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2023-02-17 03:54:46,834 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2023-02-17 03:54:46,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-17 03:54:47,038 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-17 03:54:47,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-17 03:54:47,052 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2023-02-17 03:54:47,053 INFO L895 garLoopResultBuilder]: At program point L23-2(lines 23 34) the Hoare annotation is: (let ((.cse52 (<= 0 |ULTIMATE.start_main_~j~0#1|)) (.cse19 (<= 0 |ULTIMATE.start_main_~i~0#1|))) (let ((.cse15 (<= |ULTIMATE.start_main_~k~0#1| 0)) (.cse18 (or (and .cse52 .cse19) .cse19)) (.cse5 (<= |ULTIMATE.start_main_~j~0#1| 0)) (.cse20 (<= 0 |ULTIMATE.start_main_~N~0#1|)) (.cse4 (<= |ULTIMATE.start_main_~N~0#1| 2147483647))) (let ((.cse0 (<= |ULTIMATE.start_main_~n~0#1| 2147483647)) (.cse6 (<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~j~0#1|)) (.cse1 (let ((.cse47 (and (<= 0 |ULTIMATE.start_main_~k~0#1|) .cse19 (or (and .cse52 .cse5) .cse52) .cse20 .cse4)) (.cse51 (and .cse18 .cse19 .cse20 .cse4 .cse5))) (let ((.cse50 (and .cse15 (or .cse47 .cse51)))) (let ((.cse48 (+ |ULTIMATE.start_main_~j~0#1| 1)) (.cse49 (or .cse47 .cse50 .cse51))) (or .cse47 (and (<= .cse48 2147483647) .cse49) (and .cse49 .cse5) (and .cse49 (< .cse48 2147483647)) .cse50 (and (<= |ULTIMATE.start_main_~j~0#1| 1) .cse49) .cse51)))))) (let ((.cse25 (< |ULTIMATE.start_main_~k~0#1| 2147483647)) (.cse32 (or (and .cse0 .cse6 .cse1 (<= (+ 2 |ULTIMATE.start_main_~k~0#1|) 2147483647) .cse4) (and .cse0 (<= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 2147483645) .cse6 .cse1 .cse4) (and .cse0 .cse6 .cse1 .cse4))) (.cse21 (<= |ULTIMATE.start_main_~m~0#1| 2147483647)) (.cse46 (+ |ULTIMATE.start_main_~i~0#1| 1)) (.cse36 (+ |ULTIMATE.start_main_~k~0#1| 1))) (let ((.cse39 (< .cse36 2147483646)) (.cse11 (<= .cse46 2147483647)) (.cse38 (< |ULTIMATE.start_main_~k~0#1| 2147483646)) (.cse24 (and .cse25 .cse32 .cse21)) (.cse27 (and .cse32 .cse21))) (let ((.cse30 (< |ULTIMATE.start_main_~i~0#1| 2147483644)) (.cse31 (<= |ULTIMATE.start_main_~k~0#1| 3)) (.cse10 (<= |ULTIMATE.start_main_~k~0#1| 1)) (.cse23 (<= |ULTIMATE.start_main_~i~0#1| 2147483646)) (.cse26 (or .cse24 .cse27)) (.cse33 (or (and .cse11 .cse32 .cse39 .cse21) (and .cse11 .cse38 .cse32 .cse21))) (.cse22 (< .cse46 2147483647)) (.cse34 (< .cse36 2147483645))) (let ((.cse7 (let ((.cse45 (< .cse36 2147483640))) (or (and .cse45 .cse26 .cse22) (and .cse45 .cse22 .cse33) (and .cse45 .cse22 .cse34 .cse32 .cse21)))) (.cse2 (>= |ULTIMATE.start_main_~j~0#1| 0)) (.cse3 (<= |ULTIMATE.start_main_~m~0#1| 0)) (.cse17 (let ((.cse43 (<= |ULTIMATE.start_main_~k~0#1| 2))) (let ((.cse42 (<= |ULTIMATE.start_main_~k~0#1| 7)) (.cse40 (let ((.cse44 (<= |ULTIMATE.start_main_~i~0#1| 3))) (or (and .cse0 .cse10 .cse6 .cse44 .cse23 .cse1 .cse4 .cse21) (and .cse0 .cse10 .cse43 .cse6 .cse44 .cse23 .cse1 .cse4 .cse21) (and .cse43 .cse44 .cse32 .cse21)))) (.cse41 (<= |ULTIMATE.start_main_~i~0#1| 8))) (or (and .cse40 .cse41 .cse42) (and .cse26 .cse41 .cse42) (and .cse22 .cse41 .cse34 .cse42 .cse32 .cse21) (and .cse30 .cse41 .cse31 .cse32 .cse21) (and .cse41 .cse42 .cse33) (and .cse10 .cse40 .cse41) (and (<= |ULTIMATE.start_main_~k~0#1| 6) .cse41 .cse33) (and .cse30 .cse41 .cse31 .cse42 .cse32 .cse21) (and .cse22 (<= |ULTIMATE.start_main_~k~0#1| 4) .cse41 .cse34 .cse32 .cse21) (and .cse41 (<= |ULTIMATE.start_main_~k~0#1| 5) .cse33) (and .cse43 .cse40 .cse41))))) (.cse16 (<= |ULTIMATE.start_main_~i~0#1| 1)) (.cse12 (let ((.cse35 (< .cse36 2147483641)) (.cse37 (< .cse36 2147483642))) (or (and .cse35 .cse11 .cse33) (and .cse26 .cse11 (< .cse36 2147483644)) (and .cse35 .cse26 .cse11) (and .cse26 (< .cse36 2147483643) .cse11) (and .cse26 .cse11 .cse34) (and .cse37 .cse11 .cse33) (and .cse26 .cse37 .cse11) (and .cse26 .cse11 .cse38) (and .cse26 .cse11 .cse39) (and .cse11 .cse38 .cse33)))) (.cse13 (let ((.cse28 (<= |ULTIMATE.start_main_~k~0#1| 8)) (.cse29 (< |ULTIMATE.start_main_~i~0#1| 2147483639))) (or (and .cse26 .cse28 .cse29) (and .cse30 .cse28 .cse31 .cse29 .cse32 .cse21) (and .cse28 .cse29 .cse33) (and .cse22 .cse28 .cse34 .cse29 .cse32 .cse21)))) (.cse9 (<= |ULTIMATE.start_main_~N~0#1| 1)) (.cse14 (or .cse24 (and .cse25 .cse26) .cse27)) (.cse8 (<= |ULTIMATE.start_main_~k~0#1| 2147483646))) (or (and .cse0 (or (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse1 .cse3 .cse4 .cse5))) (and .cse0 .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse11 .cse12 .cse9) (and .cse0 .cse13) (and .cse0 .cse14 .cse8 .cse9) (and .cse0 .cse10 .cse11 .cse14 .cse9) (and .cse0 .cse15 .cse14 .cse16 .cse9) (and .cse0 .cse7 .cse8) (and .cse0 .cse10 .cse11 .cse7 .cse9) (and .cse0 .cse10 .cse17 .cse11 .cse9) (and .cse0 .cse17) (and .cse0 .cse18 .cse11 .cse2 .cse19 .cse3 .cse20 .cse4 .cse5) (and .cse0 .cse7) (and .cse0 .cse17 .cse8) (and .cse0 .cse6 (<= |ULTIMATE.start_main_~i~0#1| 2) .cse15 .cse1 .cse16 (<= |ULTIMATE.start_main_~i~0#1| 7) .cse4 .cse21 .cse9) (and .cse0 .cse6 .cse18 .cse19 .cse3 .cse20 .cse16 .cse4 .cse5) (and .cse0 .cse13 .cse8 .cse9) (and .cse0 .cse15 .cse7 .cse16 .cse9) (and .cse0 .cse22 .cse18 .cse2 .cse19 .cse3 .cse20 .cse4 .cse5) (and .cse0 .cse13 .cse15 .cse16 .cse9) (and .cse0 .cse15 .cse12 .cse16 .cse9) (and .cse0 .cse13 .cse8) (and .cse0 .cse10 .cse17 .cse11) (and .cse0 .cse14) (and .cse0 .cse12) (and .cse0 (<= |ULTIMATE.start_main_~i~0#1| 0) .cse23 .cse18 .cse19 .cse20 .cse4 .cse21) (and .cse0 .cse8 .cse12) (and .cse0 .cse17 .cse15 .cse16 .cse9) (and .cse0 .cse8 .cse12 .cse9) (and .cse0 .cse10 .cse11 .cse13 .cse9) (and .cse0 .cse14 .cse8))))))))) [2023-02-17 03:54:47,054 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 13 37) the Hoare annotation is: true [2023-02-17 03:54:47,054 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2023-02-17 03:54:47,054 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-17 03:54:47,054 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2023-02-17 03:54:47,054 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2023-02-17 03:54:47,054 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-17 03:54:47,054 INFO L899 garLoopResultBuilder]: For program point L28-1(line 28) no Hoare annotation was computed. [2023-02-17 03:54:47,054 INFO L899 garLoopResultBuilder]: For program point L28-2(lines 28 30) no Hoare annotation was computed. [2023-02-17 03:54:47,056 INFO L895 garLoopResultBuilder]: At program point L28-4(lines 28 30) the Hoare annotation is: (let ((.cse87 (+ |ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse43 (< .cse87 2147483647)) (.cse7 (<= |ULTIMATE.start_main_~i~0#1| 1)) (.cse9 (<= .cse87 2147483647)) (.cse71 (<= |ULTIMATE.start_main_~N~0#1| 2147483647)) (.cse2 (<= |ULTIMATE.start_main_~i~0#1| 0))) (let ((.cse67 (<= 0 |ULTIMATE.start_main_~k~0#1|)) (.cse69 (<= 0 |ULTIMATE.start_main_~i~0#1|)) (.cse70 (let ((.cse84 (let ((.cse86 (<= 0 |ULTIMATE.start_main_~j~0#1|))) (or .cse86 (and .cse2 .cse86)))) (.cse85 (<= 0 |ULTIMATE.start_main_~N~0#1|))) (or (and .cse43 .cse84 .cse85 .cse71) (and .cse84 .cse85 .cse71) (and .cse2 .cse84 .cse85 .cse71) (and .cse84 .cse85 .cse7 .cse71) (and .cse84 .cse9 .cse85 .cse71)))) (.cse83 (+ |ULTIMATE.start_main_~j~0#1| 1))) (let ((.cse75 (< .cse83 2147483647)) (.cse68 (<= .cse83 2147483647)) (.cse81 (<= (+ 2 |ULTIMATE.start_main_~k~0#1|) 2147483647)) (.cse73 (<= |ULTIMATE.start_main_~j~0#1| 1)) (.cse0 (<= |ULTIMATE.start_main_~n~0#1| 2147483647)) (.cse82 (<= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 2147483645)) (.cse74 (<= |ULTIMATE.start_main_~i~0#1| 2147483646)) (.cse80 (or (and .cse67 .cse69 .cse70) (and .cse67 .cse2 .cse69 .cse70))) (.cse72 (<= |ULTIMATE.start_main_~m~0#1| 2147483647))) (let ((.cse53 (and (or (and .cse73 .cse0 .cse82 .cse74 .cse80 .cse71) (and .cse73 .cse0 .cse74 .cse80 .cse81 .cse7 .cse71) (and .cse73 .cse0 .cse82 .cse74 .cse80 .cse7 .cse71) (and .cse73 .cse0 .cse2 .cse74 .cse80 .cse81 .cse71) (and .cse73 .cse0 .cse82 .cse2 .cse74 .cse80 .cse71)) .cse72)) (.cse54 (and (or (and .cse0 .cse82 .cse68 .cse2 .cse80 .cse71) (and .cse0 .cse82 .cse68 .cse80 .cse7 .cse71) (and .cse0 .cse68 .cse80 .cse81 .cse7 .cse71) (and .cse0 .cse68 .cse2 .cse80 .cse81 .cse71) (and .cse0 .cse82 .cse68 .cse74 .cse80 .cse71) (and .cse0 .cse82 .cse68 .cse80 .cse71)) .cse72)) (.cse59 (and (or (and .cse0 .cse82 .cse74 .cse80 .cse71) (and .cse0 .cse82 .cse2 .cse80 .cse71) (and .cse0 .cse80 .cse81 .cse7 .cse71) (and .cse0 .cse82 .cse80 .cse7 .cse71) (and .cse0 .cse82 .cse80 .cse71) (and .cse0 .cse2 .cse80 .cse81 .cse71)) .cse72)) (.cse61 (and (or (and .cse0 .cse80 .cse75 .cse81 .cse7 .cse71) (and .cse0 .cse82 .cse2 .cse80 .cse75 .cse71) (and .cse0 .cse2 .cse80 .cse75 .cse81 .cse71) (and .cse0 .cse82 .cse80 .cse75 .cse7 .cse71) (and .cse0 .cse82 .cse80 .cse75 .cse71) (and .cse0 .cse82 .cse74 .cse80 .cse75 .cse71)) .cse72))) (let ((.cse18 (<= |ULTIMATE.start_main_~k~0#1| 1)) (.cse37 (+ |ULTIMATE.start_main_~k~0#1| 1)) (.cse42 (< |ULTIMATE.start_main_~k~0#1| 2147483646)) (.cse76 (<= |ULTIMATE.start_main_~i~0#1| 3)) (.cse26 (or (and .cse73 .cse0 .cse74 .cse80 .cse71 .cse72) (and .cse0 .cse80 .cse75 .cse71 .cse72) (and .cse0 .cse68 .cse80 .cse71 .cse72) (and .cse0 .cse80 .cse71 .cse72))) (.cse48 (< |ULTIMATE.start_main_~k~0#1| 2147483647)) (.cse79 (<= |ULTIMATE.start_main_~i~0#1| 2)) (.cse78 (< |ULTIMATE.start_main_~i~0#1| 2147483644)) (.cse77 (or .cse53 .cse54 .cse59 .cse61))) (let ((.cse49 (and .cse2 .cse77)) (.cse50 (and .cse78 .cse77)) (.cse51 (and .cse48 .cse79 .cse77)) (.cse52 (and .cse48 .cse78 .cse77)) (.cse55 (and .cse77 .cse9)) (.cse56 (and .cse48 .cse43 .cse77)) (.cse57 (and .cse79 .cse77)) (.cse58 (and .cse48 .cse26 .cse9)) (.cse60 (and .cse76 .cse77)) (.cse62 (and .cse43 .cse77)) (.cse63 (and .cse48 .cse2 .cse77)) (.cse64 (and .cse48 .cse76 .cse77)) (.cse65 (and .cse48 .cse77 .cse9)) (.cse44 (and .cse43 .cse26 .cse42)) (.cse47 (< .cse37 2147483645)) (.cse23 (or (and (or (and .cse0 .cse18 .cse2 .cse80 .cse75 .cse71) (and .cse0 .cse18 .cse80 .cse75 .cse7 .cse71)) .cse72) (and (or (and .cse0 .cse18 .cse80 .cse7 .cse71) (and .cse0 .cse18 .cse2 .cse80 .cse71)) .cse72) (and (or (and .cse0 .cse18 .cse68 .cse80 .cse7 .cse71) (and .cse0 .cse18 .cse68 .cse2 .cse80 .cse71)) .cse72) (and (or (and .cse73 .cse0 .cse18 .cse2 .cse74 .cse80 .cse71) (and .cse73 .cse0 .cse18 .cse74 .cse80 .cse7 .cse71)) .cse72))) (.cse28 (<= |ULTIMATE.start_main_~k~0#1| 2)) (.cse30 (<= |ULTIMATE.start_main_~k~0#1| 3)) (.cse40 (< .cse37 2147483646))) (let ((.cse24 (or (and .cse76 .cse77 .cse40) (and .cse78 .cse77 .cse40) (and .cse2 .cse77 .cse40) (and .cse79 .cse77 .cse40))) (.cse34 (<= |ULTIMATE.start_main_~i~0#1| 8)) (.cse36 (< |ULTIMATE.start_main_~i~0#1| 2147483639)) (.cse29 (or (and .cse79 .cse77 .cse30) (and .cse76 .cse77 .cse30) (and .cse2 .cse77 .cse30) (and .cse76 .cse26 .cse30))) (.cse27 (or (and .cse28 .cse79 .cse77) (and .cse28 .cse2 .cse77) (and .cse23 .cse28 .cse79))) (.cse19 (or (and .cse2 .cse77 .cse47) (and .cse79 .cse77 .cse47) (and .cse76 .cse77 .cse47) (and .cse78 .cse26 .cse47) (and .cse78 .cse77 .cse47))) (.cse17 (or (and .cse76 .cse77 .cse42) (and .cse43 .cse77 .cse42) (and .cse78 .cse77 .cse42) .cse44 (and .cse79 .cse77 .cse42) (and .cse2 .cse77 .cse42))) (.cse32 (or .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64 .cse65)) (.cse35 (<= |ULTIMATE.start_main_~i~0#1| 7)) (.cse5 (<= |ULTIMATE.start_main_~k~0#1| 0))) (let ((.cse20 (<= |ULTIMATE.start_main_~k~0#1| 4)) (.cse14 (or (and .cse67 .cse0 .cse68 .cse2 .cse5 .cse69 .cse70 .cse71 .cse72) (and .cse67 .cse73 .cse0 .cse2 .cse74 .cse5 .cse69 .cse70 .cse71 .cse72) (and .cse67 .cse0 .cse2 .cse5 .cse69 .cse75 .cse70 .cse71 .cse72) (and .cse67 .cse0 .cse2 .cse5 .cse69 .cse70 .cse71 .cse72))) (.cse11 (let ((.cse66 (<= |ULTIMATE.start_main_~k~0#1| 7))) (or (and .cse29 .cse66 .cse35) (and .cse27 .cse66 .cse35) (and .cse32 .cse2 .cse66) (and .cse19 .cse66 .cse35) (and .cse66 .cse35 .cse17) (and .cse32 .cse66 .cse35)))) (.cse4 (or (and .cse48 .cse32 .cse9) (and .cse32 .cse9) .cse49 .cse50 (and .cse48 .cse32 .cse35) .cse51 (and .cse48 .cse32 .cse34) .cse52 .cse53 (and .cse32 .cse35) .cse54 .cse55 .cse56 (and .cse32 .cse34) (and .cse32 .cse43) .cse57 (and .cse32 .cse36) .cse58 .cse59 (and .cse48 .cse32 .cse2) .cse60 .cse61 .cse62 .cse63 .cse64 (and .cse32 .cse2) (and .cse48 .cse32 .cse43) (and .cse48 .cse32 .cse36) .cse65)) (.cse22 (or (and .cse32 .cse34 .cse47) (and .cse32 .cse47 .cse35) (and .cse32 .cse47 .cse36) (and .cse32 .cse2 .cse47))) (.cse16 (<= |ULTIMATE.start_main_~k~0#1| 6)) (.cse6 (let ((.cse46 (< .cse37 2147483642))) (or (and .cse46 .cse36 .cse17) (and .cse46 .cse35 .cse17) (and .cse32 .cse46 .cse36) (and .cse46 .cse34 .cse17) (and .cse32 .cse2 .cse46) (and .cse32 .cse46 .cse34) (and .cse32 .cse46 .cse35)))) (.cse10 (let ((.cse45 (< .cse37 2147483644))) (or (and .cse32 .cse45 .cse35) (and .cse32 .cse2 .cse45) (and .cse32 .cse45 .cse36) (and .cse32 .cse34 .cse45)))) (.cse25 (<= |ULTIMATE.start_main_~k~0#1| 5)) (.cse3 (or (and .cse32 .cse2 .cse42) (and .cse32 .cse43 .cse42) (and .cse32 .cse42 .cse35) .cse44 (and .cse32 .cse34 .cse42) (and .cse43 .cse42 .cse17) (and .cse32 .cse42 .cse36))) (.cse12 (let ((.cse41 (< .cse37 2147483640))) (or (and .cse41 .cse19 .cse34) (and .cse41 .cse35 .cse17) (and .cse41 .cse32 .cse35) (and .cse41 .cse36 .cse17) (and .cse41 .cse19 .cse35) (and .cse41 .cse26 .cse36) (and .cse41 .cse24 .cse34) (and .cse41 .cse32 .cse2) (and .cse41 .cse19 .cse36) (and .cse41 .cse32 .cse36) (and .cse41 .cse24 .cse35) (and .cse41 .cse32 .cse34)))) (.cse21 (or (and .cse32 .cse35 .cse40) (and .cse32 .cse36 .cse40) (and .cse32 .cse34 .cse40) (and .cse32 .cse2 .cse40))) (.cse13 (<= |ULTIMATE.start_main_~k~0#1| 2147483646)) (.cse31 (let ((.cse39 (<= |ULTIMATE.start_main_~k~0#1| 8))) (or (and .cse19 .cse34 .cse39) (and .cse24 .cse39 .cse35) (and .cse19 .cse39 .cse35) (and .cse29 .cse34 .cse39) (and .cse34 .cse39 .cse17) (and .cse32 .cse39 .cse35) (and .cse29 .cse39 .cse35) (and .cse32 .cse34 .cse39) (and .cse26 .cse34 .cse39) (and .cse32 .cse2 .cse39)))) (.cse1 (let ((.cse38 (< .cse37 2147483641))) (or (and .cse38 .cse32 .cse2) (and .cse38 .cse24 .cse35) (and .cse38 .cse24 .cse36) (and .cse38 .cse35 .cse17) (and .cse38 .cse34 .cse17) (and .cse38 .cse32 .cse36) (and .cse38 .cse32 .cse35) (and .cse38 .cse32 .cse34) (and .cse38 .cse24 .cse34)))) (.cse15 (let ((.cse33 (< .cse37 2147483643))) (or (and .cse32 .cse33 .cse34) (and .cse32 .cse33 .cse35) (and .cse32 .cse33 .cse36) (and .cse32 .cse2 .cse33)))) (.cse8 (<= |ULTIMATE.start_main_~N~0#1| 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3) (and .cse0 .cse4) (and .cse0 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse5 .cse8) (and .cse0 .cse2 .cse4 .cse5 .cse8) (and .cse0 .cse10) (and .cse0 .cse2 .cse6) (and .cse0 .cse11 .cse2 .cse5 .cse8) (and .cse0 .cse12) (and .cse0 .cse9 .cse12 .cse13) (and .cse0 .cse14 .cse2 .cse5) (and .cse0 .cse2 .cse15 .cse5 .cse8) (and .cse0 .cse2 .cse16 .cse5 .cse17 .cse8) (and .cse0 .cse15) (and .cse0 .cse3 .cse9) (and .cse0 .cse18 .cse3 .cse7 .cse8) (and .cse0 .cse19 .cse2 .cse20) (and .cse0 .cse21 .cse7) (and .cse0 .cse12 .cse7) (and .cse0 .cse11 .cse2) (and .cse0 .cse2 .cse5 .cse22 .cse8) (and .cse0 .cse9 .cse5 .cse6 .cse8) (and .cse0 .cse15 .cse7) (and .cse0 .cse5 .cse7 .cse22 .cse8) (and .cse0 .cse23 .cse18 .cse2) (and .cse0 .cse21 .cse2) (and .cse0 .cse2 .cse4) (and .cse0 .cse1) (and .cse0 .cse19 .cse2 .cse20 .cse5 .cse8) (and .cse0 .cse9 .cse5 .cse12 .cse8) (and .cse0 .cse14 .cse2 .cse5 .cse8) (and .cse0 .cse18 .cse11 .cse7) (and .cse0 .cse3 .cse9 .cse5 .cse8) (and .cse0 .cse1 .cse5 .cse7 .cse8) (and .cse0 .cse18 .cse11 .cse7 .cse8) (and .cse0 .cse11 .cse9 .cse13) (and .cse0 .cse22) (and .cse0 .cse2 .cse24 .cse25) (and .cse0 .cse26 .cse9 .cse13 .cse8) (and .cse0 .cse4 .cse9 .cse13) (and .cse0 .cse27 .cse28 .cse2 .cse13) (and .cse0 .cse21 .cse5 .cse7 .cse8) (and .cse0 .cse3 .cse7) (and .cse0 .cse21 .cse9 .cse5 .cse8) (and .cse0 .cse5 .cse10 .cse7 .cse8) (and .cse0 .cse18 .cse26 .cse7 .cse8) (and .cse0 .cse18 .cse12 .cse7 .cse8) (and .cse0 .cse2 .cse15) (and .cse0 .cse9 .cse22) (and .cse0 .cse9 .cse6) (and .cse0 .cse3 .cse2 .cse5 .cse8) (and .cse0 .cse7 .cse22) (and .cse0 .cse2 .cse29 .cse5 .cse30 .cse8) (and .cse0 .cse9 .cse12 .cse13 .cse8) (and .cse0 .cse4 .cse9 .cse13 .cse8) (and .cse0 .cse26 .cse9 .cse13) (and .cse0 .cse31 .cse9 .cse13 .cse8) (and .cse0 .cse9 .cse12) (and .cse0 .cse18 .cse4 .cse7 .cse8) (and .cse0 .cse4 .cse5 .cse7 .cse8) (and .cse0 .cse2 .cse10) (and .cse0 .cse9 .cse5 .cse10 .cse8) (and .cse0 .cse4 .cse9 .cse5 .cse8) (and .cse0 .cse4 .cse9) (and .cse0 .cse18 .cse31 .cse7 .cse8) (and .cse0 .cse3 .cse9 .cse13 .cse8) (and .cse0 .cse2 .cse5 .cse6 .cse8) (and .cse0 .cse5 .cse12 .cse7 .cse8) (and .cse0 .cse6 .cse7) (and .cse0 .cse31 .cse13 .cse7) (and .cse0 .cse2 .cse29 .cse30) (and .cse0 .cse11) (and .cse0 .cse4 .cse7) (and .cse0 .cse27 .cse28 .cse2 .cse5 .cse8) (and .cse0 .cse21) (and .cse0 .cse9 .cse10) (and .cse0 .cse10 .cse7) (and .cse0 .cse9 .cse5 .cse22 .cse8) (and .cse0 .cse31 .cse2) (and .cse0 .cse2 .cse22) (and .cse0 .cse3 .cse2) (and .cse0 .cse2 .cse16 .cse17) (and .cse0 .cse6) (and .cse0 .cse2 .cse12) (and .cse0 .cse2 .cse5 .cse10 .cse8) (and .cse0 .cse2 .cse24 .cse5 .cse25 .cse8) (and .cse0 .cse3 .cse5 .cse7 .cse8) (and .cse0 .cse3 .cse9 .cse13) (and .cse0 .cse2 .cse5 .cse12 .cse8) (and .cse0 .cse23 .cse18 .cse2 .cse5 .cse8) (and .cse0 .cse31) (and .cse0 .cse1 .cse9) (and .cse0 .cse31 .cse5 .cse7 .cse8) (and .cse0 .cse15 .cse9) (and .cse0 .cse1 .cse2 .cse5 .cse8) (and .cse0 .cse31 .cse2 .cse5 .cse8) (and .cse0 .cse21 .cse2 .cse5 .cse8) (and .cse0 .cse21 .cse9) (and .cse0 .cse31 .cse9 .cse13) (and .cse0 .cse31 .cse9) (and .cse0 .cse1 .cse7) (and .cse0 .cse15 .cse9 .cse5 .cse8) (and .cse0 .cse15 .cse5 .cse7 .cse8))))))))))) [2023-02-17 03:54:47,057 INFO L899 garLoopResultBuilder]: For program point L28-5(lines 28 30) no Hoare annotation was computed. [2023-02-17 03:54:47,057 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2023-02-17 03:54:47,057 INFO L899 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2023-02-17 03:54:47,057 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-17 03:54:47,057 INFO L899 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2023-02-17 03:54:47,057 INFO L899 garLoopResultBuilder]: For program point L29-1(line 29) no Hoare annotation was computed. [2023-02-17 03:54:47,057 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2023-02-17 03:54:47,058 INFO L895 garLoopResultBuilder]: At program point L25-2(lines 25 32) the Hoare annotation is: (let ((.cse83 (+ |ULTIMATE.start_main_~j~0#1| 1))) (let ((.cse20 (<= |ULTIMATE.start_main_~j~0#1| 1)) (.cse26 (<= .cse83 2147483647)) (.cse27 (< .cse83 2147483647)) (.cse78 (<= (+ 2 |ULTIMATE.start_main_~k~0#1|) 2147483647)) (.cse0 (<= |ULTIMATE.start_main_~n~0#1| 2147483647)) (.cse79 (<= (+ (- 1) |ULTIMATE.start_main_~k~0#1|) 2147483645)) (.cse6 (<= |ULTIMATE.start_main_~i~0#1| 2147483646)) (.cse25 (<= |ULTIMATE.start_main_~m~0#1| 2147483647)) (.cse22 (<= |ULTIMATE.start_main_~k~0#1| 0)) (.cse19 (<= 0 |ULTIMATE.start_main_~k~0#1|)) (.cse21 (<= 0 |ULTIMATE.start_main_~j~0#1|)) (.cse23 (<= 0 |ULTIMATE.start_main_~i~0#1|)) (.cse24 (<= 0 |ULTIMATE.start_main_~N~0#1|)) (.cse10 (<= |ULTIMATE.start_main_~N~0#1| 2147483647)) (.cse11 (<= |ULTIMATE.start_main_~j~0#1| 0))) (let ((.cse8 (let ((.cse81 (and .cse21 .cse23 .cse24 .cse10 .cse11)) (.cse82 (and .cse19 .cse21 .cse23 .cse24 .cse10 .cse11))) (or (and (or .cse81 .cse82) .cse22) .cse81 .cse82))) (.cse65 (and (or (and .cse19 .cse0 .cse6 .cse21 .cse23 .cse24 .cse78 .cse10) (and .cse19 .cse0 .cse79 .cse6 .cse21 .cse23 .cse24 .cse10)) .cse25)) (.cse66 (and .cse25 (or (and .cse19 .cse0 .cse6 .cse21 .cse23 .cse24 .cse27 .cse78 .cse10) (and .cse19 .cse0 .cse79 .cse6 .cse21 .cse23 .cse24 .cse27 .cse10)))) (.cse68 (and (or (and .cse19 .cse0 .cse79 .cse26 .cse6 .cse21 .cse23 .cse24 .cse10) (and .cse19 .cse0 .cse26 .cse6 .cse21 .cse23 .cse24 .cse78 .cse10)) .cse25)) (.cse69 (and (or (and .cse19 .cse20 .cse0 .cse6 .cse21 .cse23 .cse24 .cse78 .cse10) (and .cse19 .cse20 .cse0 .cse79 .cse6 .cse21 .cse23 .cse24 .cse10)) .cse25)) (.cse80 (+ |ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse34 (< .cse80 2147483647)) (.cse56 (< |ULTIMATE.start_main_~k~0#1| 2147483646)) (.cse77 (+ |ULTIMATE.start_main_~k~0#1| 1)) (.cse53 (or .cse65 .cse66 .cse68 .cse69)) (.cse30 (or (and .cse19 .cse0 .cse21 .cse23 .cse24 .cse27 .cse10 .cse25) (and .cse19 .cse0 .cse21 .cse23 .cse24 .cse10 .cse25) (and .cse19 .cse20 .cse0 .cse21 .cse23 .cse24 .cse10 .cse25) (and .cse19 .cse0 .cse26 .cse21 .cse23 .cse24 .cse10 .cse25))) (.cse1 (<= .cse80 2147483647)) (.cse38 (< |ULTIMATE.start_main_~k~0#1| 2147483647)) (.cse33 (<= |ULTIMATE.start_main_~j~0#1| 2147483646)) (.cse73 (or (and .cse0 .cse6 .cse8 .cse10 .cse11) (and .cse0 .cse6 .cse8 .cse78 .cse10 .cse11) (and .cse0 .cse79 .cse6 .cse8 .cse10 .cse11)))) (let ((.cse39 (and .cse38 .cse33 .cse73 .cse25)) (.cse40 (and .cse33 .cse73 .cse25)) (.cse64 (and .cse38 .cse30 .cse1)) (.cse67 (and .cse38 .cse1 .cse53)) (.cse60 (< .cse77 2147483646)) (.cse76 (and .cse30 .cse34 .cse56)) (.cse72 (< |ULTIMATE.start_main_~i~0#1| 2147483644)) (.cse54 (< .cse77 2147483645)) (.cse75 (<= |ULTIMATE.start_main_~i~0#1| 3)) (.cse48 (<= |ULTIMATE.start_main_~k~0#1| 3))) (let ((.cse36 (<= |ULTIMATE.start_main_~i~0#1| 7)) (.cse35 (<= |ULTIMATE.start_main_~i~0#1| 2)) (.cse16 (<= |ULTIMATE.start_main_~i~0#1| 1)) (.cse45 (or (and .cse75 .cse30 .cse48) (and .cse75 .cse48 .cse53))) (.cse50 (or (and .cse30 .cse72 .cse54) (and .cse72 .cse54 .cse53))) (.cse51 (<= |ULTIMATE.start_main_~k~0#1| 6)) (.cse49 (<= |ULTIMATE.start_main_~k~0#1| 4)) (.cse43 (<= |ULTIMATE.start_main_~k~0#1| 5)) (.cse46 (<= |ULTIMATE.start_main_~k~0#1| 7)) (.cse70 (<= |ULTIMATE.start_main_~i~0#1| 8)) (.cse14 (<= |ULTIMATE.start_main_~k~0#1| 1)) (.cse42 (<= |ULTIMATE.start_main_~k~0#1| 2)) (.cse62 (< .cse77 2147483640)) (.cse59 (< .cse77 2147483644)) (.cse61 (< .cse77 2147483642)) (.cse44 (or (and .cse34 .cse56 .cse53) (and .cse34 .cse60 .cse53) .cse76)) (.cse58 (< .cse77 2147483641)) (.cse57 (< .cse77 2147483643)) (.cse47 (or .cse64 .cse65 .cse66 .cse67 .cse68 .cse69)) (.cse55 (or (and .cse1 .cse56 .cse33 .cse73 .cse25) (and .cse1 .cse33 .cse73 .cse60 .cse25))) (.cse37 (or .cse39 .cse40)) (.cse71 (<= |ULTIMATE.start_main_~k~0#1| 8)) (.cse63 (< |ULTIMATE.start_main_~i~0#1| 2147483639))) (let ((.cse7 (>= |ULTIMATE.start_main_~j~0#1| 0)) (.cse9 (<= |ULTIMATE.start_main_~m~0#1| 0)) (.cse31 (or (and .cse55 .cse71 .cse63) (and .cse72 .cse71 .cse48 .cse33 .cse63 .cse73 .cse25) (and .cse37 .cse71 .cse63) (and .cse34 .cse71 .cse54 .cse33 .cse63 .cse73 .cse25))) (.cse17 (or (and .cse34 .cse56 .cse44) (and .cse47 .cse61 .cse34) (and .cse47 .cse34 .cse59) (and .cse61 .cse34 .cse44) (and .cse58 .cse34 .cse44) (and .cse47 .cse34 .cse56) (and .cse47 .cse34 .cse60) (and .cse58 .cse47 .cse34) .cse76 (and .cse47 .cse34 .cse57) (and .cse47 .cse34 .cse54))) (.cse5 (or (and .cse62 .cse34 .cse54 .cse33 .cse73 .cse25) (and .cse62 .cse34 .cse55) (and .cse62 .cse37 .cse34))) (.cse13 (let ((.cse74 (or (and .cse0 .cse14 .cse75 .cse6 .cse8 .cse33 .cse10 .cse25 .cse11) (and .cse42 .cse75 .cse33 .cse73 .cse25) (and .cse0 .cse14 .cse42 .cse75 .cse6 .cse8 .cse33 .cse10 .cse25 .cse11)))) (or (and .cse72 .cse70 .cse48 .cse33 .cse46 .cse73 .cse25) (and .cse34 .cse70 .cse54 .cse33 .cse46 .cse73 .cse25) (and .cse14 .cse74 .cse70) (and .cse51 .cse55 .cse70) (and .cse34 .cse49 .cse70 .cse54 .cse33 .cse73 .cse25) (and .cse55 .cse70 .cse43) (and .cse55 .cse70 .cse46) (and .cse74 .cse70 .cse46) (and .cse72 .cse70 .cse48 .cse33 .cse73 .cse25) (and .cse37 .cse70 .cse46) (and .cse74 .cse42 .cse70)))) (.cse29 (or (and .cse47 .cse70 .cse71) (and .cse45 .cse70 .cse71) (and .cse30 .cse70 .cse71) (and .cse70 .cse71 .cse44) (and .cse70 .cse50 .cse71))) (.cse32 (or .cse64 .cse65 .cse66 (and .cse38 .cse47 .cse1) .cse67 .cse68 .cse69)) (.cse2 (or (and .cse62 .cse50 .cse63) (and .cse62 .cse44 .cse63) (and .cse62 .cse47 .cse63) (and .cse62 .cse30 .cse63))) (.cse12 (or (and .cse37 .cse1 .cse54) (and .cse55 .cse1 .cse56) (and .cse37 .cse1 .cse56) (and .cse37 .cse57 .cse1) (and .cse58 .cse55 .cse1) (and .cse37 .cse1 .cse59) (and .cse37 .cse1 .cse60) (and .cse58 .cse37 .cse1) (and .cse61 .cse55 .cse1) (and .cse37 .cse61 .cse1))) (.cse15 (let ((.cse41 (let ((.cse52 (or (and .cse19 .cse20 .cse0 .cse14 .cse21 .cse23 .cse24 .cse16 .cse10 .cse25) (and .cse19 .cse0 .cse14 .cse21 .cse23 .cse24 .cse27 .cse16 .cse10 .cse25) (and .cse19 .cse0 .cse14 .cse21 .cse23 .cse24 .cse16 .cse10 .cse25) (and .cse19 .cse0 .cse14 .cse26 .cse21 .cse23 .cse24 .cse16 .cse10 .cse25)))) (or (and .cse42 .cse35 .cse52) (and .cse14 .cse35 .cse52) (and .cse42 .cse35 .cse53))))) (or (and .cse41 .cse42 .cse36) (and .cse43 .cse44 .cse36) (and .cse45 .cse46 .cse36) (and .cse14 .cse41 .cse36) (and .cse44 .cse46 .cse36) (and .cse41 .cse46 .cse36) (and .cse47 .cse46 .cse36) (and .cse45 .cse48 .cse36) (and .cse49 .cse50 .cse36) (and .cse50 .cse46 .cse36) (and .cse51 .cse44 .cse36)))) (.cse18 (<= |ULTIMATE.start_main_~i~0#1| 0)) (.cse28 (or (and .cse37 .cse38) .cse39 .cse40)) (.cse3 (<= |ULTIMATE.start_main_~k~0#1| 2147483646)) (.cse4 (<= |ULTIMATE.start_main_~N~0#1| 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse5 .cse1) (and .cse0 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse12) (and .cse0 .cse13 .cse1 .cse3) (and .cse0 .cse14 .cse15 .cse16 .cse4) (and .cse0 .cse5 .cse1 .cse3) (and .cse0 .cse17) (and .cse0 .cse18 (or (and .cse19 .cse20 .cse0 .cse18 .cse21 .cse22 .cse23 .cse24 .cse10 .cse25) (and .cse19 .cse0 .cse26 .cse18 .cse21 .cse22 .cse23 .cse24 .cse10 .cse25) (and .cse19 .cse0 .cse18 .cse21 .cse22 .cse23 .cse24 .cse10 .cse25) (and .cse19 .cse0 .cse18 .cse21 .cse22 .cse23 .cse24 .cse27 .cse10 .cse25)) .cse22 .cse4) (and .cse0 .cse28 .cse1) (and .cse0 .cse28 .cse22 .cse16 .cse4) (and .cse0 .cse14 .cse29 .cse16 .cse4) (and .cse0 .cse13 .cse22 .cse16 .cse4) (and .cse0 .cse30 .cse1 .cse3 .cse4) (and .cse0 .cse18 .cse22 .cse17 .cse4) (and .cse0 .cse1 .cse3 .cse12 .cse4) (and .cse0 .cse5 .cse1 .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse29 .cse4) (and .cse0 .cse31 .cse22 .cse16 .cse4) (and .cse0 .cse32) (and .cse0 .cse6 .cse1 .cse21 .cse7 .cse23 .cse9 .cse24 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse12) (and .cse0 .cse18 .cse22 .cse2 .cse4) (and .cse0 .cse14 .cse32 .cse16 .cse4) (and .cse0 .cse18 .cse6 .cse21 .cse23 .cse24 .cse33 .cse10 .cse25 .cse11) (and .cse0 .cse32 .cse1 .cse3) (and .cse0 .cse15 .cse1 .cse3) (and .cse0 .cse32 .cse1 .cse3 .cse4) (and .cse0 .cse5 .cse22 .cse16 .cse4) (and .cse0 .cse6 .cse21 .cse7 .cse23 .cse9 .cse24 .cse16 .cse10 .cse11) (and .cse0 .cse31 .cse1 .cse3) (and .cse0 .cse1 .cse3 .cse17) (and .cse0 .cse14 .cse13 .cse1) (and .cse0 .cse31 .cse1) (and .cse0 .cse31 .cse1 .cse3 .cse4) (and .cse0 .cse14 .cse15 .cse16) (and .cse0 .cse14 .cse28 .cse1 .cse4) (and .cse0 .cse1 .cse3 .cse29) (and .cse0 .cse34 .cse6 .cse21 .cse7 .cse23 .cse9 .cse24 .cse10 .cse11) (and .cse0 .cse14 .cse16 .cse17 .cse4) (and .cse0 .cse14 .cse1 .cse12 .cse4) (and .cse0 .cse14 .cse31 .cse1 .cse4) (and .cse0 .cse1 .cse3 .cse17 .cse4) (and .cse0 .cse15) (and .cse0 .cse14 .cse5 .cse1 .cse4) (and .cse0 .cse2) (and .cse0 .cse14 .cse30 .cse16 .cse4) (and .cse0 .cse13 .cse1) (and .cse0 .cse14 .cse13 .cse1 .cse4) (and .cse0 .cse29) (and .cse0 .cse18 .cse22 .cse29 .cse4) (and .cse0 .cse32 .cse18 .cse22 .cse4) (and .cse0 .cse28 .cse1 .cse3 .cse4) (and .cse0 .cse30 .cse1 .cse3) (and .cse0 .cse14 .cse2 .cse16 .cse4) (and .cse0 .cse22 .cse12 .cse16 .cse4) (and .cse0 .cse15 .cse18 .cse22 .cse4) (and .cse0 .cse28 .cse1 .cse3) (and .cse0 .cse35 .cse6 .cse22 .cse8 .cse33 .cse16 .cse36 .cse10 .cse25 .cse4 .cse11))))))))) [2023-02-17 03:54:47,059 INFO L899 garLoopResultBuilder]: For program point L25-3(lines 25 32) no Hoare annotation was computed. [2023-02-17 03:54:47,059 INFO L899 garLoopResultBuilder]: For program point L21(lines 21 35) no Hoare annotation was computed. [2023-02-17 03:54:47,059 INFO L899 garLoopResultBuilder]: For program point L21-1(lines 21 35) no Hoare annotation was computed. [2023-02-17 03:54:47,059 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-17 03:54:47,059 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2023-02-17 03:54:47,059 INFO L899 garLoopResultBuilder]: For program point L26(line 26) no Hoare annotation was computed. [2023-02-17 03:54:47,059 INFO L899 garLoopResultBuilder]: For program point L26-1(line 26) no Hoare annotation was computed. [2023-02-17 03:54:47,064 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2023-02-17 03:54:47,066 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:54:47,067 INFO L178 ceAbstractionStarter]: Computing trace abstraction results