./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loops-crafted-1/discover_list.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/loops-crafted-1/discover_list.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 32bit --witnessprinter.graph.data.programhash 2aca78a4c905fef1e916fc947a81c98263f5056a4b2b5d7ea35195ed74fad5a5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 10:24:02,139 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 10:24:02,209 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-19 10:24:02,214 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 10:24:02,217 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 10:24:02,257 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 10:24:02,258 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 10:24:02,258 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 10:24:02,259 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 10:24:02,260 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 10:24:02,261 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 10:24:02,261 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 10:24:02,262 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 10:24:02,262 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 10:24:02,264 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 10:24:02,264 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 10:24:02,265 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 10:24:02,265 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 10:24:02,265 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 10:24:02,265 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 10:24:02,266 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 10:24:02,270 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 10:24:02,270 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 10:24:02,270 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 10:24:02,271 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 10:24:02,271 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 10:24:02,271 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 10:24:02,271 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 10:24:02,272 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 10:24:02,272 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 10:24:02,272 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 10:24:02,272 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 10:24:02,273 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 10:24:02,273 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 10:24:02,273 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:24:02,280 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 10:24:02,281 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 10:24:02,281 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 10:24:02,281 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 10:24:02,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 10:24:02,282 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 10:24:02,282 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 10:24:02,283 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 10:24:02,283 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 10:24:02,283 INFO L153 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 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2aca78a4c905fef1e916fc947a81c98263f5056a4b2b5d7ea35195ed74fad5a5 [2024-11-19 10:24:02,548 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 10:24:02,574 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 10:24:02,577 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 10:24:02,578 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 10:24:02,578 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 10:24:02,579 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/discover_list.c [2024-11-19 10:24:04,046 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 10:24:04,304 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 10:24:04,304 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/discover_list.c [2024-11-19 10:24:04,316 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f86a676d7/4a0d613e53264d2bb4b16c2aef6caffe/FLAGd9e22eb93 [2024-11-19 10:24:04,328 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f86a676d7/4a0d613e53264d2bb4b16c2aef6caffe [2024-11-19 10:24:04,331 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 10:24:04,332 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 10:24:04,336 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 10:24:04,336 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 10:24:04,342 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 10:24:04,343 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:24:04" (1/1) ... [2024-11-19 10:24:04,344 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@692d30e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:24:04, skipping insertion in model container [2024-11-19 10:24:04,344 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:24:04" (1/1) ... [2024-11-19 10:24:04,381 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 10:24:04,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:24:04,727 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 10:24:04,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:24:04,860 INFO L204 MainTranslator]: Completed translation [2024-11-19 10:24:04,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:24:04 WrapperNode [2024-11-19 10:24:04,861 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 10:24:04,862 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 10:24:04,862 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 10:24:04,862 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 10:24:04,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:24:04" (1/1) ... [2024-11-19 10:24:04,887 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:24:04" (1/1) ... [2024-11-19 10:24:04,937 INFO L138 Inliner]: procedures = 37, calls = 249, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 574 [2024-11-19 10:24:04,941 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 10:24:04,942 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 10:24:04,942 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 10:24:04,943 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 10:24:04,954 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:24:04" (1/1) ... [2024-11-19 10:24:04,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:24:04" (1/1) ... [2024-11-19 10:24:04,960 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:24:04" (1/1) ... [2024-11-19 10:24:05,003 INFO L175 MemorySlicer]: Split 181 memory accesses to 7 slices as follows [2, 10, 100, 12, 11, 4, 42]. 55 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0, 0]. The 148 writes are split as follows [0, 0, 97, 0, 11, 1, 39]. [2024-11-19 10:24:05,003 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:24:04" (1/1) ... [2024-11-19 10:24:05,003 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:24:04" (1/1) ... [2024-11-19 10:24:05,036 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:24:04" (1/1) ... [2024-11-19 10:24:05,044 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:24:04" (1/1) ... [2024-11-19 10:24:05,051 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:24:04" (1/1) ... [2024-11-19 10:24:05,058 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:24:04" (1/1) ... [2024-11-19 10:24:05,071 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 10:24:05,073 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 10:24:05,073 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 10:24:05,073 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 10:24:05,075 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:24:04" (1/1) ... [2024-11-19 10:24:05,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:24:05,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:24:05,110 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 10:24:05,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 10:24:05,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 10:24:05,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-19 10:24:05,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-19 10:24:05,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-11-19 10:24:05,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-11-19 10:24:05,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-11-19 10:24:05,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-11-19 10:24:05,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2024-11-19 10:24:05,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 10:24:05,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 10:24:05,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 10:24:05,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 10:24:05,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 10:24:05,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-19 10:24:05,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-19 10:24:05,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-19 10:24:05,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 10:24:05,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 10:24:05,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 10:24:05,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 10:24:05,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-19 10:24:05,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-19 10:24:05,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-19 10:24:05,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 10:24:05,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 10:24:05,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-19 10:24:05,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2024-11-19 10:24:05,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2024-11-19 10:24:05,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2024-11-19 10:24:05,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2024-11-19 10:24:05,170 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 10:24:05,170 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 10:24:05,170 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-19 10:24:05,170 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2024-11-19 10:24:05,171 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2024-11-19 10:24:05,171 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2024-11-19 10:24:05,171 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2024-11-19 10:24:05,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 10:24:05,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 10:24:05,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 10:24:05,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 10:24:05,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 10:24:05,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-19 10:24:05,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-19 10:24:05,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 10:24:05,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 10:24:05,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 10:24:05,174 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 10:24:05,174 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 10:24:05,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 10:24:05,348 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 10:24:05,350 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 10:24:06,427 INFO L? ?]: Removed 156 outVars from TransFormulas that were not future-live. [2024-11-19 10:24:06,428 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 10:24:06,450 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 10:24:06,451 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-19 10:24:06,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:24:06 BoogieIcfgContainer [2024-11-19 10:24:06,452 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 10:24:06,454 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 10:24:06,455 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 10:24:06,458 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 10:24:06,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:24:04" (1/3) ... [2024-11-19 10:24:06,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76165258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:24:06, skipping insertion in model container [2024-11-19 10:24:06,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:24:04" (2/3) ... [2024-11-19 10:24:06,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76165258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:24:06, skipping insertion in model container [2024-11-19 10:24:06,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:24:06" (3/3) ... [2024-11-19 10:24:06,462 INFO L112 eAbstractionObserver]: Analyzing ICFG discover_list.c [2024-11-19 10:24:06,480 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 10:24:06,480 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2024-11-19 10:24:06,561 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 10:24:06,568 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@50a4a12b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 10:24:06,569 INFO L334 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2024-11-19 10:24:06,574 INFO L276 IsEmpty]: Start isEmpty. Operand has 168 states, 114 states have (on average 1.7280701754385965) internal successors, (197), 156 states have internal predecessors, (197), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 10:24:06,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 10:24:06,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:24:06,581 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 10:24:06,582 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-11-19 10:24:06,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:24:06,588 INFO L85 PathProgramCache]: Analyzing trace with hash 85464, now seen corresponding path program 1 times [2024-11-19 10:24:06,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:24:06,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589625175] [2024-11-19 10:24:06,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:24:06,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:24:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:24:08,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:24:08,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:24:08,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589625175] [2024-11-19 10:24:08,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589625175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:24:08,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:24:08,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:24:08,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922238014] [2024-11-19 10:24:08,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:24:08,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:24:08,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:24:08,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:24:08,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:24:08,280 INFO L87 Difference]: Start difference. First operand has 168 states, 114 states have (on average 1.7280701754385965) internal successors, (197), 156 states have internal predecessors, (197), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:24:08,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:24:08,358 INFO L93 Difference]: Finished difference Result 317 states and 407 transitions. [2024-11-19 10:24:08,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:24:08,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2024-11-19 10:24:08,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:24:08,369 INFO L225 Difference]: With dead ends: 317 [2024-11-19 10:24:08,369 INFO L226 Difference]: Without dead ends: 149 [2024-11-19 10:24:08,373 INFO L431 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 [2024-11-19 10:24:08,376 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 3 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:24:08,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 398 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:24:08,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-19 10:24:08,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2024-11-19 10:24:08,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 100 states have (on average 1.61) internal successors, (161), 137 states have internal predecessors, (161), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 10:24:08,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 177 transitions. [2024-11-19 10:24:08,419 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 177 transitions. Word has length 3 [2024-11-19 10:24:08,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:24:08,420 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 177 transitions. [2024-11-19 10:24:08,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 10:24:08,420 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 177 transitions. [2024-11-19 10:24:08,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 10:24:08,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:24:08,421 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:24:08,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 10:24:08,422 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-11-19 10:24:08,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:24:08,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1439132924, now seen corresponding path program 1 times [2024-11-19 10:24:08,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:24:08,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490408667] [2024-11-19 10:24:08,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:24:08,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:24:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:24:09,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:24:09,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:24:09,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490408667] [2024-11-19 10:24:09,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490408667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:24:09,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:24:09,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:24:09,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726896046] [2024-11-19 10:24:09,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:24:09,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:24:09,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:24:09,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:24:09,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:24:09,480 INFO L87 Difference]: Start difference. First operand 149 states and 177 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 10:24:09,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:24:09,531 INFO L93 Difference]: Finished difference Result 292 states and 347 transitions. [2024-11-19 10:24:09,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:24:09,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-11-19 10:24:09,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:24:09,533 INFO L225 Difference]: With dead ends: 292 [2024-11-19 10:24:09,536 INFO L226 Difference]: Without dead ends: 152 [2024-11-19 10:24:09,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:24:09,539 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 1 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:24:09,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 345 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:24:09,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-19 10:24:09,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2024-11-19 10:24:09,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 102 states have (on average 1.5980392156862746) internal successors, (163), 139 states have internal predecessors, (163), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 10:24:09,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 179 transitions. [2024-11-19 10:24:09,564 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 179 transitions. Word has length 26 [2024-11-19 10:24:09,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:24:09,565 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 179 transitions. [2024-11-19 10:24:09,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 10:24:09,565 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 179 transitions. [2024-11-19 10:24:09,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 10:24:09,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:24:09,566 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:24:09,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 10:24:09,568 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-11-19 10:24:09,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:24:09,569 INFO L85 PathProgramCache]: Analyzing trace with hash -555011782, now seen corresponding path program 1 times [2024-11-19 10:24:09,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:24:09,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96880081] [2024-11-19 10:24:09,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:24:09,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:24:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:24:10,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:24:10,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:24:10,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96880081] [2024-11-19 10:24:10,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96880081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:24:10,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:24:10,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:24:10,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540171033] [2024-11-19 10:24:10,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:24:10,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:24:10,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:24:10,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:24:10,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:24:10,539 INFO L87 Difference]: Start difference. First operand 151 states and 179 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 10:24:10,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:24:10,596 INFO L93 Difference]: Finished difference Result 151 states and 179 transitions. [2024-11-19 10:24:10,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:24:10,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-11-19 10:24:10,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:24:10,598 INFO L225 Difference]: With dead ends: 151 [2024-11-19 10:24:10,598 INFO L226 Difference]: Without dead ends: 149 [2024-11-19 10:24:10,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:24:10,601 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 15 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:24:10,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 466 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:24:10,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-19 10:24:10,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2024-11-19 10:24:10,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 102 states have (on average 1.5784313725490196) internal successors, (161), 137 states have internal predecessors, (161), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 10:24:10,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 177 transitions. [2024-11-19 10:24:10,618 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 177 transitions. Word has length 26 [2024-11-19 10:24:10,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:24:10,619 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 177 transitions. [2024-11-19 10:24:10,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 10:24:10,619 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 177 transitions. [2024-11-19 10:24:10,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 10:24:10,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:24:10,620 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:24:10,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 10:24:10,620 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-11-19 10:24:10,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:24:10,620 INFO L85 PathProgramCache]: Analyzing trace with hash -25495859, now seen corresponding path program 1 times [2024-11-19 10:24:10,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:24:10,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441493979] [2024-11-19 10:24:10,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:24:10,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:24:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:24:11,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:24:11,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:24:11,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441493979] [2024-11-19 10:24:11,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441493979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:24:11,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:24:11,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:24:11,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957279192] [2024-11-19 10:24:11,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:24:11,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:24:11,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:24:11,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:24:11,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:24:11,540 INFO L87 Difference]: Start difference. First operand 149 states and 177 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 10:24:11,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:24:11,593 INFO L93 Difference]: Finished difference Result 156 states and 185 transitions. [2024-11-19 10:24:11,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:24:11,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-11-19 10:24:11,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:24:11,595 INFO L225 Difference]: With dead ends: 156 [2024-11-19 10:24:11,596 INFO L226 Difference]: Without dead ends: 154 [2024-11-19 10:24:11,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:24:11,598 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 21 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:24:11,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 321 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:24:11,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-19 10:24:11,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-19 10:24:11,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 107 states have (on average 1.560747663551402) internal successors, (167), 142 states have internal predecessors, (167), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 10:24:11,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 183 transitions. [2024-11-19 10:24:11,617 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 183 transitions. Word has length 27 [2024-11-19 10:24:11,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:24:11,618 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 183 transitions. [2024-11-19 10:24:11,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 10:24:11,618 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 183 transitions. [2024-11-19 10:24:11,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 10:24:11,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:24:11,620 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:24:11,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 10:24:11,621 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-11-19 10:24:11,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:24:11,621 INFO L85 PathProgramCache]: Analyzing trace with hash -25436277, now seen corresponding path program 1 times [2024-11-19 10:24:11,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:24:11,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507308226] [2024-11-19 10:24:11,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:24:11,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:24:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:24:12,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:24:12,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:24:12,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507308226] [2024-11-19 10:24:12,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507308226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:24:12,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:24:12,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:24:12,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134948731] [2024-11-19 10:24:12,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:24:12,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:24:12,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:24:12,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:24:12,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:24:12,556 INFO L87 Difference]: Start difference. First operand 154 states and 183 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 10:24:12,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:24:12,589 INFO L93 Difference]: Finished difference Result 160 states and 189 transitions. [2024-11-19 10:24:12,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:24:12,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-11-19 10:24:12,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:24:12,594 INFO L225 Difference]: With dead ends: 160 [2024-11-19 10:24:12,594 INFO L226 Difference]: Without dead ends: 158 [2024-11-19 10:24:12,594 INFO L431 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 [2024-11-19 10:24:12,595 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 11 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:24:12,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 323 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:24:12,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-19 10:24:12,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 153. [2024-11-19 10:24:12,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 106 states have (on average 1.5566037735849056) internal successors, (165), 141 states have internal predecessors, (165), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 10:24:12,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 181 transitions. [2024-11-19 10:24:12,604 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 181 transitions. Word has length 27 [2024-11-19 10:24:12,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:24:12,604 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 181 transitions. [2024-11-19 10:24:12,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 10:24:12,604 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 181 transitions. [2024-11-19 10:24:12,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 10:24:12,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:24:12,605 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:24:12,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 10:24:12,605 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-11-19 10:24:12,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:24:12,606 INFO L85 PathProgramCache]: Analyzing trace with hash -738660657, now seen corresponding path program 1 times [2024-11-19 10:24:12,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:24:12,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751590912] [2024-11-19 10:24:12,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:24:12,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:24:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:24:14,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:24:14,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:24:14,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751590912] [2024-11-19 10:24:14,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751590912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:24:14,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:24:14,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 10:24:14,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643255079] [2024-11-19 10:24:14,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:24:14,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 10:24:14,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:24:14,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 10:24:14,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 10:24:14,994 INFO L87 Difference]: Start difference. First operand 153 states and 181 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 10:24:15,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:24:15,150 INFO L93 Difference]: Finished difference Result 275 states and 323 transitions. [2024-11-19 10:24:15,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 10:24:15,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2024-11-19 10:24:15,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:24:15,151 INFO L225 Difference]: With dead ends: 275 [2024-11-19 10:24:15,151 INFO L226 Difference]: Without dead ends: 157 [2024-11-19 10:24:15,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:24:15,155 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 163 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:24:15,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 490 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:24:15,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-19 10:24:15,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2024-11-19 10:24:15,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 108 states have (on average 1.5462962962962963) internal successors, (167), 143 states have internal predecessors, (167), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 10:24:15,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 183 transitions. [2024-11-19 10:24:15,171 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 183 transitions. Word has length 32 [2024-11-19 10:24:15,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:24:15,171 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 183 transitions. [2024-11-19 10:24:15,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 10:24:15,171 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 183 transitions. [2024-11-19 10:24:15,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 10:24:15,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:24:15,172 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:24:15,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 10:24:15,176 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-11-19 10:24:15,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:24:15,177 INFO L85 PathProgramCache]: Analyzing trace with hash -688790523, now seen corresponding path program 1 times [2024-11-19 10:24:15,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:24:15,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359432956] [2024-11-19 10:24:15,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:24:15,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:24:16,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:24:17,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:24:17,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:24:17,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359432956] [2024-11-19 10:24:17,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359432956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:24:17,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:24:17,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 10:24:17,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036183562] [2024-11-19 10:24:17,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:24:17,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:24:17,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:24:17,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:24:17,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:24:17,377 INFO L87 Difference]: Start difference. First operand 155 states and 183 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 10:24:17,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:24:17,579 INFO L93 Difference]: Finished difference Result 169 states and 199 transitions. [2024-11-19 10:24:17,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:24:17,579 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2024-11-19 10:24:17,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:24:17,582 INFO L225 Difference]: With dead ends: 169 [2024-11-19 10:24:17,582 INFO L226 Difference]: Without dead ends: 167 [2024-11-19 10:24:17,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 10:24:17,583 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 166 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 10:24:17,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 641 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 10:24:17,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-19 10:24:17,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 158. [2024-11-19 10:24:17,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 111 states have (on average 1.5495495495495495) internal successors, (172), 146 states have internal predecessors, (172), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 10:24:17,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 188 transitions. [2024-11-19 10:24:17,596 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 188 transitions. Word has length 32 [2024-11-19 10:24:17,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:24:17,597 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 188 transitions. [2024-11-19 10:24:17,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 10:24:17,598 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 188 transitions. [2024-11-19 10:24:17,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 10:24:17,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:24:17,599 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:24:17,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 10:24:17,600 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-11-19 10:24:17,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:24:17,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1331620200, now seen corresponding path program 1 times [2024-11-19 10:24:17,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:24:17,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863256791] [2024-11-19 10:24:17,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:24:17,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:24:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:24:18,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 10:24:18,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:24:18,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863256791] [2024-11-19 10:24:18,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863256791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:24:18,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:24:18,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 10:24:18,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716675217] [2024-11-19 10:24:18,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:24:18,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:24:18,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:24:18,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:24:18,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:24:18,742 INFO L87 Difference]: Start difference. First operand 158 states and 188 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 10:24:18,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:24:18,785 INFO L93 Difference]: Finished difference Result 271 states and 319 transitions. [2024-11-19 10:24:18,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:24:18,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2024-11-19 10:24:18,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:24:18,788 INFO L225 Difference]: With dead ends: 271 [2024-11-19 10:24:18,788 INFO L226 Difference]: Without dead ends: 160 [2024-11-19 10:24:18,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:24:18,793 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:24:18,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 509 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:24:18,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-19 10:24:18,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2024-11-19 10:24:18,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 113 states have (on average 1.5398230088495575) internal successors, (174), 148 states have internal predecessors, (174), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 10:24:18,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 190 transitions. [2024-11-19 10:24:18,803 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 190 transitions. Word has length 36 [2024-11-19 10:24:18,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:24:18,804 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 190 transitions. [2024-11-19 10:24:18,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 10:24:18,805 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 190 transitions. [2024-11-19 10:24:18,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 10:24:18,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:24:18,806 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:24:18,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 10:24:18,806 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-11-19 10:24:18,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:24:18,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1381490334, now seen corresponding path program 1 times [2024-11-19 10:24:18,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:24:18,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528207926] [2024-11-19 10:24:18,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:24:18,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:24:19,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:24:20,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:24:20,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:24:20,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528207926] [2024-11-19 10:24:20,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528207926] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:24:20,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525574424] [2024-11-19 10:24:20,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:24:20,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:24:20,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:24:20,890 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) [2024-11-19 10:24:20,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 10:24:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:24:21,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-19 10:24:21,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:24:22,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 485 treesize of output 484 [2024-11-19 10:24:30,698 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 329 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-19 10:24:34,730 WARN L851 $PredicateComparison]: unable to prove that (and (= 9 |c_~#smp_def_rrlen_arr~0.base|) (let ((.cse1 (select |c_#memory_int#2| 9))) (= (store (store (store (store (store (store (store (store (store (store (let ((.cse11 (+ 340 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (let ((.cse10 (+ |c_~#smp_def_rrlen_arr~0.offset| 272))) (store (store (store (store (store (store (store (store (let ((.cse9 (+ |c_~#smp_def_rrlen_arr~0.offset| 240))) (store (store (store (store (store (store (store (store (store (store (store (store (store (let ((.cse8 (+ |c_~#smp_def_rrlen_arr~0.offset| 188))) (store (let ((.cse7 (+ |c_~#smp_def_rrlen_arr~0.offset| 184))) (store (let ((.cse6 (+ |c_~#smp_def_rrlen_arr~0.offset| 180))) (store (store (store (store (store (let ((.cse5 (+ 160 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (store (store (store (store (store (store (store (store (store (store (store (let ((.cse4 (+ |c_~#smp_def_rrlen_arr~0.offset| 108))) (store (store (let ((.cse3 (+ |c_~#smp_def_rrlen_arr~0.offset| 100))) (store (let ((.cse2 (+ |c_~#smp_def_rrlen_arr~0.offset| 96))) (store (store (store (store (store (store (store (store (store (store (store (let ((.cse0 (+ |c_~#smp_def_rrlen_arr~0.offset| 52))) (store (store (store (store (store (store (store (store (store (store (store (store (store (store ((as const (Array Int Int)) 0) |c_~#smp_def_rrlen_arr~0.offset| 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 4) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 8) 6) (+ |c_~#smp_def_rrlen_arr~0.offset| 12) 1) (+ |c_~#smp_def_rrlen_arr~0.offset| 16) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 20) 14) (+ |c_~#smp_def_rrlen_arr~0.offset| 24) 2) (+ |c_~#smp_def_rrlen_arr~0.offset| 28) (- 3)) (+ |c_~#smp_def_rrlen_arr~0.offset| 32) (- 3)) (+ |c_~#smp_def_rrlen_arr~0.offset| 36) 3) (+ 40 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 44) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 48) 4) .cse0 (select .cse1 .cse0))) (+ 56 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 60) 5) (+ |c_~#smp_def_rrlen_arr~0.offset| 64) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 68) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 72) 6) (+ 76 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 80) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 84) 7) (+ 88 |c_~#smp_def_rrlen_arr~0.offset|) (- 3)) (+ 92 |c_~#smp_def_rrlen_arr~0.offset|) (- 3)) .cse2 (select .cse1 .cse2))) .cse3 (select .cse1 .cse3))) (+ |c_~#smp_def_rrlen_arr~0.offset| 104) 12) .cse4 (select .cse1 .cse4))) (+ 112 |c_~#smp_def_rrlen_arr~0.offset|) 2) (+ 116 |c_~#smp_def_rrlen_arr~0.offset|) 6) (+ |c_~#smp_def_rrlen_arr~0.offset| 120) 18) (+ |c_~#smp_def_rrlen_arr~0.offset| 124) 2) (+ |c_~#smp_def_rrlen_arr~0.offset| 128) 13) (+ |c_~#smp_def_rrlen_arr~0.offset| 132) 19) (+ |c_~#smp_def_rrlen_arr~0.offset| 136) 2) (+ 140 |c_~#smp_def_rrlen_arr~0.offset|) 9) (+ |c_~#smp_def_rrlen_arr~0.offset| 144) 20) (+ |c_~#smp_def_rrlen_arr~0.offset| 148) (- 2)) (+ 152 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 156) 32) .cse5 (select .cse1 .cse5))) (+ |c_~#smp_def_rrlen_arr~0.offset| 164) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 168) 33) (+ |c_~#smp_def_rrlen_arr~0.offset| 172) (- 2)) (+ 176 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) .cse6 (select .cse1 .cse6))) .cse7 (select .cse1 .cse7))) .cse8 (select .cse1 .cse8))) (+ 192 |c_~#smp_def_rrlen_arr~0.offset|) 128) (+ 196 |c_~#smp_def_rrlen_arr~0.offset|) 3) (+ |c_~#smp_def_rrlen_arr~0.offset| 200) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 204) 129) (+ |c_~#smp_def_rrlen_arr~0.offset| 208) (- 2)) (+ 212 |c_~#smp_def_rrlen_arr~0.offset|) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 216) 130) (+ |c_~#smp_def_rrlen_arr~0.offset| 220) (- 3)) (+ |c_~#smp_def_rrlen_arr~0.offset| 224) (- 3)) (+ 228 |c_~#smp_def_rrlen_arr~0.offset|) 131) (+ 232 |c_~#smp_def_rrlen_arr~0.offset|) (- 3)) (+ |c_~#smp_def_rrlen_arr~0.offset| 236) (- 3)) .cse9 (select .cse1 .cse9))) (+ |c_~#smp_def_rrlen_arr~0.offset| 244) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 248) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 252) 134) (+ |c_~#smp_def_rrlen_arr~0.offset| 256) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 260) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 264) 135) (+ |c_~#smp_def_rrlen_arr~0.offset| 268) (- 2)) .cse10 (select .cse1 .cse10))) (+ 276 |c_~#smp_def_rrlen_arr~0.offset|) 136) (+ |c_~#smp_def_rrlen_arr~0.offset| 280) (- 2)) (+ 284 |c_~#smp_def_rrlen_arr~0.offset|) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 288) 137) (+ |c_~#smp_def_rrlen_arr~0.offset| 292) (- 2)) (+ 296 |c_~#smp_def_rrlen_arr~0.offset|) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 300) 138) (+ |c_~#smp_def_rrlen_arr~0.offset| 304) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 308) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 312) 139) (+ 316 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 320) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 324) 144) (+ |c_~#smp_def_rrlen_arr~0.offset| 328) 9) (+ |c_~#smp_def_rrlen_arr~0.offset| 332) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 336) 145) .cse11 (select .cse1 .cse11))) (+ |c_~#smp_def_rrlen_arr~0.offset| 344) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 348) 146) (+ 352 |c_~#smp_def_rrlen_arr~0.offset|) 9) (+ 356 |c_~#smp_def_rrlen_arr~0.offset|) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 360) 147) (+ |c_~#smp_def_rrlen_arr~0.offset| 364) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 368) 0) (+ 372 |c_~#smp_def_rrlen_arr~0.offset|) (- 1)) (+ |c_~#smp_def_rrlen_arr~0.offset| 376) (- 1)) (+ |c_~#smp_def_rrlen_arr~0.offset| 380) (- 1)) .cse1))) is different from false [2024-11-19 10:24:38,742 WARN L873 $PredicateComparison]: unable to prove that (and (= 9 |c_~#smp_def_rrlen_arr~0.base|) (let ((.cse1 (select |c_#memory_int#2| 9))) (= (store (store (store (store (store (store (store (store (store (store (let ((.cse11 (+ 340 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (let ((.cse10 (+ |c_~#smp_def_rrlen_arr~0.offset| 272))) (store (store (store (store (store (store (store (store (let ((.cse9 (+ |c_~#smp_def_rrlen_arr~0.offset| 240))) (store (store (store (store (store (store (store (store (store (store (store (store (store (let ((.cse8 (+ |c_~#smp_def_rrlen_arr~0.offset| 188))) (store (let ((.cse7 (+ |c_~#smp_def_rrlen_arr~0.offset| 184))) (store (let ((.cse6 (+ |c_~#smp_def_rrlen_arr~0.offset| 180))) (store (store (store (store (store (let ((.cse5 (+ 160 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (store (store (store (store (store (store (store (store (store (store (store (let ((.cse4 (+ |c_~#smp_def_rrlen_arr~0.offset| 108))) (store (store (let ((.cse3 (+ |c_~#smp_def_rrlen_arr~0.offset| 100))) (store (let ((.cse2 (+ |c_~#smp_def_rrlen_arr~0.offset| 96))) (store (store (store (store (store (store (store (store (store (store (store (let ((.cse0 (+ |c_~#smp_def_rrlen_arr~0.offset| 52))) (store (store (store (store (store (store (store (store (store (store (store (store (store (store ((as const (Array Int Int)) 0) |c_~#smp_def_rrlen_arr~0.offset| 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 4) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 8) 6) (+ |c_~#smp_def_rrlen_arr~0.offset| 12) 1) (+ |c_~#smp_def_rrlen_arr~0.offset| 16) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 20) 14) (+ |c_~#smp_def_rrlen_arr~0.offset| 24) 2) (+ |c_~#smp_def_rrlen_arr~0.offset| 28) (- 3)) (+ |c_~#smp_def_rrlen_arr~0.offset| 32) (- 3)) (+ |c_~#smp_def_rrlen_arr~0.offset| 36) 3) (+ 40 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 44) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 48) 4) .cse0 (select .cse1 .cse0))) (+ 56 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 60) 5) (+ |c_~#smp_def_rrlen_arr~0.offset| 64) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 68) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 72) 6) (+ 76 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 80) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 84) 7) (+ 88 |c_~#smp_def_rrlen_arr~0.offset|) (- 3)) (+ 92 |c_~#smp_def_rrlen_arr~0.offset|) (- 3)) .cse2 (select .cse1 .cse2))) .cse3 (select .cse1 .cse3))) (+ |c_~#smp_def_rrlen_arr~0.offset| 104) 12) .cse4 (select .cse1 .cse4))) (+ 112 |c_~#smp_def_rrlen_arr~0.offset|) 2) (+ 116 |c_~#smp_def_rrlen_arr~0.offset|) 6) (+ |c_~#smp_def_rrlen_arr~0.offset| 120) 18) (+ |c_~#smp_def_rrlen_arr~0.offset| 124) 2) (+ |c_~#smp_def_rrlen_arr~0.offset| 128) 13) (+ |c_~#smp_def_rrlen_arr~0.offset| 132) 19) (+ |c_~#smp_def_rrlen_arr~0.offset| 136) 2) (+ 140 |c_~#smp_def_rrlen_arr~0.offset|) 9) (+ |c_~#smp_def_rrlen_arr~0.offset| 144) 20) (+ |c_~#smp_def_rrlen_arr~0.offset| 148) (- 2)) (+ 152 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 156) 32) .cse5 (select .cse1 .cse5))) (+ |c_~#smp_def_rrlen_arr~0.offset| 164) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 168) 33) (+ |c_~#smp_def_rrlen_arr~0.offset| 172) (- 2)) (+ 176 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) .cse6 (select .cse1 .cse6))) .cse7 (select .cse1 .cse7))) .cse8 (select .cse1 .cse8))) (+ 192 |c_~#smp_def_rrlen_arr~0.offset|) 128) (+ 196 |c_~#smp_def_rrlen_arr~0.offset|) 3) (+ |c_~#smp_def_rrlen_arr~0.offset| 200) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 204) 129) (+ |c_~#smp_def_rrlen_arr~0.offset| 208) (- 2)) (+ 212 |c_~#smp_def_rrlen_arr~0.offset|) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 216) 130) (+ |c_~#smp_def_rrlen_arr~0.offset| 220) (- 3)) (+ |c_~#smp_def_rrlen_arr~0.offset| 224) (- 3)) (+ 228 |c_~#smp_def_rrlen_arr~0.offset|) 131) (+ 232 |c_~#smp_def_rrlen_arr~0.offset|) (- 3)) (+ |c_~#smp_def_rrlen_arr~0.offset| 236) (- 3)) .cse9 (select .cse1 .cse9))) (+ |c_~#smp_def_rrlen_arr~0.offset| 244) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 248) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 252) 134) (+ |c_~#smp_def_rrlen_arr~0.offset| 256) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 260) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 264) 135) (+ |c_~#smp_def_rrlen_arr~0.offset| 268) (- 2)) .cse10 (select .cse1 .cse10))) (+ 276 |c_~#smp_def_rrlen_arr~0.offset|) 136) (+ |c_~#smp_def_rrlen_arr~0.offset| 280) (- 2)) (+ 284 |c_~#smp_def_rrlen_arr~0.offset|) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 288) 137) (+ |c_~#smp_def_rrlen_arr~0.offset| 292) (- 2)) (+ 296 |c_~#smp_def_rrlen_arr~0.offset|) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 300) 138) (+ |c_~#smp_def_rrlen_arr~0.offset| 304) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 308) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 312) 139) (+ 316 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 320) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 324) 144) (+ |c_~#smp_def_rrlen_arr~0.offset| 328) 9) (+ |c_~#smp_def_rrlen_arr~0.offset| 332) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 336) 145) .cse11 (select .cse1 .cse11))) (+ |c_~#smp_def_rrlen_arr~0.offset| 344) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 348) 146) (+ 352 |c_~#smp_def_rrlen_arr~0.offset|) 9) (+ 356 |c_~#smp_def_rrlen_arr~0.offset|) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 360) 147) (+ |c_~#smp_def_rrlen_arr~0.offset| 364) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 368) 0) (+ 372 |c_~#smp_def_rrlen_arr~0.offset|) (- 1)) (+ |c_~#smp_def_rrlen_arr~0.offset| 376) (- 1)) (+ |c_~#smp_def_rrlen_arr~0.offset| 380) (- 1)) .cse1))) is different from true [2024-11-19 10:24:46,785 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 329 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-19 10:24:54,812 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-19 10:25:02,853 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 329 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-19 10:25:10,881 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-19 10:25:18,916 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 329 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-19 10:25:26,945 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-19 10:25:34,979 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 329 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)